Results 1  10
of
26
A Judgmental Reconstruction of Modal Logic
 Mathematical Structures in Computer Science
, 1999
"... this paper we reconsider the foundations of modal logic, following MartinL of's methodology of distinguishing judgments from propositions [ML85]. We give constructive meaning explanations for necessity (2) and possibility (3). This exercise yields a simple and uniform system of natural deduction for ..."
Abstract

Cited by 160 (38 self)
 Add to MetaCart
this paper we reconsider the foundations of modal logic, following MartinL of's methodology of distinguishing judgments from propositions [ML85]. We give constructive meaning explanations for necessity (2) and possibility (3). This exercise yields a simple and uniform system of natural deduction for intuitionistic modal logic which does not exhibit anomalies found in other proposals. We also give a new presentation of lax logic [FM97] and find that it is already contained in modal logic, using the decomposition of the lax modality fl A as
A Spatial Logic for Concurrency (Part II)
 IN CONCUR2002: CONCURRENCY THEORY (13TH INTERNATIONAL CONFERENCE), LECTURE NOTES IN COMPUTER SCIENCE
, 1998
"... ..."
Labelled Tableaux for Nonmonotonic Reasoning: Cumulative Consequence Relations
 Journal of Logic and Computation
, 2002
"... In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method exploits the strong connection between these deductive relations and conditional logics, and it is based on the usual possible world semantics devised for the ..."
Abstract

Cited by 25 (10 self)
 Add to MetaCart
In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method exploits the strong connection between these deductive relations and conditional logics, and it is based on the usual possible world semantics devised for the latter. The label formalism KEM, introduced to account for the semantics of normal modal logics, is easily adapted to the semantics of conditional logic by simply indexing labels with formulas. The basic inference rules are provided by the propositional system KE a tableaulike analytic proof system devised to be used both as a refutation method and a direct method of proof that is the classical core of KEM which is thus enlarged with suitable elimination rules for the conditional connective. The resulting algorithmic framework is able to compute cumulative consequence relations in so far as they can be expressed as conditional implications.
Hybridizing a logical framework
 In International Workshop on Hybrid Logic 2006 (HyLo 2006), Electronic Notes in Computer Science
, 2006
"... The logical framework LF is a constructive type theory of dependent functions that can elegantly encode many other logical systems. Prior work has studied the benefits of extending it to the linear logical framework LLF, for the incorporation linear logic features into the type theory affords good r ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
The logical framework LF is a constructive type theory of dependent functions that can elegantly encode many other logical systems. Prior work has studied the benefits of extending it to the linear logical framework LLF, for the incorporation linear logic features into the type theory affords good representations of state change. We describe and argue for the usefulness of an extension of LF by features inspired by hybrid logic, which has several benefits. For one, it shows how linear logic features can be decomposed into primitive operations manipulating abstract resource labels. More importantly, it makes it possible to realize a metalogical framework capable of reasoning about stateful deductive systems encoded in the style familiar from prior work with LLF, taking advantage of familiar methodologies used for metatheoretic reasoning in LF.Acknowledgments From the very first computer science course I took at CMU, Frank Pfenning has been an exceptional teacher and mentor. For his patience, breadth of knowledge, and mathematical good taste I am extremely thankful. No less do I owe to the other two major contributors to my programming languages
Fibring Labelled Deduction Systems
 Journal of Logic and Computation
, 2002
"... We give a categorial characterization of how labelled deduction systems for logics with a propositional basis behave under unconstrained fibring and under fibring that is constrained by symbol sharing. At the semantic level, we introduce a general semantics for our systems and then give a categorial ..."
Abstract

Cited by 13 (9 self)
 Add to MetaCart
