Evidential support logic programming
Fuzzy Sets and Systems
On the semantics of rule-based expert systems with uncertainty
Lecture notes in computer science on ICDT '88
Logic programming with strong negation
Proceedings of the international workshop on Extensions of logic programming
Theory of generalized annotated logic programming and its applications
Journal of Logic Programming
Handbook of logic in artificial intelligence and logic programming (vol. 3)
Probabilistic logic programming with conditional constraints
ACM Transactions on Computational Logic (TOCL)
A Parametric Approach to Deductive Databases with Uncertainty
IEEE Transactions on Knowledge and Data Engineering
Axioms for probability and belief-function proagation
UAI '88 Proceedings of the Fourth Annual Conference on Uncertainty in Artificial Intelligence
Logic Programming with Defaults and Argumentation Theories
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Belief Logic Programming: Uncertainty Reasoning with Correlation of Evidence
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Parameter learning of logic programs for symbolic-statistical modeling
Journal of Artificial Intelligence Research
Probabilistic inductive logic programming
Probabilistic inductive logic programming
The independent choice logic and beyond
Probabilistic inductive 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
Belief Logic Programming with Cyclic Dependencies
RR '09 Proceedings of the 3rd International Conference on Web Reasoning and Rule Systems
Hi-index | 0.00 |
In this paper we introduce a fixpoint semantics for quantitative logic programming, which is able to both combine and correlate evidence from different sources of information. Based on this semantics, we develop efficient algorithms that can answer queries for non-ground programs with the help of an SLD-like procedure. We also analyze the computational complexity of the algorithms and illustrate their uses.