Since the advent of Horn-clause logic programming in the mid 1970's, there have been numerous attempts to extend the expressive power of Horn-clause logic while preserving some of its attractive computational properties. This article, the first of a pair, presents a clausal language that extends Horn-clause logic by adding negations and embedded implications to the righthand side of a rule, and interpreting these new rules intuitionistically, in a set of partial models. The resulting system is shown to have a fixed-point semantics that generalizes the van Emden-Kowalski semantics for Horn clauses. © 1988.
Mendeley saves you time finding and organizing research
Choose a citation style from the tabs below