Results 1  10
of
72
Categorial Type Logics
 Handbook of Logic and Language
, 1997
"... Contents 1 Introduction: grammatical reasoning 1 2 Linguistic inference: the Lambek systems 5 2.1 Modelinggrammaticalcomposition ............................ 5 2.2 Gentzen calculus, cut elimination and decidability . . . . . . . . . . . . . . . . . . . . 9 2.3 Discussion: options for resource mana ..."
Abstract

Cited by 239 (5 self)
 Add to MetaCart
Contents 1 Introduction: grammatical reasoning 1 2 Linguistic inference: the Lambek systems 5 2.1 Modelinggrammaticalcomposition ............................ 5 2.2 Gentzen calculus, cut elimination and decidability . . . . . . . . . . . . . . . . . . . . 9 2.3 Discussion: options for resource management . . . . . . . . . . . . . . . . . . . . . . 13 3 The syntaxsemantics interface: proofs and readings 16 3.1 Term assignment for categorial deductions . . . . . . . . . . . . . . . . . . . . . . . . 17 3.2 Natural language interpretation: the deductive view . . . . . . . . . . . . . . . . . . . 21 4 Grammatical composition: multimodal systems 26 4.1 Mixedinference:themodesofcomposition........................ 26 4.2 Grammaticalcomposition:unaryoperations ....................... 30 4.2.1 Unary connectives: logic and structure . . . . . . . . . . . . . . . . . . . . . . . 31 4.2.2 Applications: imposing constraints, structural relaxation
Modal Logics for Qualitative Spatial Reasoning
, 1996
"... Spatial reasoning is essential for many AI applications. In most existing systems the representation is primarily numerical, so the information that can be handled is limited to precise quantitative data. However, for many purposes the ability to manipulate highlevel qualitative spatial information ..."
Abstract

Cited by 82 (12 self)
 Add to MetaCart
Spatial reasoning is essential for many AI applications. In most existing systems the representation is primarily numerical, so the information that can be handled is limited to precise quantitative data. However, for many purposes the ability to manipulate highlevel qualitative spatial information in a flexible way would be extremely useful. Such capabilities can be proveded by logical calculi; and indeed 1storder theories of certain spatial relations have been given [20]. But computing inferences in 1storder logic is generally intractable unless special (domain dependent) methods are known. 0order modal logics provide an alternative representation which is more expressive than classical 0order logic and yet often more amenable to automated deduction than 1storder formalisms. These calculi are usually interpreted as propositional logics: nonlogical constants are taken as denoting propositions. However, they can also be given a nominal interpretation in which the constants stand...
tps: A theorem proving system for classical type theory
 Journal of Automated Reasoning
, 1996
"... This is a description of TPS, a theorem proving system for classical type theory (Church’s typed λcalculus). TPS has been designed to be a general research tool for manipulating wffs of first and higherorder logic, and searching for proofs of such wffs interactively or automatically, or in a comb ..."
Abstract

Cited by 71 (6 self)
 Add to MetaCart
This is a description of TPS, a theorem proving system for classical type theory (Church’s typed λcalculus). TPS has been designed to be a general research tool for manipulating wffs of first and higherorder logic, and searching for proofs of such wffs interactively or automatically, or in a combination of these modes. An important feature of TPS is the ability to translate between expansion proofs and natural deduction proofs. Examples of theorems which TPS can prove completely automatically are given to illustrate certain aspects of TPS’s behavior and problems of theorem proving in higherorder logic. 7
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 69 (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 in linear logic is identified by an analysis of the permutability of inferences in the linear sequent calculus. We show that this class of proofs is complete (for logical consequence) for a certain (quite large) fragment of linear logic, which thus forms a logic programming language. We obtain a notion of resolution proof, in which only one left rule, of clausedirected resolution, is required. We also consider a translation, resembling those of Girard, of the hereditary Harrop fragment of intuitionistic logic into our framework. We show that goaldirected provability is preserved under this translation.
Structural Cut Elimination  I. Intuitionistic and Classical Logic
 Information and Computation
, 2000
"... this paper we present new proofs of cut elimination for intuitionistic and classical sequent calculi and give their representations in the logical framework LF [HHP93] as implemented in the Elf system [Pfe91]. Multisets are avoided altogether in these proofs, and termination measures are replaced b ..."
Abstract

Cited by 53 (17 self)
 Add to MetaCart
this paper we present new proofs of cut elimination for intuitionistic and classical sequent calculi and give their representations in the logical framework LF [HHP93] as implemented in the Elf system [Pfe91]. Multisets are avoided altogether in these proofs, and termination measures are replaced by three nested structural inductions. Parameters are treated as variables bound in derivations, thus naturally capturing occurrence conditions. A starting point for the proofs is Kleene's sequent system G 3 [Kle52], which we derive systematically from the point of view that a sequent calculus should be a calculus of proof search for natural deductions. It can easily be related to Gentzen's original and other sequent calculi. We augment G 3 with proof terms that are stable under weakening. These proof terms enable the structural induction and furthermore form the basis of the representation of the proof in LF. The most closely related work on cut elimination is MartinLo# f 's proof of admissibility [ML68]. In MartinLo# f 's system the cut rule incorporates aspects of both weakening and contraction which enables a structural induction argument closely related to ours. However, without the introduction of proof terms, the implicit weakening in the cut rule makes it difficult to implement this proof directly. Herbelin [Her95] restates this proof and proceeds by assigning proof terms only to restricted sequent calculi LJT and LKT which correspond more immediately to
The Uniform Prooftheoretic Foundation of Linear Logic Programming (Extended Abstract)
 Proceedings of the International Logic Programming Symposium
, 1991
"... ) James Harland Department of Computer Science University of Melbourne Parkville, 3052 Australia jah@cs.mu.oz.au David Pym Department of Computer Science University of Edinburgh Edinburgh EH9 3JZ Scotland, U.K. dpym@lfcs.ed.ac.uk Abstract We present a prooftheoretic analysis of a natu ..."
Abstract

Cited by 46 (7 self)
 Add to MetaCart
) James Harland Department of Computer Science University of Melbourne Parkville, 3052 Australia jah@cs.mu.oz.au David Pym Department of Computer Science University of Edinburgh Edinburgh EH9 3JZ Scotland, U.K. dpym@lfcs.ed.ac.uk Abstract 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 complete and so to obtain the appropriate formulation of resolution proof for such choices. Resolution proofs in linear logic are somewhat difficult to define. This difficulty arises from the need to decompose definite formulae into a form suitable for the use of the linear resolution rule, a rule which requires the selected clause to be deleted after use, and from the presence of the modality ! (of course). We consider a translation  resembling ...
Multimodal Linguistic Inference
, 1995
"... In this paper we compare grammatical inference in the context of simple and of mixed Lambek systems. Simple Lambek systems are obtained by taking the logic of residuation for a family of multiplicative connectives =; ffl; n, together with a package of structural postulates characterizing the resourc ..."
Abstract

