# 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} }

- Published 2001 in ACM Trans. Comput. Log.
DOI:10.1145/377978.377983

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

#### From This Paper

##### Figures, tables, and topics from this paper.

#### Citations

##### Publications citing this paper.

Showing 1-10 of 76 extracted citations

## Consistency Checking and Querying in Probabilistic Databases under Integrity Constraints

View 10 Excerpts

Highly Influenced

## Itemset frequency satisfiability: Complexity and axiomatization

View 4 Excerpts

Highly Influenced

## Axiomatization and Deduction Rules for the Frequency of Itemsets

View 5 Excerpts

Highly Influenced

## Analysis of Jeffrey's Rule of Conditioning in an Imprecise Probabilistic Setting

View 7 Excerpts

Highly Influenced

## Towards Statistical Reasoning in Description Logics over Finite Domains

View 4 Excerpts

Highly Influenced

## Towards Statistical Reasoning in Description Logics over Finite Domains (Full Version)

View 4 Excerpts

Highly Influenced

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

View 5 Excerpts

Highly Influenced

## Reasoning with imprecise probabilistic knowledge on enzymes for rapid screening of potential substrates or inhibitor structures

View 5 Excerpts

Highly Influenced

## Termination of logic programs with imperfect information: applications and query procedure

View 4 Excerpts

Highly Influenced

## Computational Complexity of Itemset Frequency Satisfiability

View 3 Excerpts

Highly Influenced

#### References

##### Publications referenced by this paper.

Showing 1-5 of 5 references

## Semantics, Consistency, and Query Processing of Empirical Deductive Databases

View 9 Excerpts

Highly Influenced

## Logic Programming with Signs and Annotations

View 8 Excerpts

Highly Influenced

## Probabilistic Deductive Databases

View 8 Excerpts

Highly Influenced

## Foundations of Logic Programming

View 5 Excerpts

Highly Influenced