Author of the publication

A Class of Prolog Programs with Non-linear Outputs Inferable from Positive Data.

. ALT, volume 3734 of Lecture Notes in Computer Science, page 312-326. Springer, (2005)

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

Input-Termination of Logic Programs.. LOPSTR, volume 3573 of Lecture Notes in Computer Science, page 215-230. Springer, (2004)Learning Hereditary and Reductive Prolog Programs from Entailment., and . ICIC (2), volume 5755 of Lecture Notes in Computer Science, page 546-555. Springer, (2009)Completeness Results for Basic Narrowing in Non-Copying Implementations.. JICSLP, page 393-407. MIT Press, (1996)Proving Termination of GHC Programs., , and . ICLP, page 720-736. MIT Press, (1993)A Transformational Methodology for Proving Termination of Logic Programs., , and . CSL, volume 626 of Lecture Notes in Computer Science, page 213-226. Springer, (1991)Learnability of Term Rewrite Systems from Positive Examples.. CATS, volume 51 of CRPIT, page 133-137. Australian Computer Society, (2006)Rewriting Concepts in the Study of Termination of Logic Programs., , and . ALPUK, page 3-20. Springer, (1992)Completeness of Hierarchical Combinations of term Rewriting Systems.. FSTTCS, volume 761 of Lecture Notes in Computer Science, page 125-138. Springer, (1993)Polynomial-Time Learnability from Entailment.. ICLP, volume 2916 of Lecture Notes in Computer Science, page 489-491. Springer, (2003)Unification-Free Execution of Well-Moded and Well-Typed Prolog Programs, and . SAS, volume 983 of Lecture Notes in Computer Science, page 243-260. Springer, (1995)