A well-founded semantics with disjunction

Lecture Notes in Computer Science

Volumn 3668, Issue , 2005, Pages 341-355

  Alcântara, João ^a   Damásio, Carlos Viegas ^a   Perdra, Luís Moniz ^a  

^a UNIVERSIDADE NOVA DE LISBOA   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING; MATHEMATICAL OPERATORS; MATHEMATICAL TRANSFORMATIONS;

NON-MINIMAL RULES; POINT-BASED OPERATORS; PROGRAM TRANSFORMATION; WELL-FOUNDED SEMANTICS (WFS);

SEMANTICS;

EID: 27144540438     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11562931_26     Document Type: Conference Paper

References (19)

1. C. Baral, J. Lobo, and J. Minker. Generalized well-founded semantics for logic programs. In 10th International Conference on Automated Deduction, 1990.
2. S. Brass and J. Dix. Semantics of (Disjunctive) Logic Programs Based on Partial Evaluation. Journal of Logic Programming, 38(3):167-213, 1999.
3. J. A. Fernández and J. Minker. Bottom-up computation of perfect models for disjunctive theories. Journal of Logic Programming, 25(1):33-51, 1995.
4. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In 5th Int. Conf. on Logic Programming, pages 1070-1080. MIT Press, 1988.
5. J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, 1992.
6. J. Minker. On indefinite databases and the closed world assumption. In 6th Conference on Automated Deduction, volume 138, pages 292-308. Springer-Verlag, 1982.
7. J. Minker and A. Rajasekar. A fixpoint semantics for disjunctive logic programs. Journal of Logic Programming, 9(1):45-74, 1990.
8. H. Przymusinska and T. Przymusinski. Semantic issues in deductive databases and logic. In R. Banerji, editor, Formal Techniques in Artificial Intelligence - a Sourcebook, pages 321-367. North Holland, 1990.
9. T. Przymusinski. Static semantics for normal and disjunctive logic programs. Annals of Mathematics and Artificial Intelligence, Special Issue on Disjunctive Programs:323-357, 1995.
10. T. C. Przymusinski. On the declarative semantics of stratified deductive databases and logic programs. In J. Minker, editor, Foundation of Deductive Databases and Logic Programming, pages 193-216. Morgan Kaufmann, 1988.
11. T. C. Przymusinski. Stable semantics for disjunctive programs. New Generation Computing Journal, 9:401-424, 1991.
12. R. Reiter. On closed world data bases. In H. Gallaire and J. Minker, editors, Logic and Databases, pages 55-76. Plenum Press, 1978.
13. K. Ross. The well founded semantics for disjunctive logic programs. In First Int. Conf. on Deductive and Object Oriented Databases, pages 352-369, 1989.
14. D. Seipel, J. Minker, and C. Ruiz. Model generation and state generation for disjunctive logic programs. Journal of Logic Programming, 32(1):49-69, 1997.
15. M. Smyth. Power domains. J. Computer and System Sciences, 16(1):23-36, 1978.
16. A. Tarski. Lattice-theoretic fixpoint theorem and its applications. Pacific Journal of Mathematics, pages 285-309, 1955.
17. M. van Emden and R. Kowalski. The semantics of predicate logic as a programming language. Journal of ACM, 4(23):733-742, 1976.
18. A. van Gelder, K. Ross, and J. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620-650, 1991.
19. K. Wang. Argumentation-based abduction in disjunctive logic programming. Journal of Logic Programming, 2001.