Add to ORKGProjet CHLOEWe develop the foundations of Horn clause logic programming in a proof-theoretic style. We present a formal unification system for first order terms including a syntactic representation of environments and formalisms for the bottom-up and top down computation of answers in a unified formal setting. In passing, we propose an abstrac unification machine. We also discuss the possibility and implications of representing logic program evaluation strategies in the lambda calculus
AbstractMiller, D., G. Nadathur, F. Pfenning and A. Scedrov, Uniform proofs as a foundation for logi...
Since logic programming systems directly implement search and unification and since these operations...
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programmi...
In this paper definite Horn clause programs are investigated within a proof-theoretic framework; pro...
We propose a logic-independent approach to logic programming through which the paradigm as we know i...
The notions of uniform proof and resolution represent the foundations of the proof-theoretic charact...
To appear in Theory and Practice of Logic Programming (TPLP)International audienceSeveral formal sys...
Most logic programming languages have the first-order, classical theory of Horn clauses as their log...
This paper considers, in a general setting, an axiomatic basis for Horn clause logic program-ming. I...
The unification of simply typed λ-terms modulo the rules of ß- and η-conversions is often called hi...
Logic programming languages have many characteristics that indicate that they should serve as good i...
A proof-theoretic characterization of logical languages that form suitable bases for Prolog-like pro...
AbstractIncorporating equality into the unification process has added great power to automated theor...
In this paper, we give a new presentation of the fundamental results of the theory of Logic Programm...
The combination of functional and pure Horn clause logic languages is formally introduced. To give a...
AbstractMiller, D., G. Nadathur, F. Pfenning and A. Scedrov, Uniform proofs as a foundation for logi...
Since logic programming systems directly implement search and unification and since these operations...
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programmi...
In this paper definite Horn clause programs are investigated within a proof-theoretic framework; pro...
We propose a logic-independent approach to logic programming through which the paradigm as we know i...
The notions of uniform proof and resolution represent the foundations of the proof-theoretic charact...
To appear in Theory and Practice of Logic Programming (TPLP)International audienceSeveral formal sys...
Most logic programming languages have the first-order, classical theory of Horn clauses as their log...
This paper considers, in a general setting, an axiomatic basis for Horn clause logic program-ming. I...
The unification of simply typed λ-terms modulo the rules of ß- and η-conversions is often called hi...
Logic programming languages have many characteristics that indicate that they should serve as good i...
A proof-theoretic characterization of logical languages that form suitable bases for Prolog-like pro...
AbstractIncorporating equality into the unification process has added great power to automated theor...
In this paper, we give a new presentation of the fundamental results of the theory of Logic Programm...
The combination of functional and pure Horn clause logic languages is formally introduced. To give a...
AbstractMiller, D., G. Nadathur, F. Pfenning and A. Scedrov, Uniform proofs as a foundation for logi...
Since logic programming systems directly implement search and unification and since these operations...
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programmi...