Author of the publication

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

A Transformational Methodology for Proving Termination of Logic Programs., , and . CSL, volume 626 of Lecture Notes in Computer Science, page 213-226. Springer, (1991)Modular Proofs for Completeness of Hierarchical Term Rewriting Systems.. Theor. Comput. Sci., 151 (2): 487-512 (1995)Proving Termination of GHC Programs., , and . ICLP, page 720-736. MIT Press, (1993)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)A Framework for Incremental Learning of Logic Programs.. Theor. Comput. Sci., 185 (1): 193-213 (1997)Infusing Critical Thinking Skill Classification into a Software Engineering Course., , and . FECS, page 285-289. CSREA Press, (2007)Infusing Parts-whole Relationship Critical Thinking Skill into Basic Computer Science Education., and . FECS, page 287-292. CSREA Press, (2006)Learnability of Simply-Moded Logic Programs from Entailment.. ASIAN, volume 3321 of Lecture Notes in Computer Science, page 128-141. Springer, (2004)