An abductive framework for negation in disjunctive logic programming

1. P. Baumgartner and U. Furbach. Model Elimination without Contrapositives and its Application to PTTP. Journal of Automated Reasoning, 13:339–359, 1994. Short version in: Proceedings of CADE-12, Springer LNAI 814, 1994, pp 87–101.

   Article  Google Scholar 

2. P. Baumgartner, U. Furbach, and F. Stolzenburg. Model Elimination, Logic Programming and Computing Answers. In 14th International Joint Conference on Artificial Intelligence (IJCAI 95), volume 1, 1995. (Long version in: Research Report 1/95, University of Koblenz, Germany. To appear in Artificial Intelligence).

   Google Scholar 

3. Marc Denecker and Danny De Schreye. Sldnfa: an abductive procedure for normal abductive programs. Technical report, Department of Computer Science, K. U. Leuven, Belgium, 1995.

   Google Scholar 

4. Phan Minn Dung. Negation as hypotheses: an abductive foundation for logic programming. In K. Furukawa, editor, Proceedings of International Conference on Logic Programming, pages 3–17. The MIT Press, 1991.

   Google Scholar 

5. Phan Minh Dung. Acyclic disjunctive logic programs with abductive procedure as proof procedure. In Proceedings of the International conference on Fifth Generation Computer Systems, pages 555–561. ICOT, 1992.

   Google Scholar 

6. Phan Minh Dung. An abductive procedure for disjunctive logic programming. Technical report, Computer Science Program, Asian Institute of Technology, Bangkok, Thailand, 1995.

   Google Scholar 

7. Thomas Eiter and Georg Gottlob. On the computational cost of disjunctive logic programming: Propositional case. Annals of Mathematics and Artificial Intelligence, 15:289–323, 1995.

   Article  Google Scholar 

8. K. Eshghi and R. A. Kowalski. Abduction compared with negation by failure. In G. Levi and M. Martelli, editors, Proceedings of International Conference on Logic Programming, pages 234–254. The MIT Press, 1989.

   Google Scholar 

9. Melvin Fitting. First-order logic and automated theorem proving. Springer-Verlag, 1990.

   Google Scholar 

10. Matthew L. Ginsberg. A circumscriptive theorem prover. Artificial Intelligence, 39:209–230, 1989.

    Article  Google Scholar 

11. Michael Gelfond, Halina Przymusinska, and Teodor Przymusinski. On the relationship between circumscription and negation as failure. Artificial Intelligence, 38:75–94, 1989.

    Article  Google Scholar 

12. Katsumi Inoue and Nicolas Helft. On theorem provers for circumscription. In P.F. Schneider, editor, Proceedings of the eighth biennial conference of the Canadian society for computational studies of intelligence, pages 212–219. Morgan-Kaufmann Publishers, 1990. Revised version.

    Google Scholar 

13. Katsumi Inoue. Linear resolution for consequence finding. Artificial Intelligence, 56:301–353, 1992.

    Article  Google Scholar 

14. A. C. Kakas, R. A. Kowalski, and F. Toni. Abductive logic programming. Journal of logic and computation, 2(6):719–770, 1993.

    Google Scholar 

15. A. C. Kakas, R. A. Kowalski, and F. Toni. The role of abduction in logic programming. Technical report, Department of Computing, Imperial College, London, U.K., 1995.

    Google Scholar 

16. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, second extended edition, 1987.

    Google Scholar 

17. Jorge Lobo, Jack Minker, and Arcot Rajasekar. Foundations of disjunctive logic programming. MIT Press, 1992.

    Google Scholar 

18. Jack Minker. On indefinite databases and the closed world assumption. In Lecture notes in computer science 138, pages 292–308. Springer-Verlag, 1982.

    Google Scholar 

19. Ilkka Niemelä. A tableau calculus for minimal model reasoning. In P. Miglioli, U. Moscato, D. Mundici, and M. Ornaghi, editors, Proceedings of the fifth workshop on theorem proving with analytic tableaux and related methods, pages 278–294. LNAI 1071, Springer-Verlag, 1996.

    Google Scholar 

20. Teodor C. Przymusinski. An algorithm to compute circumscription. Artificial Intelligence, 38:49–73, 1989.

    Article  Google Scholar 

21. Arcot Rajasekar, Jorge Lobo, and Jack Minker. Weak generalized closed world assumption. Journal of Automated Reasoning, 5:293–307, 1989.

    Article  Google Scholar 

22. K. A. Ross and R. W. Topor. Inferring negative information from disjunctive databases. Journal of Automated Reasoning, 4(2):397–424, 1988.

    Article  Google Scholar 

23. Chiaki Sakama and Katsumi Inoue. On the equivalence between disjunctive and abductive logic programs. In Pascal Van Hentenryck, editor, Proceedings of International Conference on Logic Programming, pages 489–503. The MIT Press, 1994.

    Google Scholar 

24. A. Yahya and L. J. Henschen. Deduction in non-horn databases. Journal of Automated Reasoning, 1(2):141–160, 1985.

    Article  Google Scholar 

Download references