Results 1  10
of
526,161
Uniform proofs as a foundation for logic programming
 ANNALS OF PURE AND APPLIED LOGIC
, 1991
"... A prooftheoretic characterization of logical languages that form suitable bases for Prologlike 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 ..."
Abstract

Cited by 425 (124 self)
 Add to MetaCart
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 cutfree sequent proofs called uniform proofs. A uniform proof is one that can be found by a goaldirected search
Uniform Proofs and Natural Deductions
, 1994
"... . Using some routine properties ([zu], [po]) of the Prawitz translation f from (sequent calculus) derivations to (natural) deductions, and restricting ourselves to the language of firstorder hereditary Harrop formulae, we show (i) that f maps the simple uniform derivations of Miller et al onto the ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
the set of deductions in expanded normal form; and (ii) that f identifies two such derivations iff they differ only by the order in which conjunctions and universal formulae on the left are broken up, thus factoring through a bijection between the set of uniform proofs with backchaining and the set
Uniform proof complexity
, 2005
"... We define the notion of the uniform reduct of a propositional proof system as the set of those bounded formulas in the language of Peano Arithmetic which have polynomial size proofs under the ParisWilkietranslation. With respect to the arithmetic complexity of uniformhard and obviously reducts, we ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We define the notion of the uniform reduct of a propositional proof system as the set of those bounded formulas in the language of Peano Arithmetic which have polynomial size proofs under the ParisWilkietranslation. With respect to the arithmetic complexity of uniformhard and obviously reducts
Abstractions of Uniform Proofs
"... In this paper we analyze a framework for abstract interpretation of programs written in abstract logic programming languages in the sense of [15]. The framework is based on the sequent calculus formulation of the class of considered languages. Two systems of inductive definitions to model the bottom ..."
Abstract
 Add to MetaCart
the bottomup and the topdown constructions of proof trees in a sequent system are introduced. These constructions are then abstracted on domains in which a possible less precise yet correct description of computations is given. In the abstract domain, the meaning of a program is still characterized by sets
On the extension of logic programming with negation through uniform proofs
 In Proceedings Third International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR '95), (Lexington KY, July), LNCS 928
, 1995
"... Abstract. In the past, logic program semantics have been studied often separately from the underlying proof system, and this, consequently, leads to a somewhat confusing status of semantics. In this paper we show that elegant, yet natural semantics can be obtained by building a mechanism of justifyi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of justifying default assumptions on top of a proof system. In particular, we propose extended logic programming languages with negation through uniform proofs. The result is a very general framework, in which any abstract logic programming language can be extended to a nonmonotonic reasoning system, and many
On Uniform ProofTheoretical Operational Semantics for Logic Programming
, 2005
"... We study a general prooftheoretical framework for logic programming, the so called uniform proofs. We consider several logic programming systems derived in a natural way from logical proof systems (namely, from classical, intuitionistic, minimal, positive, relevance, or paranormal sequent calculi). ..."
Abstract
 Add to MetaCart
We study a general prooftheoretical framework for logic programming, the so called uniform proofs. We consider several logic programming systems derived in a natural way from logical proof systems (namely, from classical, intuitionistic, minimal, positive, relevance, or paranormal sequent calculi
Uniform Proofs and Disjunctive Logic Programming (Extended Abstract)
, 1995
"... ) y Gopalan Nadathur z Donald W. Loveland Department of Computer Science Department of Computer Science University of Chicago Duke University 1100 E 58th Street, Chicago, IL 60637 Box 90129, Durham, NC 277080129 gopalan@cs.uchicago.edu dwl@cs.duke.edu Abstract One formulation of the concept of ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
of logic programming is the notion of Abstract Logic Programming Language, introduced in [8]. Central to that definition is uniform proof, which enforces the requirements of inference direction, including goaldirectedness, and the duality of readings, declarative and procedural. We use this technology
Semantics of Concurrent Logic Programming as Uniform Proofs
, 1995
"... We describe LC , a formalism based on the proof theory of linear logic, whose aim is to specify concurrent computations and whose language restriction (as compared to other linear logic language) provides a simpler operational model that can lead to a more practical language core. The LC fragment i ..."
Abstract
 Add to MetaCart
is proveded to be an abstract logic programming language, that is any sequent can be derived by uniform proofs. The resulting class of computations can be viewed in terms of multiset rewriting and is reminiscent of the computations arising in the Chemical Abstract Machine and in the Gamma model. The fragment
A Uniform ProofTheoretic Investigation Of Linear Logic Programming
, 1994
"... In this paper we consider the problem of identifying logic programming languages for linear logic. Our analysis builds on a notion of goaldirected provability, characterized by the socalled uniform proofs, previously introduced for minimal and intuitionistic logic. A class of uniform proofs in lin ..."
Abstract

Cited by 71 (21 self)
 Add to MetaCart
In this paper we consider the problem of identifying logic programming languages for linear logic. Our analysis builds on a notion of goaldirected provability, characterized by the socalled uniform proofs, previously introduced for minimal and intuitionistic logic. A class of uniform proofs
The Uniform Prooftheoretic Foundation of Linear Logic Programming (Extended Abstract)
 PROCEEDINGS OF THE INTERNATIONAL LOGIC PROGRAMMING SYMPOSIUM
, 1991
"... We present a prooftheoretic analysis of a natural notion of logic programming for Girard's linear logic. This analysis enables us to identify a suitable notion of uniform proof. This in turn enables us to identify choices of classes of definite and goal formulae for which uniform proofs are c ..."
Abstract

Cited by 45 (7 self)
 Add to MetaCart
We present a prooftheoretic analysis of a natural notion of logic programming for Girard's linear logic. This analysis enables us to identify a suitable notion of uniform proof. This in turn enables us to identify choices of classes of definite and goal formulae for which uniform proofs
Results 1  10
of
526,161