Abductive logic programming and disjunctive logic programming: their relationship and transferability

Journal of Logic Programming

Volumn 44, Issue 1-3, 2000, Pages 75-100

  Sakama, Chiaki ^a   Inoue, Katsumi ^b  

^a WAKAYAMA UNIVERSITY   (Japan)

^b KOBE UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAM LISTINGS; MATHEMATICAL MODELS; PROGRAM DIAGNOSTICS; PROGRAMMING THEORY; SET THEORY;

ABDUCTIVE LOGIC PROGRAMMING; BELIEF SET SEMANTICS; DISJUNCTIVE LOGIC PROGRAMMING; PROGRAM TRANSFORMATION;

LOGIC PROGRAMMING;

EID: 0034230816     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(99)00073-4     Document Type: Article

References (43)

1. C. Aravindan, An abductive framework for negation in disjunctive logic programming, in: Proceedings of the European Workshop on Logics in AI, Lecture Notes in Artificial Intelligence, vol. 1126, Springer, Berlin, 1996, pp. 252-267.
2. R. Ben-Eliyahu, R. Dechter, Prepositional semantics for disjunctive logic programs, Annals of Mathematics and Artificial Intelligence 12 (1&2) (1994) 53-87.
3. G. Brewka, J. Dix, Knowledge representation with logic programs, in: D.M. Gabbay (Ed.), Handbook of Philosophical Logic, second edition, vol. 6, Oxford University Press, Oxford, 1999 (Chapter 6).
4. E.P.F. Chan, A possible world semantics for disjunctive databases, IEEE Transactions on Data and Knowledge Engineering 5 (2) (1993) 282-292.
5. P.T. Cox, T. Pietrzykowski, Causes for events: their computation and applications, in: Proceedings of the Eighth International Conference Automated Deduction, Lecture Notes in Computer Science, vol. 230, Springer, Berlin, 1986, pp. 608-621.
6. J. Dix, L. Pereira, T. Przymusinski, Prolegomena to logic programming for nonmonotonic reasoning, in: Nonmonotonic Extensions of Logic Programming, Lecture Notes in Artificial Intelligence, vol. 1216, Springer, Berlin, 1997, pp. 1-36.
7. P.M. Dung, Acyclic disjunctive logic programs with abductive procedure as proof procedure, in: Proceedings of the International Conference on Fifth Generation Computer Systems, Ohm-sha, Tokyo, 1992, pp. 555-561.
8. T. Eiter, G. Gottlob, The complexity of logic-based abduction, Journal of ACM 42 (1) (1995) 3-42.
9. T. Eiter, G. Gottlob, On the computational cost of disjunctive logic programming: prepositional case, Annals of Mathematics and Artificial Intelligence 15 (3&4) (1995) 289-323.
10. T. Eiter, G. Gottlob, N. Leone, Abduction from logic programs: semantics and complexity, Theoretical Computer Science 189 (1&2) (1997) 129-177.
11. T. Eiter, G. Gottlob, H. Mannila, Disjunctive datalog, ACM Transactions on Database Systems 22 (3) (1997) 364-413.
12. K. Eshghi, R. A. Kowalski, Abduction compared with negation by failure, in: Proceedings of the Sixth International Conference on Logic Programming, MIT Press, Cambridge, MA, 1989, pp. 234-254.
13. J.A. Fernandez, J. Lobo, J. Minker, V.S. Subrahmanian, Disjunctive LP+integrity constraints = stable model semantics, Annals of Mathematics and Artificial Intelligence 8 (3&4) (1993) 449-474.
14. M. Gelfond, V. Lifschitz, The stable model semantics for logic programming, in: Proceedings of the Fifth International Conference and Symposium on Logic Programming, MIT Press, Cambridge, MA, 1988, pp. 1070-1080.
15. M. Gelfond, V. Lifschitz, Classical negation in logic programs and disjunctive databases, New Generation Computing 9 (3&4) (1991) 365-385.
16. M. Gelfond, Epistemic approach to formalization of commonsense reasoning, Technical Report TR-91-2, University of Texas at El Paso, 1991.
17. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979.
18. K. Inoue, M. Koshimura, R. Hasegawa, Embedding negation as failure into a model generation theorem prover, in: Proceedings of the 11th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence, vol. 607, Springer, Berlin, 1992, pp. 400-415.
19. K. Inoue, Hypothetical reasoning in logic programs, Journal of Logic Programming 18 (3) (1994) 191-227.
20. K. Inoue, C. Sakama, On positive occurrences of negation as failure, in: Proceedings of the Fourth International Conference on Principles of Knowledge Representation and Reasoning, Morgan Kaufmann, Los Altos, CA, 1994, pp. 293-304 (extended version: Negation as failure in the head, Journal of Logic Programming 35 (1) (1998) 39-78).
21. K. Inoue, C. Sakama, On positive occurrences of negation as failure, in: Proceedings of the Fourth International Conference on Principles of Knowledge Representation and Reasoning, Morgan Kaufmann, Los Altos, CA, 1994, pp. 293-304 (extended version: Negation as failure in the head, Journal of Logic Programming 35 (1) (1998) 39-78).
22. K. Inoue, C. Sakama, Transforming abductive logic programs to disjunctive programs, in: Proceedings of the 10th International Conference on Logic Programming, MIT Press, Cambridge, MA, 1993, pp. 335-353 (extended version: A fixpoint characterization of abductive logic programs, Journal of Logic Programming 27 (2) (1996) 107-136).
23. K. Inoue, C. Sakama, Transforming abductive logic programs to disjunctive programs, in: Proceedings of the 10th International Conference on Logic Programming, MIT Press, Cambridge, MA, 1993, pp. 335-353 (extended version: A fixpoint characterization of abductive logic programs, Journal of Logic Programming 27 (2) (1996) 107-136).
24. A.C. Kakas, P. Mancarella, Generalized stable models: a semantics for abduction, in: Proceedings of the Ninth European Conference on Artificial Intelligence, Pitman, 1990, pp. 385-391.
25. A.C. Kakas, R.A. Kowalski, F. Toni, Abductive logic programming, Journal of Logic and Computation 2 (6) (1992) 719-770.
26. A.C. Kakas, R.A. Kowalski, F. Toni, The role of abduction in logic programming, in: D.M. Gabbay, C.J. Hogger, J.A. Robinson (Eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 5, Oxford University Press, Oxford, 1998, pp. 235-324.
27. K. Konolige, Abductive theories in artificial intelligence, in: G. Brewka (Ed.), Principles of Knowledge Representation CSLI Publications, California, 1994, pp. 129-152.
28. V. Lifschitz, H. Turner, From disjunctive programs to abduction, in: Non-Monotonie Extensions of Logic Programming, Lecture Notes in Artificial Intelligence, vol. 927, Springer, Berlin, 1995, pp. 23-42.
29. J. Lobo, J. Minker, A. Rajasekar, Foundations of disjunctive logic programming, MIT Press, Cambridge, MA, 1992.
30. W. Marek, M. Truszczynski, Autoepistemic logic, Journal of ACM 38 (3) (1991) 588-619.
31. J. Minker, On indefinite data bases and the closed world assumption, in: Proceedings of the Sixth International Conference on Automated Deduction, Lecture Notes in Computer Science, vol. 138, Springer, Berlin, 1982, pp. 292-308.
32. J. Minker, Overview of disjunctive logic programming, Annals of Mathematics and Artificial Intelligence 12 (1&2) (1994) 1-24.
33. D. Poole, A logical framework for default reasoning, Artificial Intelligence 36 (1) (1988) 27-47.
34. D. Poole, Explanation and prediction: an architecture for default and abductive reasoning, Computational Intelligence 5 (2) (1989) 97-110.
35. H.E. Pople, Jr, On the mechanization of abductive logic, in: Proceedings of the Third International Joint Conference on Artificial Intelligence, Morgan Kaufmann, Los Altos, CA, 1973, pp. 147-152.
36. T.C. Przymusinski, Stable semantics for disjunctive programs, New Generation Computing 9 (3&4) (1991) 401-424.
37. C. Sakama, Possible model semantics for disjunctive databases, in: Proceedings of the First International Conference on Deductive and Object-Oriented Databases, North-Holland, New York, 1989, pp. 369-383.
38. C. Sakama, K. Inoue, On the equivalence between disjunctive and abductive logic programs, in: Proceedings of the 11 th International Conference on Logic Programming, MIT Press, Cambridge, MA, 1994, pp. 489-503.
39. C. Sakama, K. Inoue, An alternative approach to the semantics of disjunctive logic programs and deductive databases, Journal of Automated Reasoning 13 (1) (1994) 145-172.
40. K. Satoh, K. Iwayama, Computing abduction by using the TMS, in: Proceedings of the Eighth International Conference on Logic Programming, MIT Press, Cambridge, MA, 1991, pp. 505-518.
41. B. Selman, H.J. Levesque, Support set selection for abductive and default reasoning, Artificial Intelligence 82 (1&2) (1996) 259-272.
42. T. Soininen, I. Niemelä, Developing a declarative rule language for applications in product configuration, in: Proceedings of the First International Workshop on Practical Aspects of Declarative Language, Lecture Notes in Computer Science, vol. 1551, Springer, Berlin, 1999, pp. 305-319.
43. J.-H. You, L.-Y. Yuan, R. Goebel, Regular extension semantics and disjunctive Eshghi-Kowalski procedure, in: Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming, MIT Press, Cambridge, MA, 1998, pp. 175-189.