Negation as Failure through Abduction: Reasoning about Termination

Authors:
Paolo Mancarella;Dino Pedreschi;Salvatore Ruggieri
Affiliations:
-;-;-
Venue:
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Year:
2002

Citing 7
Cited 0

Termination of rewriting

Journal of Symbolic Computation
Reasoning about termination of pure Prolog programs

Information and Computation
From logic programming to Prolog

From logic programming to Prolog
Constraint-based termination analysis of logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Termination analysis for abductive general logic programs

Proceedings of the 1999 international conference on Logic programming
Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs

SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Classes of terminating logic programs

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study termination properties of normal logic programs where negation as failure is interpreted as a form of abduction, as originally proposed by Eshghi and Kowalski in [EK89]. The abductive proof procedure associated with this interpretation exhibits a better behavior than SLDNF as far as termination is concerned. We first present a strong termination characterization for the Eshghi and Kowalski proof procedure for Datalog programs which is sound and complete. We then extend the characterization to the class of non-Datalog programs, and prove its soundness. Finally we present two instantiations of the general characterization and study the relationships between the classes of programs introduced in the paper.