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}
}
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
16 Citations
29 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 29 references

Reasoning with logical bilattices. Journal of Logic, Language, and Inform

  • O.Arieli, A.Avron
  • 1996
Highly Influential
7 Excerpts

Logic programs with exceptions

  • R.A.Kowalski, F.Sadri
  • Proc. 7th International Conference on Logic…
  • 1990
Highly Influential
7 Excerpts

The value of the four values

  • O.Arieli, A.Avron
  • Arti cial Intelligence
  • 1998
Highly Influential
4 Excerpts

Logic programs with classical negation

  • M.Gelfond, V.Lifschitz
  • Proc. 7th International Con- ference on Logic…
  • 1990
Highly Influential
7 Excerpts

Similar Papers

Loading similar papers…