AbstractSince 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
AbstractHorn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionis...
AbstractIn the Prolog language, Horn clauses of first-order logic are regarded as programs, and the ...
In recent years some papers have addressed the problem of the validity in Intuitionistic Proposition...
AbstractClausal intuitionistic logic is an extension of Horn-clause logic which permits the appearan...
D Clausal intuitionistic logic is an extension of Horn-clause logic which permits the appearance of ...
Intuitionistic logic programming is an extension of Horn-clause logic programming in which implicati...
AbstractVan Emden and Kowalski proposed a fixpoint semantics based on model-theory and an operationa...
The main purpose of the paper is to relate different models for Horn clause logic: operational, deno...
This paper considers, in a general setting, an axiomatic basis for Horn clause logic program-ming. I...
AbstractThe main purpose of the paper is to relate different models for Horn clause logic: operation...
AbstractWe give a model-theoretic semantics for the logic of higher-order Horn clauses, the basis of...
AbstractThe paper deals with the problem of extending positive Horn clause logic by introducing impl...
AbstractThis paper presents hornlog, a general Horn-clause proof procedure that can be used to inter...
AbstractA logic program consists of a set of Horn clauses, and can be used to express a query on rel...
AbstractThis paper makes two contributions. First, we give a semantics for sets of clauses of the sy...
AbstractHorn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionis...
AbstractIn the Prolog language, Horn clauses of first-order logic are regarded as programs, and the ...
In recent years some papers have addressed the problem of the validity in Intuitionistic Proposition...
AbstractClausal intuitionistic logic is an extension of Horn-clause logic which permits the appearan...
D Clausal intuitionistic logic is an extension of Horn-clause logic which permits the appearance of ...
Intuitionistic logic programming is an extension of Horn-clause logic programming in which implicati...
AbstractVan Emden and Kowalski proposed a fixpoint semantics based on model-theory and an operationa...
The main purpose of the paper is to relate different models for Horn clause logic: operational, deno...
This paper considers, in a general setting, an axiomatic basis for Horn clause logic program-ming. I...
AbstractThe main purpose of the paper is to relate different models for Horn clause logic: operation...
AbstractWe give a model-theoretic semantics for the logic of higher-order Horn clauses, the basis of...
AbstractThe paper deals with the problem of extending positive Horn clause logic by introducing impl...
AbstractThis paper presents hornlog, a general Horn-clause proof procedure that can be used to inter...
AbstractA logic program consists of a set of Horn clauses, and can be used to express a query on rel...
AbstractThis paper makes two contributions. First, we give a semantics for sets of clauses of the sy...
AbstractHorn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionis...
AbstractIn the Prolog language, Horn clauses of first-order logic are regarded as programs, and the ...
In recent years some papers have addressed the problem of the validity in Intuitionistic Proposition...