Uniform proofs as a foundation for logic programming

Uniform proofs as a foundation for logic programming (1991)

Cached

Download Links

[www.lix.polytechnique.fr]
[ftp.cs.duke.edu]

Other Repositories/Bibliography

DBLP

by Dale Miller , Gopalan Nadathur , Frank Pfenning , Andre Scedrov

Venue:	ANNALS OF PURE AND APPLIED LOGIC
Citations:	334 - 96 self

Versions

Version History

Metadata Version 2

User correction supplied by mph

Datum	Value	Source
TITLE	Uniform proofs as a foundation for logic programming	INFERENCE
AUTHOR NAME	Dale Miller	user correction
AUTHOR AFFIL	; Computer and Information Science Department; University of Pennsylvania	user correction
AUTHOR ADDR	Philadelphia, PA 19104	user correction
AUTHOR NAME	Gopalan Nadathur	user correction
AUTHOR AFFIL	Computer Science Department; Duke University	user correction
AUTHOR ADDR	Durham, NC 27706, USA	user correction
AUTHOR NAME	Frank Pfenning	user correction
AUTHOR AFFIL	Computer Science Department; Carnegie Mellon University	user correction
AUTHOR ADDR	Pittsburgh PA 15213, U.S.A.	user correction
AUTHOR NAME	Andre Scedrov	user correction
ABSTRACT	A proof-theoretic characterization of logical languages that form suitable bases for Prolog-like programming languages is provided. This characterization is based on the principle that the declarative meaning of a logic program, provided by provability in a logical system, should coincide with its operational meaning, provided by interpreting logical connectives as simple and fixed search instructions. The operational semantics is formalized by the identification of a class of cut-free sequent proofs called uniform proofs. A uniform proof is one that can be found by a goal-directed search that respects the interpretation of the logical connectives as search instructions. The concept of a uniform proof is used to define the notion of an abstract logic programming language, and it is shown that first-order and higher-order Horn clauses with classical provability are examples of such a language. Horn clauses are then generalized to hereditary Harrop formulas and it is shown that first-order and higher-order versions of this new class of formulas are also abstract logic programming languages if the inference rules are those of either intuitionistic or minimal logic. The programming language significance of the various generalizations to first-order Horn clauses is briefly discussed.	user correction
YEAR	1991	INFERENCE
VENUE	ANNALS OF PURE AND APPLIED LOGIC	user correction
VENUE TYPE	JOURNAL	INFERENCE
PAGES	125--157	user correction
VOLUME	51	INFERENCE
CITATIONS	34 found	ParsCit 1.0