Order and negation as failure

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

Volumn 2916, Issue , 2003, Pages 194-208

  Van Nieuwenborgh, Davy ^a   Vermeir, Dirk ^a  

^a VRIJE UNIVERSITEIT BRUSSEL   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET SEMANTICS; COMPUTATIONAL POWER; LOGIC PROGRAMS; NEGATION AS FAILURES;

SEMANTICS; APPLICATION PROGRAMS; COMPUTATION THEORY; LOGIC PROGRAMMING; OUTAGES; RECONFIGURABLE HARDWARE;

LOGIC PROGRAMMING; COMPUTER CIRCUITS;

EID: 0348155919     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24599-5_14     Document Type: Conference Paper

References (28)

1. G. Brewka. Logic programming with ordered disjunction. In Proc. of the 18th AAAI Conf., pages 100-105. AAAI Press, 2002.
2. G. Brewka, S. Benferhat, and D. Le Berre. Qualitative choice logic. In Proc. of the 8th Intl. Conf. on Knowledge Representation and Reasoning, pages 158-169. Morgan Kaufmann, 2002.
3. Gerhard Brewka and Thomas Eiter. Preferred answer sets for extended logic programs. Artificial Intelligence, 109(1-2):297-356, 1999.
4. Gerhard Brewka, Ilkka Niemela, and Tommi Syrjanen. Implementing ordered disjunction using answer set solvers for normal programs. In Flesca et al. [10], pages 444-455.
5. Francesco Buccafurri, Wolfgang Faber, and Nicola Leone. Disjunctive logic programs with inheritance. In Danny De Schreye, editor, Proc. of the Intl. Conf. on Logic Programming, pages 79-93. MIT Press, 1999.
6. Francesco Buccafurri, Nicola Leone, and Pasquale Rullo. Disjunctive ordered logic: Semantics and expressiveness. In A. et al. Cohn, editor, Proc. of the 6th Intl. Conf. on Principles of Knowledge Representation and Reasoning, pages 418-431. Morgan Kaufmann, 1998.
7. Keith L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293-322. Plemum Press, 1978.
8. Marina De Vos and Dirk Vermeir. Dynamically ordered probabilistic choice logic programming. In Sanjiv Kapoor and Sanjiva Prasad, editors, Foundations of 20th Software Technology and Theoretical Computer Science, 20th Conference, Proceedings, volume 1974 of LNCS, pages 227-239. Springer Verlag, 2000.
9. Thomas Eiter, Georg Gottlob, and Nicola Leone. Abduction from logic programs: Semantics and complexity. Theoretical Computer Science, 189(1-2):129-177, 1997.
10. Sergio Flesca, Sergio Greco, Nicola Leone, and Giovambattista Ianni, editors. Logic in Artificial Intelligence, volume 2424 of LNAI. Springer Verlag, 2002.
11. Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In R. et al. Kowalski, editor, Proc. of the 5th Intl. Conf. on Logic Programming, pages 1070-1080. The MIT Press, 1988.
12. Katsumi Inoue and Chiaki Sakama. On positive occurrences of negation as failure. In J. at al. Doyle, editor, Proc. of the 4th Intl. Conf. on Principles of Knowledge Representation and Reasoning, pages 293-304. Morgan Kaufmann, 1994.
13. Katsumi Inoue and Chiaki Sakama. A fixpoint characterization of abductive logic programs. Journal of Logic Programming, 27(2):107-136, 1996.
14. Katsumi Inoue and Chiaki Sakama. Negation as failure in the head. Journal of Logic Programming, 35(1):39-78, 1998.
15. A. C. Kakas, R. A. Kowalski, and F. Toni. Abductive logic programming. Journal of Logic and Computation, 2(6):719-770, 1992.
16. Robert A. Kowalski and Fariba Sadri. Logic programs with exceptions. In David H. D. Warren and Peter Szeredi, editors, Proc. of the 7th Intl. Conf. on Logic Programming, pages 598-613. The MIT Press, 1990.
17. E. Laenens and D. Vermeir. A fixpoint semantics of ordered logic. Journal of Logic and Computation, 1(2):159-185, 1990.
18. Els Laenens and Dirk Vermeir. Assumption-free semantics for ordered logic programs: On the relationship between well-founded and stable partial models. Journal of Logic and Computation, 2(2):133-172, 1992.
19. Nicola Leone, Pasquale Rullo, and Francesco Scarcello. Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation. Information and Computation, 135(2):69-112, 1997.
20. Vladimir Lifschitz. Answer set programming and plan generation. Journal of Artificial Intelligence, 138(1-2):39-54, 2002.
21. Teodor C. Przymusinski. Stable semantics for disjunctive programs. New Generation Computing, 9(3-4):401-424, 1991.
22. Raymond Reiter. A theory of diagnosis from first principles. Artificial Intelligence, 32(1):57-95, 1987.
23. Chiaki Sakama and Katsumi Inoue. An alternative approach to the semantics of disjunctive logic programs and deductive databases. Journal of Automated Reasoning, 13(1):145-172, 1994.
24. Chiaki Sakama and Katsumi Inoue. Representing priorities in logic programs. In Michael J. Maher, editor, Proc. of the Intl. Conf. on Logic Programming, pages 82-96. MIT Press, 1996.
25. Allen van Gelder, Kenneth A. Ross, and John S. Schlipf. Unfounded sets and well-founded semantics for general logic programs. In Proc. of the 7th PODS Symposium, pages 221-230. ACM Press, 1988.
26. Davy Van Nieuwenborgh and Dirk Vermeir. Order and negation as failure. Technical report, Vrije Universiteit Brussel, Dept. of Computer Science, 2003.
27. DavyVan Nieuwenborgh and DirkVermeir. Preferred answer sets for ordered logic programs. In Flesca et al. [10], pages 432-443.
28. KewenWang, Lizhu Zhou, and Fangzhen Lin. Alternating fixpoint theory for logic programs with priority. In John W. Lloyd et al., editor, Computational Logic, volume 1861 of LNCS, pages 164-178. Springer, 2000.