Skip Navigation

The Computer Journal 1991 34(1):42-51; doi:10.1093/comjnl/34.1.42
© 1991 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Padawitz, P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Reduction and Narrowing for Horn Clause Theories

P. Padawitz *

Universitat Passau, Postfach 2540, D-8390 Passau, West Germany

We give an overview of rewrite rule based calculi for reasoning about Horn clause specifications. Such reasoning consists in computing (normal forms), proving (theorems) or solving (goals). Computations are performed by term reduction, proofs are carried out by goal reduction, solutions are obtained by narrowing. The presentation follows our book ‘Computing in Horn Clause Theories’ where we took the viewpoint that most results in this area centre around the soundness or completeness of an inference system. Besides the general calculi of reduction and narrowing we discuss specialisations, which embody particular strategies. For applications to data type specification and program verification, we present the foundations of inductive proof methods based on reduction and narrowing.

Received August 1990.

* Universitat Passau, Postfach 2540, D-8390 Passau, West Germany


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.