Comparisons and computation of well-founded semantics for disjunctive logic programs

ACM Transactions on Computational Logic

Volumn 6, Issue 2, 2005, Pages 295-327

  Wang, Kewen ^a   Zhou, Lizhu ^b  

^a GRIFFITH UNIVERSITY   (Australia)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

Argumentation; Disjunctive logic programming; Negation; Nonmonotonic reasoning; Program transformations; Residual programs; Semantics of logic programs and deductive databases; Well founded semantics

Indexed keywords

ARGUMENTATION; DISJUNCTIVE LOGIC PROGRAMMING; NON-MONOTONIC REASONING; PROGRAM TRANSFOMATIONS; RESIDUAL PROGRAMS; SEMANTICS OF LOGIC PROGRAMS AND DEDUCTIVE DATABASES; WELL FOUNDED SEMANTICS;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL METHODS; DATABASE SYSTEMS; FORMAL LANGUAGES; FORMAL LOGIC; KNOWLEDGE BASED SYSTEMS; MATHEMATICAL TRANSFORMATIONS; SEMANTICS; SET THEORY; THEOREM PROVING;

LOGIC PROGRAMMING;

EID: 16644384469     PISSN: 15293785     EISSN: None     Source Type: Journal    
DOI: 10.1145/1055686.1055690     Document Type: Article

References (24)

1. APT, K. R. AND BOL, R. N. 1994. Logic programming and negation: A survey. J. Logic Prog. 19/20, 9-71.
2. BARAL, C. AND GELPOND, M. 1994. Logic programming and knowledge representation. J. Logic Prog. 19/20, 73-148.
3. BRASS, S. AND DIX, J. 1997. Characterizations of the (disjunctive) stable semantics by partial evaluation. J. Logic Prog. 32, 3, 207-228.
4. BRASS, S. AND DIX, J. 1998. Characterizations of the disjunctive well-founded semantics: Confluent calculi and iterated GCWA. J. Automat. Reas. 20, 1, 143-165.
5. BRASS, S. AND Dix, J. 1999. Semantics of (disjunctive) logic programs based on partial evaluation. J. Logic Prog. 40, 1, 1-46.
6. BRASS, S., DIX, J., NIEMELÄ, I., AND PRZYMUSINSKI, T. 2001. On the equivalence of the static and disjunctive well-founded semantics and its computation. Theoret. Comput. Sci. 258, 1-2, 523-553.
7. BRY, F. 1990. Negation in logic programming: A formalization in constructive logic. In Information Systems and Artificial Intelligence: Integration Aspects, D. Karagiannis, Ed. Lecture Notes in Computer Science, vol. 474. Springer-Verlag, New York, 30-46.
8. DIX, J., CHESNEVAR, C., STOLZENBURG, F., AND SIMARI, G. 2002. Relating defeasible and normal logic programming through transformation properties. Theoret. Comput. Sci. 290, 1, 499-529.
9. DUNG, P. 1995. An argumentation-theoretic foundation for logic programming. J. Logic Prog. 22, 2, 151-177.
10. EITER, T., LEONE, N., AND SACCA, D. 1997. On the partial semantics for disjunctive deductive databases. Ann. Math. Artif. Intel. 19, 1-2, 59-96.
11. GELDER, A. V., ROSS, K. A., AND SCHLIPF, J. 1991. The well-founded semantics for general logic programs. J. ACM 38, 3, 620-650.
12. GELFOND, M. AND LIFSCHITZ, V. 1988. The stable model semantics for logic programming. In Proceedings of the 5th Symposium on Logic Programming (Seattle, Wash.), R. Kowalski and K. Bowen, Eds. MIT Press, Cambridge, Mass., 1070-1080.
13. GELFOND, M. AND LIFSCHITZ, V. 1991. Classical negation in logic programs and deductive databases. New Gen. Comput. 9, 365-385.
14. KAKAS, A., KOWALSKI, R., AND TONI, F. 1998. The role of abduction in logic programming. In Hand-book in Artificial Intelligence and Logic Programming, D. Gabbay, C. Hogger, and J. Robinson, Eds. Vol. 5. Oxford University Press, Oxford, U.K., 235-324.
15. LEONE, N., RULLO, P., AND SCARCELLO, F. 1997. Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation. Inf. Comput. 135, 2, 69-112.
16. LOBO, J., MINKER, J., AND RAJASEKAR, A. 1992. Foundations of Disjunctive Logic Programming. MIT Press, Cambridge Mass.
17. MINKER, J. 1982. On indefinite databases and the closed world assumption. In Proceedings of the 6th Conference on Automated Deduction, D. W. Loveland, Ed. Lecture Notes in Computer Science, vol. 138. Springer-Verlag, New York, 292-308.
18. MINKER, J. 1994. Overview of disjunctive logic programming. Ann. Math. Artif. Intel. 12, 1-24.
19. PRZYMUSINSKI, T. 1995. Static semantics of logic programs. Ann. Math. Artif. Intel. 14, 323-357.
20. Ross, K. 1992. A procedural semantics for well-founded negation in logic programs. J. Logic Prog. 13, 1, 1-22.
21. SACCÁ, D. AND ZANIOLO, C. 1990. Stable models and non-determinism in logic programs. In Proceedings of the 9th ACM Symposium on Principles of Database System (Nashville, Tenn.). ACM, New York, 205-217.
22. WANG, K. 2000. Argumentation-based abduction in disjunctive logic programming. J. Logic Prog. 45, 1-3, 105-141.
23. WANG, K. 2001. A top-down procedure for disjunctive well-founded semantics. In Proceedings of the 1st International Joint Conference on Automated Reasoning (IJCAR'01) (Sienna, Italy). R. Gore, A. Leitsch, and T. Nipkow, Eds. Springer-Verlag, New York, 305-317.
24. You, J., YUAN, L., AND GOEBEL, R. 2000. An abductive approach to disjunctive logic programming. J. Logic Prog. 44, 1-3, 101-127.