Paper Info
Title
Hornlog: a graph-based interpreter for general horn clauses
Abstract
This paper presents hornlog , a general Horn-clause proof procedure that can be used to interpret logic programs. The system is based on a form of graph rewriting, and on the linear-time algorithm for testing the unsatisfiability of propositional Horn formulae given by Dowling and Gallier [8]. hornlog applies to a class of logic programs which is a proper superset of the class of logic programs handled by PROLOG systems. In particular, negative Horn clauses used as assertions and queries consisting of disjunctions of negations of Horn clauses are allowed. This class of logic programs admits answers which are indefinite, in the sense that an answer can consist of a disjunction of substitutions. The method does not use the negation-by- failure semantics [6] in handling these extensions and appears to have an immediate parallel interpretation.
Year
DOI
Venue
1987
10.1016/0743-1066(87)90015-X
J. Log. Program.
Keywords
Field
DocType
graph-based interpreter,general horn clause
Discrete mathematics,Subset and superset,Horn clause,Programming language,Negation,Horn-satisfiability,Algorithm,Failure semantics,Prolog,Graph rewriting,Proof procedure,Mathematics
Journal
Volume
Issue
ISSN
4
2
The Journal of Logic Programming
Citations 
PageRank 
References 
10
8.47
7
Authors
2
Name
Order
Citations
PageRank
Jean H. Gallier1749111.86
Stan Raatz217637.68