Towards a Characterization of Termination of Logic Programs

[1]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[2]  Jürgen Avenhaus,et al.  On Logic Programs with Data-Driven Computations , 1985, European Conference on Computer Algebra.

[3]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[4]  Kenneth Kunen,et al.  Signed Data Dependencies in Logic Programs , 1989, J. Log. Program..

[5]  John C. Shepherdson,et al.  Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World Assumption , 1984, J. Log. Program..

[6]  Jeffrey D. Ullman,et al.  Efficient tests for top-down termination of logical rules , 1988, JACM.

[7]  John W. Lloyd,et al.  A Completeness Theorem for SLDNF Resolution , 1989, J. Log. Program..

[8]  Amir Pnueli,et al.  Proving Termination of Prolog Programs , 1985, Logic of Programs.

[9]  Hassan Aït-Kaci,et al.  LOGIN: A Logic Programming Language with Built-In Inheritance , 1986, J. Log. Program..

[10]  Krzysztof R. Apt,et al.  On the Safe Termination of PROLOG Programs , 1989, ICLP.

[11]  Jack Minker.  Foundations of deductive databases and logic programming , 1988 .

[12]  Nachum Dershowitz,et al.  Termination of Rewriting , 1987, J. Symb. Comput..

[13]  John C. Shepherdson,et al.  Negation as Failure II , 1985, J. Log. Program..

[14]  John Potter,et al.  Characterisation of Terminating Logic Programs , 1986, SLP.

[15]  Roberto Barbuti,et al.  A Tool to Check the Non-Floundering Logic Programs and Goals , 1988, PLILP.