Probabilistic logic programming with conditional constraints

@article{Lukasiewicz2001ProbabilisticLP,
  title={Probabilistic logic programming with conditional constraints},
  author={Thomas Lukasiewicz},
  journal={ACM Trans. Comput. Log.},
  year={2001},
  volume={2},
  pages={289-339}
}
We introduce a new approach to probabilistic logic programming in which probabilities are defined over a set of possible worlds. More precisely, classical program clauses are extended by a subinterval of [0,1] that describes a range for the conditional probability of the head of a clause given its body. We then analyze the complexity of selected probabilistic logic programming tasks. It turns out that probabilistic logic programming is computationally more complex than classical logic… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 76 extracted citations

Itemset frequency satisfiability: Complexity and axiomatization

Theor. Comput. Sci. • 2008
View 4 Excerpts
Highly Influenced

Imprecise probabilistic query answering using measures of ignorance and degree of satisfaction

Annals of Mathematics and Artificial Intelligence • 2012
View 5 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Semantics, Consistency, and Query Processing of Empirical Deductive Databases

IEEE Trans. Knowl. Data Eng. • 1997
View 9 Excerpts
Highly Influenced

Logic Programming with Signs and Annotations

J. Log. Comput. • 1996
View 8 Excerpts
Highly Influenced

Probabilistic Deductive Databases

View 8 Excerpts
Highly Influenced

Foundations of Logic Programming

Symbolic Computation • 1984
View 5 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…