On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability

Authors:
Emad Saad
Affiliations:
College of Engineering and Computer Science, Abu Dhabi University, Abu Dhabi, UAE
Venue:
SUM '08 Proceedings of the 2nd international conference on Scalable Uncertainty Management
Year:
2008

Citing 16
Cited 4

Games against nature

Journal of Computer and System Sciences
Probabilistic logic programming

Information and Computation
Stable semantics for probabilistic deductive databases

Information and Computation
The independent choice logic for modelling multiple agents under uncertainty

Artificial Intelligence - Special issue on economic principles of multi-agent systems
A machine program for theorem-proving

Communications of the ACM
Logic programs with stable model semantics as a constraint programming paradigm

Annals of Mathematics and Artificial Intelligence
Stochastic Boolean Satisfiability

Journal of Automated Reasoning
Adaptive Bayesian Logic Programs

ILP '01 Proceedings of the 11th International Conference on Inductive Logic Programming
Contingent planning under uncertainty via stochastic satisfiability

Artificial Intelligence - special issue on planning with uncertainty and incomplete information
On a theory of probabilistic deductive databases

Theory and Practice of Logic Programming
ASSAT: computing answer sets of a logic program by SAT solvers

Artificial Intelligence - Special issue on nonmonotonic reasoning
Combining probabilistic logic programming with the power of maximum entropy

Artificial Intelligence - Special issue on nonmonotonic reasoning
A new approach to hybrid probabilistic logic programs

Annals of Mathematics and Artificial Intelligence
Probabilistic Planning in Hybrid Probabilistic Logic Programs

SUM '07 Proceedings of the 1st international conference on Scalable Uncertainty Management
A Logical Approach to Qualitative and Quantitative Reasoning

ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Incomplete knowledge in hybrid probabilistic logic programs

JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence

Probabilistic Reasoning by SAT Solvers

ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Extended Fuzzy Logic Programs with Fuzzy Answer Set Semantics

SUM '09 Proceedings of the 3rd International Conference on Scalable Uncertainty Management
Bridging the gap between reinforcement learning and knowledge representation: a logical off- and on-policy framework

ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Learning to act optimally in partially observable Markov decision processes using hybrid probabilistic logic programs

SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management

Quantified Score

Hi-index	0.00

Visualization

Abstract

In 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.