We give a categorial characterization of how labelled deduction systems for logics with a propositional basis behave under unconstrained fibring and under fibring that is constrained by symbol sharing. At the semantic level, we introduce a general semantics for our systems and then give a categorial characterization of fibring of models. Based on this, we establish the conditions under which our systems are sound and complete with respect to the general semantics for the corresponding logics, and establish requirements on logics and systems so that completeness is preserved by both forms of fibring.
A New Method for Bounding the Complexity of Modal Logics
, 1997
"... . We present a new prooftheoretic approach to bounding the complexity of the decision problem for propositional modal logics. We formalize logics in a uniform way as sequent systems and then restrict the structural rules for particular systems. This, combined with an analysis of the accessibility r ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
. We present a new prooftheoretic approach to bounding the complexity of the decision problem for propositional modal logics. We formalize logics in a uniform way as sequent systems and then restrict the structural rules for particular systems. This, combined with an analysis of the accessibility relation of the corresponding Kripke structures, yields decision procedures with bounded space requirements. As examples we give O(n log n) space procedures for the modal logics K and T. 1 Introduction We present a new prooftheoretic approach to bounding the complexity of the decision problem for propositional modal logics. We formalize logics in a uniform way as cutfree labelled sequent systems and then restrict the structural rules for particular systems. This, combined with an analysis of the accessibility relation of the corresponding Kripke structures, yields decision procedures with space requirements that are easily bounded. As examples we give O(n log n) space decision procedures f...
Natural Deduction for NonClassical Logics
, 1996
"... We present a framework for machine implementation of families of nonclassical logics with Kripkestyle semantics. We decompose a logic into two interacting parts, each a natural deduction system: a base logic of labelled formulae, and a theory of labels characterizing the properties of the Kripke m ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
We present a framework for machine implementation of families of nonclassical logics with Kripkestyle semantics. We decompose a logic into two interacting parts, each a natural deduction system: a base logic of labelled formulae, and a theory of labels characterizing the properties of the Kripke models. By appropriate combinations we capture both partial and complete fragments of large families of nonclassical logics such as modal, relevance, and intuitionistic logics. Our approach is modular and supports uniform proofs of correctness and proof normalization. We have implemented our work in the Isabelle Logical Framework.
Optimised Modal Translation and Resolution
, 1997
"... This thesis studies the optimised functional translation of propositional modal logics to firstorder logic, and firstorder resolution as a means for realising modal reasoning. The optimised functional translation maps modal logics to a lattice of clausal logics, called path logics. The general app ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
This thesis studies the optimised functional translation of propositional modal logics to firstorder logic, and firstorder resolution as a means for realising modal reasoning. The optimised functional translation maps modal logics to a lattice of clausal logics, called path logics. The general apparatus of inference for path logics is theory resolution. We show that satisfiability in basic path logic and certain extensions can be decided by resolution and condensing without requiring additional refinement strategies. We propose an improved theory unification algorithm for S4, and we present a calculus of ordered Eresolution with normalisation. We show also that some essentially secondorder modal logics convert to path logics, which can be exploited for accomodating inference for modal logics with numerical quantifiers in a calculus of resolution and simple arithmetic. Zusammenfassung Diese Arbeit untersucht die optimierte funktionale Ubersetzung von modalen Aussagenlogiken in die...
Clausal tableau systems and space bounds for the modal logics
 KD, T, KB, KDB, and B. Submitted to Journal of Logic and Computation
, 1999
"... Abstract. We propose so called clausal tableau systems for the common modal logics K, KD, T, KB, KDB and B. There is a measure such that for each tableau rule of these systems the measure of all its denominators is smaller than the measure of its numerator. Basing on these systems, we give a decisio ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
Abstract. We propose so called clausal tableau systems for the common modal logics K, KD, T, KB, KDB and B. There is a measure such that for each tableau rule of these systems the measure of all its denominators is smaller than the measure of its numerator. Basing on these systems, we give a decision procedure for the logics, which uses O(n 2)space for the logics T, KB, KDB and B, and O(n. log n)space for the logics K and KD. We also show that the problem of checking satisfiability in T, KB, KDB, or B for formulae with finitely bounded modaldepth is decidable in O(n. log n)space. We are the first who explicitly establish space requirements for the logics KB, KDB and B. 1
Classical Modal Display Logic . . .
, 2007
"... We begin by showing how to faithfully encode the Classical Modal Display Logic (CMDL) of Wansing into the Calculus of Structures (CoS) of Guglielmi. Since every CMDL calculus enjoys cutelimination, we obtain a cutelimination theorem for all corresponding CoS calculi. We then show how our result le ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
We begin by showing how to faithfully encode the Classical Modal Display Logic (CMDL) of Wansing into the Calculus of Structures (CoS) of Guglielmi. Since every CMDL calculus enjoys cutelimination, we obtain a cutelimination theorem for all corresponding CoS calculi. We then show how our result leads to a minimal cutfree CoS calculus for modal logic S5. No other existing CoS calculi for S5 enjoy both these properties simultaneously.