Negation as failure through abduction: Reasoning about termination

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2407, Issue , 2002, Pages 240-272

  Mancarella, Paolo ^a   Pedreschi, Dino ^a   Ruggieri, Salvatore ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DATALOG PROGRAMS; LOGIC PROGRAMS; NEGATION AS FAILURES; PROOF PROCEDURES; SOUND AND COMPLETE; TERMINATION PROPERTY;

LOGIC PROGRAMMING;

EID: 84867632485     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45628-7_11     Document Type: Article

References (17)

1. K. R. Apt and M. Bezem. Acyclic programs. New Generation Computing, 29(3):335-363, 1991.
2. K. R. Apt and D. Pedreschi. Reasoning about termination of pure Prolog programs. Information and Computation, 106(1):109-157, 1993.
3. K. R. Apt. From Logic Programming to Prolog. CAR Hoare Series Editor. Prentice Hall, 1996.
4. M. Bezem. Characterizing termination of logic programs with level mappings. In E. L. Lusk and R. A. Overbeek, editors, Proceedings of the North American Conference on Logic Programming, pages 69-80. The MIT Press, 1989.
5. K. L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Databases, pages 293-322. Plenum Press, New York, 1978.
6. D. De Schreye and S. Decorte. Termination of logic programs: the neverending story. Journal of Logic Programming, 19-20:199-260, 1994.
7. S. Decorte, D. De Schreye, and H. Vandecasteele. Constraint-based termination analysis of logic programs. ACM Trans. on Programming Languages and Systems, 21(6):1137-1195, 1999.
8. N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 8:69-116, 1987.
9. M. Denecker and D. De Schreye. SLDNFA: An abductive procedure for abductive logic programs. Journal of Logic Programming, 34(2):111-167, 1998.
10. P. M. Dung. An argumentation-theoretic foundation for logic programming. Journal of Logic Programming, 22(2):151-177, 1995.
11. K. Eshgi and R.A. Kowalski. Abduction compared with negation by failure. In G. Levi and M. Martelli, editors, Proceedings of the 1989 International Conference on Logic Programming, pages 234-254. MIT Press, 1989.
12. A.C. Kakas, R.A. Kowalski, and F. Toni. Abductive logic programming. Journal of Logic and Computation, 2(6):719-770, 1993.
13. N. Lindenstrauss and Y. Sagiv. Automatic termination analysis of logic programs. In L. Naish, editor, Proc. of the International Conference on Logic Programming, pages 63-77. The MIT Press, 1997.
14. F. Mesnard and U. Neumerkel. Applying static analysis techniques for inferring termination conditions of logic programs. In P. Cousot, editor, Static Analysis Symposium, volume 2126 of LNCS, pages 93-110. Springer-Verlag, 2001.
15. D. Pedreschi, S. Ruggieri, and J.-G. Smaus. Classes of terminating logic programs. Theory and Practice of Logic Programming, 2002. To appear.
16. R. Reiter. A logic for default reasoning. Artificial Intelligence, 13:81-132, 1980.
17. S. Verbaeten. Termination analysis for abductive general logic programs. In D. De Schreye, editor, Proc. of the International Conference on Logic Programming, pages 365-379. The MIT Press, 1999.