We introduce model-theoretic semantics [6] for Higher-Order Horn logic programming language. One advantage of logic programs over conventional non-logic programs has been that the least fixpoint is equal to the least model, therefore it is associated to logical consequence and has a meaningful declarative interpretation. In simple theory of types [9] on which Higher-Order Horn logic programming language is based, domain is dependent on interpretation [10]. To define T p operator for a logic program P, we need a fixed domain without regard to interpretation which is usually taken to be a set of atomic propositions. We build a semantics where we can fix a domain while changing interpretations. We also develop a fixpoint semantics based on our...
We develop an extensional semantics for higher-order logic programs withnegation, generalizing the t...
This paper considers, in a general setting, an axiomatic basis for Horn clause logic program-ming. I...
AbstractMiller, D., G. Nadathur, F. Pfenning and A. Scedrov, Uniform proofs as a foundation for logi...
We introduce model-theoretic semantics [6] for Higher-Order Horn logic programming language. One adv...
We build general model-theoretic semantics for higher-order logic programming languages. Usual seman...
We build general model-theoretic semantics for higher-order logic programming languages. Usual seman...
AbstractWe give a model-theoretic semantics for the logic of higher-order Horn clauses, the basis of...
AbstractWe give a model-theoretic semantics for the logic of higher-order Horn clauses, the basis of...
Motivated by applications in automated verification of higher-order functional programs, we develop ...
Motivated by applications in automated verification of higher-order functional programs, we develop ...
A generalization of Horn clauses to a higher-order logic is described and examined as a basis for lo...
AbstractVan Emden and Kowalski proposed a fixpoint semantics based on model-theory and an operationa...
We propose a purely extensional semantics for higher-order logic programming. In this semantics prog...
We propose a purely extensional semantics for higher-order logic programming. In this semantics prog...
AbstractVan Emden and Kowalski proposed a fixpoint semantics based on model-theory and an operationa...
We develop an extensional semantics for higher-order logic programs withnegation, generalizing the t...
This paper considers, in a general setting, an axiomatic basis for Horn clause logic program-ming. I...
AbstractMiller, D., G. Nadathur, F. Pfenning and A. Scedrov, Uniform proofs as a foundation for logi...
We introduce model-theoretic semantics [6] for Higher-Order Horn logic programming language. One adv...
We build general model-theoretic semantics for higher-order logic programming languages. Usual seman...
We build general model-theoretic semantics for higher-order logic programming languages. Usual seman...
AbstractWe give a model-theoretic semantics for the logic of higher-order Horn clauses, the basis of...
AbstractWe give a model-theoretic semantics for the logic of higher-order Horn clauses, the basis of...
Motivated by applications in automated verification of higher-order functional programs, we develop ...
Motivated by applications in automated verification of higher-order functional programs, we develop ...
A generalization of Horn clauses to a higher-order logic is described and examined as a basis for lo...
AbstractVan Emden and Kowalski proposed a fixpoint semantics based on model-theory and an operationa...
We propose a purely extensional semantics for higher-order logic programming. In this semantics prog...
We propose a purely extensional semantics for higher-order logic programming. In this semantics prog...
AbstractVan Emden and Kowalski proposed a fixpoint semantics based on model-theory and an operationa...
We develop an extensional semantics for higher-order logic programs withnegation, generalizing the t...
This paper considers, in a general setting, an axiomatic basis for Horn clause logic program-ming. I...
AbstractMiller, D., G. Nadathur, F. Pfenning and A. Scedrov, Uniform proofs as a foundation for logi...