AbstractWe give a model-theoretic semantics for the logic of higher-order Horn clauses, the basis of a form of the λProlog higher-order logic programming language. We define certain intensional general models and show that higher-order Horn clause logic is sound and complete with respect to them
AbstractWe describe a novel logic, called HiLog, and show that it provides a more suitable basis for...
AbstractMiller, D., G. Nadathur, F. Pfenning and A. Scedrov, Uniform proofs as a foundation for logi...
AbstractComputational Linguistics and Logic Programming have strong connections, but the former uses...
AbstractWe give a model-theoretic semantics for the logic of higher-order Horn clauses, the basis of...
A generalization of Horn clauses to a higher-order logic is described and examined as a basis for lo...
λ-Prolog is a logic programming language that extends Prolog by incorporating notions of higher-orde...
We introduce model-theoretic semantics [6] for Higher-Order Horn logic programming language. One adv...
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...
Hereditary Harrop formulas are an extension to Horn clauses in which the body of clauses can contain...
λ-Prolog is a logic programming language that extends Prolog by incorporating notions of higher-orde...
Hereditary Harrop formulas are an extension to Horn clauses in which the body of clauses can contain...
An Overview of Lambda-Prolog λ-Prolog is a logic programming language that extends Prolog by incorpo...
AbstractλProlog is a logic programming language in which hereditary Harrop formulas generalize Horn ...
AbstractWe describe a novel logic, called HiLog, and show that it provides a more suitable basis for...
AbstractMiller, D., G. Nadathur, F. Pfenning and A. Scedrov, Uniform proofs as a foundation for logi...
AbstractComputational Linguistics and Logic Programming have strong connections, but the former uses...
AbstractWe give a model-theoretic semantics for the logic of higher-order Horn clauses, the basis of...
A generalization of Horn clauses to a higher-order logic is described and examined as a basis for lo...
λ-Prolog is a logic programming language that extends Prolog by incorporating notions of higher-orde...
We introduce model-theoretic semantics [6] for Higher-Order Horn logic programming language. One adv...
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...
Hereditary Harrop formulas are an extension to Horn clauses in which the body of clauses can contain...
λ-Prolog is a logic programming language that extends Prolog by incorporating notions of higher-orde...
Hereditary Harrop formulas are an extension to Horn clauses in which the body of clauses can contain...
An Overview of Lambda-Prolog λ-Prolog is a logic programming language that extends Prolog by incorpo...
AbstractλProlog is a logic programming language in which hereditary Harrop formulas generalize Horn ...
AbstractWe describe a novel logic, called HiLog, and show that it provides a more suitable basis for...
AbstractMiller, D., G. Nadathur, F. Pfenning and A. Scedrov, Uniform proofs as a foundation for logi...
AbstractComputational Linguistics and Logic Programming have strong connections, but the former uses...
DOI
Add to ORKG