The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Theory of generalized annotated logic programming and its applications
Journal of Logic Programming
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
Temporal probabilistic logic programs
Proceedings of the 1999 international conference on Logic programming
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
The Well-Founded Semantics in Normal Logic Programs with Uncertainty
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
Coherent Well-founded Annotated Logic Programs
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Adaptive Bayesian Logic Programs
ILP '01 Proceedings of the 11th International Conference on Inductive Logic Programming
On a theory of probabilistic deductive databases
Theory and Practice of Logic Programming
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Hybrid probabilistic programs: algorithms and complexity
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Hybrid probabilistic logic programs with non-monotonic negation
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Towards a more practical hybrid probabilistic logic programming framework
PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
Probabilistic Planning in Hybrid Probabilistic Logic Programs
SUM '07 Proceedings of the 1st international conference on Scalable Uncertainty Management
A Logical Framework to Reinforcement Learning Using Hybrid Probabilistic Logic Programs
SUM '08 Proceedings of the 2nd international conference on Scalable Uncertainty Management
On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability
SUM '08 Proceedings of the 2nd 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
Probabilistic Reasoning by SAT Solvers
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Probabilistic Planning with Imperfect Sensing Actions Using Hybrid Probabilistic Logic Programs
SUM '09 Proceedings of the 3rd International Conference on Scalable Uncertainty Management
Extended Fuzzy Logic Programs with Fuzzy Answer Set Semantics
SUM '09 Proceedings of the 3rd International Conference on Scalable Uncertainty Management
Disjunctive fuzzy logic programs with fuzzy answer set semantics
SUM'10 Proceedings of the 4th international conference on Scalable uncertainty management
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
| Hi-index | 0.00 |
Although negative conclusions are presented implicitly in Normal Hybrid Probabilistic Programs (NHPP) [26] through the closed world assumption, representing and reasoning with explicit negation is needed in NHPP to allow the ability to reason with incomplete knowledge. In this paper we extend the language of NHPP to explicitly encode classical negation in addition to non-monotonic negation. The semantics of the extended language is based on the answer set semantics of traditional logic programming [9]. We show that the proposed semantics is a natural extension to the answer set semantics of traditional logic programming [9]. In addition, the proposed semantics is reduced to stable probabilistic model semantics of NHPP [26]. The importance of that is computational methods developed for NHPP can be applied to the proposed language. Furthermore, we show that some commonsense probabilistic knowledge can be easily represented in the proposed language.