Highly Influenced

# Paraconsistent Declarative Semantics for Extended Logic Programs

@article{Arieli2002ParaconsistentDS, title={Paraconsistent Declarative Semantics for Extended Logic Programs}, author={Ofer Arieli}, journal={Annals of Mathematics and Artificial Intelligence}, year={2002}, volume={36}, pages={381-417} }

- Published 2002 in Annals of Mathematics and Artificial Intelligence
DOI:10.1023/A:1016358201013

We introduce a fixpoint semantics for logic programs with two kinds of negation: an explicit negation and a negation-by-failure. The programs may also be prioritized, that is, their clauses may be arranged in a partial order that reflects preferences among the corresponding rules. This yields a robust framework for representing knowledge in logic programs with a considerable expressive power. The declarative semantics for such programs is particularly suitable for reasoning with uncertainty, in… CONTINUE READING

Highly Cited

This paper has 25 citations. REVIEW CITATIONS

#### From This Paper

##### Topics from this paper.

16 Citations

29 References

Similar Papers