Results 1  10
of
55
Tableau Methods for Modal and Temporal Logics
, 1995
"... This document is a complete draft of a chapter by Rajeev Gor'e on "Tableau Methods for Modal and Temporal Logics" which is part of the "Handbook of Tableau Methods", edited by M. D'Agostino, D. Gabbay, R. Hahnle and J. Posegga, to be published in 1998 by Kluwer, Dordrec ..."
Abstract

Cited by 127 (20 self)
 Add to MetaCart
This document is a complete draft of a chapter by Rajeev Gor'e on "Tableau Methods for Modal and Temporal Logics" which is part of the "Handbook of Tableau Methods", edited by M. D'Agostino, D. Gabbay, R. Hahnle and J. Posegga, to be published in 1998 by Kluwer, Dordrecht. Any comments and corrections are highly welcome. Please email me at rpg@arp.anu.edu.au The latest version of this document can be obtained via my WWW home page: http://arp.anu.edu.au/ Tableau Methods for Modal and Temporal Logics Rajeev Gor'e Contents 1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2 Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.1 Syntax and Notational Conventions . . . . . . . . . . . . 3 2.2 Axiomatics of Modal Logics . . . . . . . . . . . . . . . . 4 2.3 Kripke Semantics For Modal Logics . . . . . . . . . . . . 5 2.4 Known Correspondence and Completeness Results . . . . 6 2.5 Logical Consequence . . . . . . . . . . . . . . . . . . . . 8 2....
Substructural Logics on Display
, 1998
"... Substructural logics are traditionally obtained by dropping some or all of the structural rules from Gentzen's sequent calculi LK or LJ. It is well known that the usual logical connectives then split into more than one connective. Alternatively, one can start with the (intuitionistic) Lambek ca ..."
Abstract

Cited by 39 (16 self)
 Add to MetaCart
Substructural logics are traditionally obtained by dropping some or all of the structural rules from Gentzen's sequent calculi LK or LJ. It is well known that the usual logical connectives then split into more than one connective. Alternatively, one can start with the (intuitionistic) Lambek calculus, which contains these multiple connectives, and obtain numerous logics like: exponentialfree linear logic, relevant logic, BCK logic, and intuitionistic logic, in an incremental way. Each of these logics also has a classical counterpart, and some also have a "cyclic" counterpart. These logics have been studied extensively and are quite well understood. Generalising further, one can start with intuitionistic BiLambek logic, which contains the dual of every connective from the Lambek calculus. The addition of the structural rules then gives Bilinear, Birelevant, BiBCK and Biintuitionistic logic, again in an incremental way. Each of these logics also has a classical counterpart, and som...
Modality in Dialogue: Planning, Pragmatics and Computation
, 1998
"... Natural language generation (NLG) is first and foremost a reasoning task. In this reasoning, a system plans a communicative act that will signal key facts about the domain to the hearer. In generating action descriptions, this reasoning draws on characterizations both of the causal properties of the ..."
Abstract

Cited by 37 (9 self)
 Add to MetaCart
Natural language generation (NLG) is first and foremost a reasoning task. In this reasoning, a system plans a communicative act that will signal key facts about the domain to the hearer. In generating action descriptions, this reasoning draws on characterizations both of the causal properties of the domain and the states of knowledge of the participants in the conversation. This dissertation shows how such characterizations can be specified declaratively and accessed efficiently in NLG. The heart of this dissertation is a study of logical statements about knowledge and action in modal logic. By investigating the prooftheory of modal logic from a logic programming point of view, I show how many kinds of modal statements can be seen as straightforward instructions for computationally manageable search, just as Prolog clauses can. These modal statements provide sufficient expressive resources for an NLG system to represent the effects of actions in the world or to model an addressee whose knowledge in some respects exceeds and in other respects falls short of its own. To illustrate the use of such statements, I describe how the SPUD sentence planner exploits a modal knowledge base to
Unrestricted vs restricted cut in a tableau method for Boolean circuits
 In: AI&M 2004, 8th International Symposium on Artificial Intelligence and Mathematics
, 2005
"... This paper studies the relative proof complexity of variations of a tableau method for Boolean circuit satisfiability checking obtained by restricting the use of the cut rule in several natural ways. The results show that the unrestricted cut rule can be exponentially more effective than any of th ..."
Abstract

Cited by 21 (4 self)
 Add to MetaCart
