On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability

Simple item page
dc.contributor.authorSaad Emad
dc.date.accessioned2018-05-24T05:14:48Z
dc.date.accessioned2023-08-19T08:17:26Z
dc.date.available2018-05-24T05:14:48Z
dc.date.available2023-08-19T08:17:26Z
dc.date.issued2008
dc.descriptionSaad, E. (2008, October). On the relationship between hybrid probabilistic logic programs and stochastic satisfiability. In International Conference on Scalable Uncertainty Management (pp. 356-371). Springer, Berlin, Heidelberg.en_US
dc.description.abstractIn this paper we study the relationship between Stochastic Satisfiability (SSAT) [20,12] and Extended Hybrid Probabilistic Logic Programs (EHPP) with probabilistic answer set semantics [22]. We show that any instance of SSAT can be modularly translated into an EHPP program with probabilistic answer set semantics. In addition, we prove that there is no modular mapping from EHPP to SSAT. This shows that EHPP is more expressive than SSAT from the knowledge representation point of view. Moreover, we present that the translation in the other way around from a program in EHPP to SSAT is more involved. We show that not every program in EHPP can be translated into an SSAT instance, rather a restricted class of EHPP can be translated into SSAT. Keywords Security ,UAE , Biometrics , Abu Dhabi Policeen
dc.identifier.citationSaad, E. (2008, October). On the relationship between hybrid probabilistic logic programs and stochastic satisfiability. In International Conference on Scalable Uncertainty Management (pp. 356-371). Berlin, Heidelberg: Springer Berlin Heidelberg.en
dc.identifier.doihttps://doi.org/10.1007/978-3-540-87993-0_28
dc.identifier.urihttps://edms.wexl.in/handle/1/1378
dc.language.isoen_USen_US
dc.publisherSpringeren_US
dc.titleOn the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiabilityen_US
dc.typeArticleen_US

Files

Collections

Cyber Security