Cited by 40 (6 self)
 Add to MetaCart
In this paper we compare grammatical inference in the context of simple and of mixed Lambek systems. Simple Lambek systems are obtained by taking the logic of residuation for a family of multiplicative connectives =; ffl; n, together with a package of structural postulates characterizing the resource management properties of the ffl connective. Different choices for Associativity and Commutativity yield the familiar logics NL, L, NLP, LP. Semantically, a simple Lambek system is a unimodal logic: the connectives get a Kripke style interpretation in terms of a single ternary accessibility relation modeling the notion of linguistic composition for each individual system. The simple systems each have their virtues in linguistic analysis. But none of them in isolation provides a basis for a full theory of grammar. In the second part of the paper, we consider two types of mixed Lambek systems. The first type is obtained by combining a number of unimodal systems into one multimodal logic. The...
Labelled Propositional Modal Logics: Theory and Practice
, 1996
"... We show how labelled deductive systems can be combined with a logical framework to provide a natural deduction implementation of a large and wellknown class of propositional modal logics (including K, D, T , B, S4, S4:2, KD45, S5). Our approach is modular and based on a separation between a base lo ..."
Abstract

Cited by 34 (8 self)
 Add to MetaCart
We show how labelled deductive systems can be combined with a logical framework to provide a natural deduction implementation of a large and wellknown class of propositional modal logics (including K, D, T , B, S4, S4:2, KD45, S5). Our approach is modular and based on a separation between a base logic and a labelling algebra, which interact through a fixed interface. While the base logic stays fixed, different modal logics are generated by plugging in appropriate algebras. This leads to a hierarchical structuring of modal logics with inheritance of theorems. Moreover, it allows modular correctness proofs, both with respect to soundness and completeness for semantics, and faithfulness and adequacy of the implementation. We also investigate the tradeoffs in possible labelled presentations: We show that a narrow interface between the base logic and the labelling algebra supports modularity and provides an attractive prooftheory (in comparision to, e.g., semantic embedding) but limits th...
A connection based proof method for intuitionistic logic
 TH WORKSHOP ON THEOREM PROVING WITH ANALYTIC TABLEAUX AND RELATED METHODS, LNAI 918
, 1995
"... We present a proof method for intuitionistic logic based on Wallen’s matrix characterization. Our approach combines the connection calculus and the sequent calculus. The search technique is based on notions of paths and connections and thus avoids redundancies in the search space. During the proof s ..."
Abstract

Cited by 29 (19 self)
 Add to MetaCart
We present a proof method for intuitionistic logic based on Wallen’s matrix characterization. Our approach combines the connection calculus and the sequent calculus. The search technique is based on notions of paths and connections and thus avoids redundancies in the search space. During the proof search the computed firstorder and intuitionistic substitutions are used to simultaneously construct a sequent proof which is more human oriented than the matrix proof. This allows to use our method within interactive proof environments. Furthermore we can consider local substitutions instead of global ones and treat substitutions occurring in different branches of the sequent proof independently. This reduces the number of extra copies of formulae to be considered.
On transforming intuitionistic matrix proofs into standardsequent proofs
 TABLEAUX–95, LNAI 918
, 1995
"... We present a procedure transforming intuitionistic matrix proofs into proofs within the intuitionistic standard sequent calculus. The transformation is based on L. Wallen’s proof justifying his matrix characterization for the validity of intuitionistic formulae. Since this proof makes use of Fitting ..."
Abstract

Cited by 26 (15 self)
 Add to MetaCart
We present a procedure transforming intuitionistic matrix proofs into proofs within the intuitionistic standard sequent calculus. The transformation is based on L. Wallen’s proof justifying his matrix characterization for the validity of intuitionistic formulae. Since this proof makes use of Fitting‘s nonstandard sequent calculus our procedure consists of two steps. First a nonstandard sequent proof will be extracted from a given matrix proof. Secondly we transform each nonstandard proof into a standard proof in a structure preserving way. To simplify the latter step we introduce an extended standard calculus which is shown to be sound and complete.