Author of the publication

SLDNFA: An Abductive Procedure for Abductive Logic Programs.

, and . J. Log. Program., 34 (2): 111-167 (1998)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Representing Incomplete Knowledge in Abductive Logic Programming., and . J. Log. Comput., 5 (5): 553-577 (1995)The Abductive Event Calculus as a General Framework for Temporal Databases., , and . ICTL, volume 827 of Lecture Notes in Computer Science, page 301-316. Springer, (1994)A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic Programs., , and . ISLP, page 117-131. MIT Press, (1991)Non-tranformational termination analysis of logic programs, based on general term-orderings., and . LOPSTR, volume UMCS-00-6-1 of Technical Report, Department of Computer Science, University of Manchester, (2000)Semantic interpretation of temporal information by abductive inference, , , , and . CoRR, (2000)Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings., and . LOPSTR (LNCS 2042: Selected Papers), volume 2042 of Lecture Notes in Computer Science, page 69-85. Springer, (2000)Termination Analysis of CHR Revisited., and . ICLP, volume 5366 of Lecture Notes in Computer Science, page 501-515. Springer, (2008)Termination Analysis for Tabled Logic Programming., , , , and . LOPSTR, volume 1463 of Lecture Notes in Computer Science, page 111-127. Springer, (1997)On the Duality of Abduction and Model Generation in a Framework for Model Generation with Equality., and . Theor. Comput. Sci., 122 (1&2): 225-262 (1994)Compiling Bottom-up and Mixed Derivations into Top-down Executable Logic Programs., , , and . J. Autom. Reason., 7 (3): 337-358 (1991)