Results 1  10
of
24
Focusing the inverse method for linear logic
 Proceedings of CSL 2005
, 2005
"... 1.1 Quantification and the subformula property.................. 3 1.2 Ground forward sequent calculus......................... 5 1.3 Lifting to free variables............................... 10 ..."
Abstract

Cited by 38 (11 self)
 Add to MetaCart
1.1 Quantification and the subformula property.................. 3 1.2 Ground forward sequent calculus......................... 5 1.3 Lifting to free variables............................... 10
Resolution Methods for Decision Problems and FiniteModel Building
, 1992
"... Contents 1 Introduction 3 1.1 Related work : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 1.2 Structure of the thesis : : : : : : : : : : : : : : : : : : : : : : : : : : 4 2 Terminology 6 2.1 Terms, literals and clauses : : : : : : : : : : : : : : : : : : : : : : : : 6 2.2 Term s ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
Contents 1 Introduction 3 1.1 Related work : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 1.2 Structure of the thesis : : : : : : : : : : : : : : : : : : : : : : : : : : 4 2 Terminology 6 2.1 Terms, literals and clauses : : : : : : : : : : : : : : : : : : : : : : : : 6 2.2 Term structure and substitutions : : : : : : : : : : : : : : : : : : : : 7 2.3 Subsumption, factors, resolvents, splitting : : : : : : : : : : : : : : : 10 2.4 Herbrand semantics : : : : : : : : : : : : : : : : : : : : : : : : : : : : 12 2.5 Ordinary predicate logic and naming conventions : : : : : : : : : : : 12 3 Completeness of ordering refinements 14 3.1 Proving completeness by lifting : : : : : : : : : : : : : : : : : : : : 15 3.2 Some properties of 'Ø'predicates : : : : : : : : : : : : : : :
The Inverse Method
, 2001
"... this paper every formula is equivalent to a formula in negation normal form ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
this paper every formula is equivalent to a formula in negation normal form
Knowledge Representation and Classical Logic
"... Mathematical logicians had developed the art of formalizing declarative knowledge long before the advent of the computer age. But they were interested primarily in formalizing mathematics. Because of the important role of nonmathematical knowledge in AI, their emphasis was too narrow from the perspe ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
Mathematical logicians had developed the art of formalizing declarative knowledge long before the advent of the computer age. But they were interested primarily in formalizing mathematics. Because of the important role of nonmathematical knowledge in AI, their emphasis was too narrow from the perspective of knowledge representation, their formal languages were not sufficiently expressive. On the other hand, most logicians were not concerned about the possibility of automated reasoning; from the perspective of knowledge representation, they were often too generous in the choice of syntactic constructs. In spite of these differences, classical mathematical logic has exerted significant influence on knowledge representation research, and it is appropriate to begin this handbook with a discussion of the relationship between these fields. The language of classical logic that is most widely used in the theory of knowledge representation is the language of firstorder (predicate) formulas. These are the formulas that John McCarthy proposed to use for representing declarative knowledge in his advice taker paper [176], and Alan Robinson proposed to prove automatically using resolution [236]. Propositional logic is, of course, the most important subset of firstorder logic; recent
The inverse method for the logic of bunched implications
 In Proceedings of LPAR 2004, volume 3452 of LNAI
, 2005
"... Abstract. The inverse method, due to Maslov, is a forward theorem proving method for cutfree sequent calculi that relies on the subformula property. The Logic of Bunched Implications (BI), due to Pym and O’Hearn, is a logic which freely combines the familiar connectives of intuitionistic logic with ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Abstract. The inverse method, due to Maslov, is a forward theorem proving method for cutfree sequent calculi that relies on the subformula property. The Logic of Bunched Implications (BI), due to Pym and O’Hearn, is a logic which freely combines the familiar connectives of intuitionistic logic with multiplicative linear conjunction and its adjoint implication. We present the first formulation of an inverse method for propositional BI without units. We adapt the sequent calculus for BI into a forward calculus. The soundness and completeness of the calculus are proved, and a canonical form for bunches is given. 1
Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method
"... Abstract. The inverse method is a generic proof search procedure applicable to nonclassical logics satisfying cut elimination and the subformula property. In this paper we describe a general architecture and several highlevel optimizations that enable its efficient implementation. Some of these re ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Abstract. The inverse method is a generic proof search procedure applicable to nonclassical logics satisfying cut elimination and the subformula property. In this paper we describe a general architecture and several highlevel optimizations that enable its efficient implementation. Some of these rely on logicspecific properties, such as polarization and focusing, which have been shown to hold in a wide range of nonclassical logics. Others, such as rule subsumption and recursive backward subsumption apply in general. We empirically evaluate our techniques on firstorder intuitionistic logic with our implementation Imogen and demonstrate a substantial improvement over all other existing intuitionistic theorem provers on problems from the ILTP problem library. 1
Extensions of Structural Synthesis of Programs
 Lic. Thesis, TRITAIT R 95:09, Dept. of Teleinformatics
, 1994
"... Structural synthesis of programs (SSP) is an approach to deductive synthesis of functional programs using types as specifications and based on the CurryHoward correspondence and on an intensional treatment of the notion of type. The implemented programming environments employing SSP have been based ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Structural synthesis of programs (SSP) is an approach to deductive synthesis of functional programs using types as specifications and based on the CurryHoward correspondence and on an intensional treatment of the notion of type. The implemented programming environments employing SSP have been based on a fragment of intuitionistic propositional logic (simple type theory) and on a naturaldeduction proof system. In the paper, we indicate that the proof search strategy used in these systems is applicable to a variety of naturaldeduction proof systems (not necessarily of intuitionistic or propositional logics), and that the objectoriented user frontend specification language of the NUT programming environment can, in fact, be given a useful logical semantics in terms of intuitionistic firstorder logic. 1 Introduction Structural synthesis of programs (SSP) as proposed and described by Mints and Tyugu [MT82] is an approach to deductive synthesis of functional programs using types as sp...
Imogen: Focusing the Polarized Inverse Method for Intuitionistic Propositional Logic
"... Abstract. In this paper we describe Imogen, a theorem prover for intuitionistic propositional logic using the focused inverse method. We represent finegrained control of the search behavior by polarizing the input formula. In manipulating the polarity of atoms and subformulas, we can often improve ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Abstract. In this paper we describe Imogen, a theorem prover for intuitionistic propositional logic using the focused inverse method. We represent finegrained control of the search behavior by polarizing the input formula. In manipulating the polarity of atoms and subformulas, we can often improve the search time by several orders of magnitude. We tested our method against seven other systems on the propositional fragment of the ILTP library. We found that our prover outperforms all other provers on a substantial subset of the library. 1