On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability
MetadataShow full item record
In this paper we study the relationship between Stochastic Satisfiability (SSAT) (Papadimitriou 1985; Littman, Majercik, & Pitassi 2001) and Extended Hybrid Probabilistic Logic Programs (EHPP) with probabilistic answer set semantics (Saad 2006). We show that any instance of SSAT can be modularly translated into an EHPP program with probabilistic answer set semantics. In addition, we show 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 show 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.