(Show Context)
This paper studies the relative proof complexity of variations of a tableau method for Boolean circuit satisfiability checking obtained by restricting the use of the cut rule in several natural ways. The results show that the unrestricted cut rule can be exponentially more effective than any of the considered restrictions. Moreover, there are exponential differences between the restricted versions, too. The results also apply to the DavisPutnam procedure for conjunctive normal form formulae obtained from Boolean circuits with a standard linear size translation.
Cutfree Display Calculi for Nominal Tense Logics
 Conference on Tableaux Calculi and Related Methods (TABLEAUX
, 1998
"... . We define cutfree display calculi for nominal tense logics extending the minimal nominal tense logic (MNTL) by addition of primitive axioms. To do so, we use a translation of MNTL into the minimal tense logic of inequality (MTL 6= ) which is known to be properly displayable by application of Krac ..."
Abstract

Cited by 17 (7 self)
 Add to MetaCart
. We define cutfree display calculi for nominal tense logics extending the minimal nominal tense logic (MNTL) by addition of primitive axioms. To do so, we use a translation of MNTL into the minimal tense logic of inequality (MTL 6= ) which is known to be properly displayable by application of Kracht's results. The rules of the display calculus ffiMNTL for MNTL mimic those of the display calculus ffiMTL 6= for MTL 6= . Since ffiMNTL does not satisfy Belnap's condition (C8), we extend Wansing's strong normalisation theorem to get a similar theorem for any extension of ffiMNTL by addition of structural rules satisfying Belnap's conditions (C2)(C7). Finally, we show a weak Sahlqviststyle theorem for extensions of MNTL, and by Kracht's techniques, deduce that these Sahlqvist extensions of ffiMNTL also admit cutfree display calculi. 1 Introduction Background: The addition of names (also called nominals) to modal logics has been investigated recently with different motivations; see...
Sequent Calculi for Nominal Tense Logics: A Step Towards Mechanization?
, 1999
"... . We define sequentstyle calculi for nominal tense logics characterized by classes of modal frames that are firstorder definable by certain \Pi 0 1 formulae and \Pi 0 2 formulae. The calculi are based on d'Agostino and Mondadori's calculus KE and therefore they admit a restrict ..."
Abstract

Cited by 16 (4 self)
 Add to MetaCart
(Show Context)
. We define sequentstyle calculi for nominal tense logics characterized by classes of modal frames that are firstorder definable by certain \Pi 0 1 formulae and \Pi 0 2 formulae. The calculi are based on d'Agostino and Mondadori's calculus KE and therefore they admit a restricted cutrule that is not eliminable. A nice computational property of the restriction is, for instance, that at any stage of the proof, only a finite number of potential cutformulae needs to be taken under consideration. Although restrictions on the proof search (preserving completeness) are given in the paper and most of them are theoretically appealing, the use of those calculi for mechanization is however doubtful. Indeed, we present sequent calculi for fragments of classical logic that are syntactic variants of the sequent calculi for the nominal tense logics. 1 Introduction Background. The nominal tense logics are extensions of Prior tense logics (see e.g. [Pri57, RU71]) by adding nomina...
A New Fast TableauBased Decision Procedure for an Unquantified Fragment of Set Theory
, 1998
"... In this paper we present a new fast tableaubased decision procedure for the ground settheoretic fragment MultiLevel Syllogistic with Singleton (in short MLSS) which avoids the interleaving of model checking steps. The underlying ..."
Abstract

Cited by 11 (8 self)
 Add to MetaCart
In this paper we present a new fast tableaubased decision procedure for the ground settheoretic fragment MultiLevel Syllogistic with Singleton (in short MLSS) which avoids the interleaving of model checking steps. The underlying
Focusing in linear metalogic
 In Proceedings of IJCAR: International Joint Conference on Automated Reasoning, volume 5195 of LNAI
, 2008
"... nigam at lix.polytechnique.fr dale.miller at inria.fr Abstract. It is well known how to use an intuitionistic metalogic to specify natural deduction systems. It is also possible to use linear logic as a metalogic for the specification of a variety of sequent calculus proof systems. Here, we show t ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
(Show Context)
nigam at lix.polytechnique.fr dale.miller at inria.fr Abstract. It is well known how to use an intuitionistic metalogic to specify natural deduction systems. It is also possible to use linear logic as a metalogic for the specification of a variety of sequent calculus proof systems. Here, we show that if we adopt different focusing annotations for such linear logic specifications, a range of other proof systems can also be specified. In particular, we show that natural deduction (normal and nonnormal), sequent proofs (with and without cut), tableaux, and proof systems using general elimination and general introduction rules can all be derived from essentially the same linear logic specification by altering focusing annotations. By using elementary linear logic equivalences and the completeness of focused proofs, we are able to derive new and modular proofs of the soundness and completeness of these various proofs systems for intuitionistic and classical logics. 1
Simplification and Backjumping in Modal Tableau
 In Proc. TABLEAUX'98
, 1998
"... . This paper is concerned with various schemes for enhancing the performance of modal tableau procedures. It discusses techniques and strategies for dealing with the nondeterminism in tableau calculi, as well as simplification and backjumping. Benchmark results obtained with randomly generated modal ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
(Show Context)
. This paper is concerned with various schemes for enhancing the performance of modal tableau procedures. It discusses techniques and strategies for dealing with the nondeterminism in tableau calculi, as well as simplification and backjumping. Benchmark results obtained with randomly generated modal formulae show the e#ect of combinations of di#erent schemes. 1 Introduction Usually the literature on theorem provers for modal logic confines itself to a description of the underlying calculus and methodology. Sometimes the description is accompanied with a consideration of the worstcase complexity of an algorithm based on the presented calculus or a small collection of benchmark results. Problems arising when implementing modal theorem provers and also considerations concerning optimisations towards increased e#ciency have received much less attention, which, of course, is typical in a field under development. Sometimes the description of the theorem prover mentions some simplification ...
Mirlog: A logic for multimedia information retrieval
 LOGIC AND UNCERTAINTY IN INFORMATION RETRIEVAL: ADVANCED MODELS FOR THE
, 1998
"... This chapter presents a logic for the retrieval of multimedia information, whose ultimate goal is to model retrieval as an uncertain logical inference, in accordance to the logicbased view of retrieval. The logic being presented is the product of a number of extensions to a Description Logic, which ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
(Show Context)
This chapter presents a logic for the retrieval of multimedia information, whose ultimate goal is to model retrieval as an uncertain logical inference, in accordance to the logicbased view of retrieval. The logic being presented is the product of a number of extensions to a Description Logic, which constitutes the kernel of our model. Each extension is meant to capture an important aspect of the retrieval endeavour that is not adequately dealt with by the kernel logic. The extensions are: a 4valued semantics, aiming at capturing relevance in retrieval; closure assertions, aiming at allowing closedworld reading of selectively specified parts of a document base; fuzzy assertions, aiming at handling the uncertainty intrinsic in retrieval. The resulting logic is to be understood as a modelling retrieval tool, which can be used for the specification and the rapid prototyping of applications.