Abduction in well-founded semantics and generalized stable models via tabled dual programs

Theory and Practice of Logic Programming

Volumn 4, Issue 4, 2004, Pages 383-428

  Alferes, José Júlio ^a   Pereira, Luís Moniz ^a   Swift, Terrance ^b  

^a UNIVERSIDADE NOVA DE LISBOA   (Portugal)

^b Stony Brook University   (United States)

Author keywords

Abduction; Generalized stable models; Tabled resolution; Well founded semantics

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING; QUERY LANGUAGES; SEMANTICS; THEOREM PROVING;

ABDUCTION; GENERALIZED STABLE MODELS; TABLED RESOLUTION; WELL-FOUNDED SEMANTICS;

LOGIC PROGRAMMING;

EID: 3142681030     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068403001960     Document Type: Article

References (34)

1. ALFERES, J., LEITE, J., PEREIRA, L. M., PRZYMUSINSKA, H. AND PRZYMUSINSKI, T. 2000. Dynamic updates of non-monotonic knowledge bases. Journal of Logic Programming 45, 1-3, 43-70.
2. ALFERES, J., PEREIRA, L. M. AND SWIFT, T. 1999. Well-founded abduction via tabled dual programs. In International Conference on Logic Programming. MIT Press, 426-440.
3. ALFERES, J. J., LEITE, J. A., PEREIRA, L. M. AND QUARESMA, P. 2000. Planning as abductive updating. In Procs. of AISB 2000 Symposium on AI planning and Intelligent Agents, D. Kitchin, Ed. AISB, 1-8.
4. APA. 1994. Diagnostic and Statistical Manual of Mental Disorders, 4th ed. American Psychiatric Association, Washington,DC. Prepared by the Task Force on DSM-IV and other committees and work groups of the American Psychiatric Association.
5. CASTRO, J. AND PEREIRA, L. 2002. Abductive validation of a power-grid diagnoser. English version of Master's thesis Verificação Abdutiva de um Sistema de Diagnóstico Baseado em Regras. Available at http://www.cs.sunysb.edu/~tswift.
6. CHEN, W. AND WARREN, D. S. 1996. Tabled Evaluation with Delaying for General Logic Programs. Journal of the ACM 43, 1 (January), 20-74.
7. CONSOLE, L., DUPRÉ, D. AND TORASSO, P. 1991. On the relationship between abduction and deduction. Journal of Logic and Computation 1, 5, 661-690.
8. DAMÁSIO, C. AND PEREIRA, L. M. 1995. Abduction over 3-valued extended logic programs. In International Conference on Logic Programming and Non-Monotonic Reasoning. LNAI, vol. 1265. Springer-Verlag, 29-42.
9. DAMÁSIO, C. V. AND PEREIRA, L. M. 1998. A survey on paraconsistent semantics for extended logic programas. In Handbook of Defeasible Reasoning and Uncertainty Management Systems, D. Gabbay and P. Smets, Eds. Vol. 2. Kluwer Academic Publishers, 241-320.
10. DENECKER, M. AND SCHREYE, D. D. 1998. SLDNFA: An abductive procedure for normal abductive programs. Journal of Logic Programming 34, 2, 111-167.
11. Dix, J. AND SWIFT, T. 2002. Linear subclasses of the well-founded semantics. In preparation.
12. DOWNEY, R. G. AND FELLOWS, M. 1995. Fixed parameter tractability and completeness I: Basic results. SIAM J. Computing 24, 873-921.
13. EITER, T., GOTTLOB, G. AND LEONE, N. 1997. Abduction From Logic Programs: Semantics and Complexity. Theoretical Computer Science 189, 1-2 (December), 129-177.
14. EITER, T., LEONE, N., MATEIS, C., PFEIFER, G. AND SCARCELLO, F. 1997. A deductive system for nonmonotonic reasoning. In Logic Programming and Nonmonotonic Reasoning, J. Dix, U. Furbach, and A. Nerode, Eds. LNAI, vol. 1265. Springer-Verlag, 363-374.
15. FUNG, T. AND KOWALSKI, R. 1997. The IFF proof procedure for abductive logic programming. Journal of Logic Programming 33, 2, 151-165.
16. GARTNER, J., SWIFT, T., TIEN, A., PEREIRA, L. M. AND DAMÁSIO, C. 2000. Psychiatric diagnosis from the viewpoint of computational logic. In International Conference on Computational Logic, L. et. al, Ed. LNAI, vol. 1861. Springer-Verlag, 1362-1376.
17. GELFOND, M. AND LIFSHITZ, V. 1990. Logic programs with classical negation. In International Conference on Logic Programming. MIT Press, 579-597.
18. GOTTLOB, G., SCARCELLO, F. AND SIDERI, M. 1999. Fixed parameter complexity in AI and nonmonotinic reasoning. In International Conference on Logic Programming and Non-Monotonic Reasoning. LNAI, vol. 1730. Springer-Verlag, 1-18.
19. INOUE, K. AND SAKAMA, C. 1999. Computing extended abduction through transaction programs. Annals of Mathematics and Artificial Intelligence 25, 3-4, 339-367.
20. KAKAS, A., KOWALSKI, R. AND TONI, F. 1993. Abductive logic programming. Journal of Logic and Computation 2, 6, 719-770.
21. KAKAS, A. AND MANCARELLA, P. 1990. Generalized stable models: A semantics for abduction. In European Conference on Artificial Intelligence. Morgan-Kaufmann, 385-391.
22. KAKAS, A. C. AND MOURLAS, C. 1997. ACLP: Flexible solutions to complex problems. In International Conference on Logic Programming and Non-Monotonic Reasoning. LNAI, vol. 1265. Springer-Verlag, 387-399.
23. LIFSHITZ, V. AND TURNER, H. 1995. From disjunctive programs to abduction. In Nonmonotonic Extensions of Logic Programming, J. Dix, L. M. Pereira and T. Przymusinski, Eds. LNAI, vol. 927. Springer-Verlag, 23-42.
24. LLOYD, J. W. 1984. Foundations of Logic Programming. Springer-Verlag, Berlin Germany.
25. NIEMELÄ, I. AND SIMONS, P. 1997. Smodels: An implementation of the stable and well-founded semantics for normal LP. In Logic Programming and Nonmonotonic Reasoning, J. Dix, U. Furbach, and A. Nerode, Eds. LNAI, vol. 1265. Springer-Verlag, 420-429. www.tcs.hut.fi/Software/smodels.
26. PEREIRA, L. M., APARÍCIO, J. AND ALFERES, J. 1991. Derivation procedures for extended stable models. In International Joint Conference on Artificial Intelligence. AAAI Press.
27. PRZYMUSINSKI, T. 1989. Every logic program has a natural stratification and an iterated least fixed point model. In ACM Principles of Database Systems. ACM Press, 11-21.
28. SAKAMA, C. AND INOUE, K. 2000. Abducitve logic programming and disjunctive logic programming: Their relationship and transferability. Journal of Logic Programming 44, 1-3, 71-96.
29. SATOH, K. AND IWAYAMA, N. 1991. Computing abduction by using the TMS. In International Conference on Logic Programming. MIT Press, 505-518.
30. SATOH, K. AND IWAYAMA, N. 2000. Computing abduction by using TMS and top-down expectation. Journal of Logic Programming 44, 1-3, 179-206.
31. SWIFT, T. 1999. A new formulation of tabled resolution with delay. In Recent Advances in Artifiial Intelligence. LNAI, vol. 1695. Springer-Verlag, 163-177. Available at http://www.cs.sunysb.edu/~tswift.
32. VAN GELDER, A., ROSS, K. AND SCHLIPF, J. 1991. Unfounded sets and well-founded semantics for general logic programs. Journal of the ACM 38, 3, 620-650.
33. VAN NUFFELEN, B. AND DENECKER, M. 2000. Problem solving in ID-logic with agregates: some experiments. In 8th Int. Workshop on Non-Monotonic Reasoning (NMR'2000). 9-11. Available via www.cs.kuleuven.ac.be.
34. XSB. 2003. The XSB Logic Programming System version 2.6. http://xsb.sourceforge.net.