Epistemic foundation of the well-founded semantics over bilattices

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3153, Issue , 2004, Pages 513-524

  Loyer, Yann ^a   Straccia, Umberto ^b  

^a UNIVERSITY OF VERSAILLES   (France)

^b CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING;

BILATTICES; FIXPOINTS; LOGIC PROGRAMS; NEGATIVE INFORMATION; PROGRAM TRANSFORMATIONS; WELL FOUNDED SEMANTICS;

SEMANTICS;

EID: 33645437682     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28629-5_39     Document Type: Article

References (22)

1. O. Arieli. Paraconsistent declarative semantics for extended logic programs. Annals of Mathematics and Artificial Intelligence, 36(4):381-417, 2002.
2. O. Arieli and A. Avron. The value of the four values. Artificial Intelligence Journal, 102(1):97-141, 1998.
3. N. D. Belnap. A useful four-valued logic. In G. Epstein and J. M. Dunn, editors, Modern uses of multiple-valued logic, pages 5-37. Reidel, Dordrecht, NL, 1977.
4. H. Blair and V. S. Subrahmanian. Paraconsistent logic programming. Theoretical Computer Science, 68:135-154, 1989.
5. K.L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and data bases, pages 293-322. Plenum Press, New York, NY, 1978.
6. C. V. Damásio and L. M. Pereira. A survey of paraconsistent semantics for logic programs. In D. Gabbay and P. Smets, editors, Handbook of Defeasible Reasoning and Uncertainty Management Systems, pages 241-320. Kluwer, 1998.
7. M. H. Van Emden and R. A. Kowalski. The semantics of predicate logic as a programming language. Journal of the ACM (JACM), 23(4):733-742, 1976.
8. M. C. Fitting. The family of stable models. Journal of Logic Programming, 17:197-225, 1993.
9. M. C. Fitting. Fixpoint semantics for logic programming - a survey. Theoretical Computer Science, 21(3):25-51, 2002.
10. M. Fitting. A Kripke-Kleene-semantics for general logic programs. Journal of Logic Programming, 2:295-312, 1985.
11. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. A. Kowalski and K. Bowen, editors, Proc. of the 5th Int. Conf. on Logic Programming, pages 1070-1080. The MIT Press, 1988.
12. M. L. Ginsberg. Multi-valued logics: a uniform approach to reasoning in artificial intelligence. Computational Intelligence, 4:265-316, 1988.
13. K. Kunen. Negation in logic programming. Journal of Logic Programming, 4(4):289-308, 1987.
14. Y. Loyer and U. Straccia. Uncertainty and partial non-uniform assumptions in parametric deductive databases. In Proc. of the 8th European Conf. on Logics in Artificial Intelligence (JELIA-02), LNCS 2424, pages 271-282. Springer-Verlag, 2002.
15. Y. Loyer and U. Straccia. The approximate well-founded semantics for logic programs with uncertainty. In 28th Int. Sym. on Mathematical Foundations of Computer Science (MFCS-2003), LNCS 2747, pages 541-550. Springer-Verlag, 2003.
16. Y. Loyer and U. Straccia. Default knowledge in logic programs with uncertainty. In Proc. of the 19th Int. Conf. on Logic Programming (ICLP-03), LNCS 2916, pages 466-480. Springer Verlag, 2003.
17. T. Lukasiewicz. Fixpoint characterizations for many-valued disjunctive logic programs with probabilistic semantics. In In Proc. of the 6th Int. Conf. on Logic Programming and Nonmonotonic Reasoning (LPNMR-01), LNAI 2173, pages 336-350. Springer-Verlag, 2001.
18. R. Ng and V.S. Subrahmanian. Stable model semantics for probabilistic deductive databases. In Z. W. Ras and M. Zemenkova, editors, Proc. of the 6th Int. Sym. on Methodologies for Intelligent Systems (ISMIS-91), LNAI 542, pages 163-171. Springer-Verlag, 1991.
19. T. C. Przymusinski. Extended stable semantics for normal and disjunctive programs. In D. H. D. Warren and P. Szeredi, editors, Proc. of the 7th Int. Conf. on Logic Programming, pages 459-477. MIT Press, 1990.
20. T. C. Przymusinski. The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae, 13(4):445-463, 1990.
21. R. Reiter. On closed world data bases. In Hervé Gallaire and Jack Minker, editors, Logic and data bases, pages 55-76. Plenum Press, New York, NY, 1978.
22. A. van Gelder, K. A. Ross, and J. S. Schlimpf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620-650, 1991.