Order:
Disambiguations
Frank Wolter [59]F. Wolter [13]
  1.  91
    Handbook of Modal Logic.Patrick Blackburn, Johan van Benthem & Frank Wolter (eds.) - 2006 - Elsevier.
    The Handbook of Modal Logic contains 20 articles, which collectively introduce contemporary modal logic, survey current research, and indicate the way in which the field is developing. The articles survey the field from a wide variety of perspectives: the underling theory is explored in depth, modern computational approaches are treated, and six major applications areas of modal logic (in Mathematics, Computer Science, Artificial Intelligence, Linguistics, Game Theory, and Philosophy) are surveyed. The book contains both well-written expository articles, suitable for beginners (...)
    Direct download  
     
    Export citation  
     
    Bookmark   39 citations  
  2. Many-Dimensional Modal Logics: Theory and Applications.D. M. Gabbay, A. Kurucz, F. Wolter & M. Zakharyaschev - 2005 - Studia Logica 81 (1):147-150.
     
    Export citation  
     
    Bookmark   54 citations  
  3.  42
    Properties of Independently Axiomatizable Bimodal Logics.Marcus Kracht & Frank Wolter - 1991 - Journal of Symbolic Logic 56 (4):1469-1485.
  4.  42
    Normal Monomodal Logics Can Simulate All Others.Marcus Kracht & Frank Wolter - 1999 - Journal of Symbolic Logic 64 (1):99-138.
    This paper shows that non-normal modal logics can be simulated by certain polymodal normal logics and that polymodal normal logics can be simulated by monomodal (normal) logics. Many properties of logics are shown to be reflected and preserved by such simulations. As a consequence many old and new results in modal logic can be derived in a straightforward way, sheding new light on the power of normal monomodal logic.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   25 citations  
  5.  10
    Kripke Completeness of Strictly Positive Modal Logics Over Meet-Semilattices with Operators.Stanislav Kikot, Agi Kurucz, Yoshihito Tanaka, Frank Wolter & Michael Zakharyaschev - 2019 - Journal of Symbolic Logic 84 (2):533-588.
    Our concern is the completeness problem for spi-logics, that is, sets of implications between strictly positive formulas built from propositional variables, conjunction and modal diamond operators. Originated in logic, algebra and computer science, spi-logics have two natural semantics: meet-semilattices with monotone operators providing Birkhoff-style calculi and first-order relational structures (aka Kripke frames) often used as the intended structures in applications. Here we lay foundations for a completeness theory that aims to answer the question whether the two semantics define the same (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  6.  61
    On Logics with Coimplication.Frank Wolter - 1998 - Journal of Philosophical Logic 27 (4):353-387.
    This paper investigates (modal) extensions of Heyting-Brouwer logic, i.e., the logic which results when the dual of implication (alias coimplication) is added to the language of intuitionistic logic. We first develop matrix as well as Kripke style semantics for those logics. Then, by extending the Gö;del-embedding of intuitionistic logic into S4, it is shown that all (modal) extensions of Heyting-Brouwer logic can be embedded into tense logics (with additional modal operators). An extension of the Blok-Esakia-Theorem is proved for this embedding.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   21 citations  
  7.  27
    Decidable Fragments of First-Order Temporal Logics.Ian Hodkinson, Frank Wolter & Michael Zakharyaschev - 2000 - Annals of Pure and Applied Logic 106 (1-3):85-134.
    In this paper, we introduce a new fragment of the first-order temporal language, called the monodic fragment, in which all formulas beginning with a temporal operator have at most one free variable. We show that the satisfiability problem for monodic formulas in various linear time structures can be reduced to the satisfiability problem for a certain fragment of classical first-order logic. This reduction is then used to single out a number of decidable fragments of first-order temporal logics and of two-sorted (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   19 citations  
  8. Simulation and Transfer Results in Modal Logic – a Survey.Marcus Kracht & Frank Wolter - 1997 - Studia Logica 59 (2):149-177.
    This papers gives a survey of recent results about simulations of one class of modal logics by another class and of the transfer of properties of modal logics under extensions of the underlying modal language. We discuss: the transfer from normal polymodal logics to their fusions, the transfer from normal modal logics to their extensions by adding the universal modality, and the transfer from normal monomodal logics to minimal tense extensions. Likewise, we discuss simulations of normal polymodal logics by normal (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  9.  15
    The Structure of Lattices of Subframe Logics.Frank Wolter - 1997 - Annals of Pure and Applied Logic 86 (1):47-100.
    This paper investigates the structure of lattices of normal mono- and polymodal subframelogics, i.e., those modal logics whose frames are closed under a certain type of substructures. Nearly all basic modal logics belong to this class. The main lattice theoretic tool applied is the notion of a splitting of a complete lattice which turns out to be connected with the “geometry” and “topology” of frames, with Kripke completeness and with axiomatization problems. We investigate in detail subframe logics containing K4, those (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  10.  26
    Products of 'Transitive' Modal Logics.David Gabelaia, Agi Kurucz, Frank Wolter & Michael Zakharyaschev - 2005 - Journal of Symbolic Logic 70 (3):993-1021.
    We solve a major open problem concerning algorithmic properties of products of ‘transitive’ modal logics by showing that products and commutators of such standard logics as K4, S4, S4.1, K4.3, GL, or Grz are undecidable and do not have the finite model property. More generally, we prove that no Kripke complete extension of the commutator [K4,K4] with product frames of arbitrary finite or infinite depth (with respect to both accessibility relations) can be decidable. In particular, if.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  11.  23
    Tense Logic Without Tense Operators.Frank Wolter - 1996 - Mathematical Logic Quarterly 42 (1):145-171.
    We shall describe the set of strongly meet irreducible logics in the lattice ϵLin.t of normal tense logics of weak orderings. Based on this description it is shown that all logics in ϵLin.t are independently axiomatizable. Then the description is used in order to investigate tense logics with respect to decidability, finite axiomatizability, axiomatization problems and completeness with respect to Kripke semantics. The main tool for the investigation is a translation of bimodal formulas into a language talking about partitions of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  12.  4
    Normal Monomodal Logics Can Simulate All Others.Marcus Kracht & Frank Wolter - 1999 - Journal of Symbolic Logic 64 (1):99-138.
    This paper shows that non-normal modal logics can be simulated by certain polymodal normal logics and that polymodal normal logics can be simulated by monomodal logics. Many properties of logics are shown to be reflected and preserved by such simulations. As a consequence many old and new results in modal logic can be derived in a straightforward way, sheding new light on the power of normal monomodal logic.
    Direct download  
     
    Export citation  
     
    Bookmark   17 citations  
  13.  88
    First Order Common Knowledge Logics.Frank Wolter - 2000 - Studia Logica 65 (2):249-271.
    In this paper we investigate first order common knowledge logics; i.e., modal epistemic logics based on first order logic with common knowledge operators. It is shown that even rather weak fragments of first order common knowledge logics are not recursively axiomatizable. This applies, for example, to fragments which allow to reason about names only; that is to say, fragments the first order part of which is based on constant symbols and the equality symbol only. Then formal properties of "quantifying into" (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  14.  24
    Speaking About Transitive Frames in Propositional Languages.Yasuhito Suzuki, Frank Wolter & Michael Zakharyaschev - 1998 - Journal of Logic, Language and Information 7 (3):317-339.
    This paper is a comparative study of the propositional intuitionistic (non-modal) and classical modal languages interpreted in the standard way on transitive frames. It shows that, when talking about these frames rather than conventional quasi-orders, the intuitionistic language displays some unusual features: its expressive power becomes weaker than that of the modal language, the induced consequence relation does not have a deduction theorem and is not protoalgebraic. Nevertheless, the paper develops a manageable model theory for this consequence and its extensions (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  15.  19
    The Finite Model Property in Tense Logic.Frank Wolter - 1995 - Journal of Symbolic Logic 60 (3):757-774.
    Tense logics in the bimodal propositional language are investigated with respect to the Finite Model Property. In order to prove positive results techniques from investigations of modal logics above K4 are extended to tense logic. General negative results show the limits of the transfer.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  16.  45
    On Dynamic Topological and Metric Logics.B. Konev, R. Kontchakov, F. Wolter & M. Zakharyaschev - 2006 - Studia Logica 84 (1):129-160.
    We investigate computational properties of propositional logics for dynamical systems. First, we consider logics for dynamic topological systems (W.f), fi, where W is a topological space and f a homeomorphism on W. The logics come with ‘modal’ operators interpreted by the topological closure and interior, and temporal operators interpreted along the orbits {w, f(w), f2 (w), ˙˙˙} of points w ε W. We show that for various classes of topological spaces the resulting logics are not recursively enumerable (and so not (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  17.  53
    A Modal Logic Framework for Reasoning About Comparative Distances and Topology.Mikhail Sheremet, Frank Wolter & Michael Zakharyaschev - 2010 - Annals of Pure and Applied Logic 161 (4):534-559.
    We propose and investigate a uniform modal logic framework for reasoning about topology and relative distance in metric and more general distance spaces, thus enabling the comparison and combination of logics from distinct research traditions such as Tarski’s for topological closure and interior, conditional logics, and logics of comparative similarity. This framework is obtained by decomposing the underlying modal-like operators into first-order quantifier patterns. We then show that quite a powerful and natural fragment of the resulting first-order logic can be (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  18. Temporalising Tableaux.Roman Kontchakov, Carsten Lutz, Frank Wolter & Michael Zakharyaschev - 2004 - Studia Logica 76 (1):91 - 134.
    As a remedy for the bad computational behaviour of first-order temporal logic (FOTL), it has recently been proposed to restrict the application of temporal operators to formulas with at most one free variable thereby obtaining so-called monodic fragments of FOTL. In this paper, we are concerned with constructing tableau algorithms for monodic fragments based on decidable fragments of first-order logic like the two-variable fragment or the guarded fragment. We present a general framework that shows how existing decision procedures for first-order (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  19. Decidable Fragments of First-Order Modal Logics.Frank Wolter & Michael Zakharyaschev - 2001 - Journal of Symbolic Logic 66 (3):1415-1438.
    The paper considers the set ML 1 of first-order polymodal formulas the modal operators in which can be applied to subformulas of at most one free variable. Using a mosaic technique, we prove a general satisfiability criterion for formulas in ML 1 , which reduces the modal satisfiability to the classical one. The criterion is then used to single out a number of new, in a sense optimal, decidable fragments of various modal predicate logics.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  20.  39
    Completeness and Decidability of Tense Logics Closely Related to Logics Above K.Frank Wolter - 1997 - Journal of Symbolic Logic 62 (1):131-158.
    Tense logics formulated in the bimodal propositional language are investigated with respect to Kripke-completeness (completeness) and decidability. It is proved that all minimal tense extensions of modal logics of finite width (in the sense of K. Kine) as well as all minimal tense extensions of cofinal subframe logics (in the sense of M. Zakharyaschev) are complete. The decidability of all finitely axiomatizable minimal tense extensions of cofinal subframe logics is shown. A number of variations and extensions of these results are (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  21.  8
    Non-Primitive Recursive Decidability of Products of Modal Logics with Expanding Domains.David Gabelaia, Agi Kurucz, Frank Wolter & Michael Zakharyaschev - 2006 - Annals of Pure and Applied Logic 142 (1):245-268.
    We show that—unlike products of ‘transitive’ modal logics which are usually undecidable—their ‘expanding domain’ relativisations can be decidable, though not in primitive recursive time. In particular, we prove the decidability and the finite expanding product model property of bimodal logics interpreted in two-dimensional structures where one component—call it the ‘flow of time’—is • a finite linear order or a finite transitive tree and the other is composed of structures like • transitive trees/partial orders/quasi-orders/linear orders or only finite such structures expanding (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  22.  10
    A Counterexample in Tense Logic.Frank Wolter - 1996 - Notre Dame Journal of Formal Logic 37 (2):167-173.
    We construct a normal extension of K4 with the finite model property whose minimal tense extension is not complete with respect to Kripke semantics.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  23. -Connections of Abstract Description Systems.Oliver Kutz, Carsten Lutz, Frank Wolter & Michael Zakharyaschev - 2004 - Artificial Intelligence 156 (1):1-73.
  24.  10
    Products of ‘Transitive’ Modal Logics.David Gabelaia, Agi Kurucz, Frank Wolter & Michael Zakharyaschev - 2005 - Journal of Symbolic Logic 70 (3):993-1021.
    We solve a major open problem concerning algorithmic properties of products of ‘transitive’ modal logics by showing that products and commutators of such standard logics as K4, S4, S4.1, K4.3, GL, or Grz are undecidable and do not have the finite model property. More generally, we prove that no Kripke complete extension of the commutator [K4,K4] with product frames of arbitrary finite or infinite depth can be decidable. In particular, if.
    Direct download  
     
    Export citation  
     
    Bookmark   6 citations  
  25.  36
    Willem Blok and Modal Logic.W. Rautenberg, M. Zakharyaschev & F. Wolter - 2006 - Studia Logica 83 (1-3):15-30.
    We present our personal view on W.J. Blok's contribution to modal logic.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  26.  4
    Axiomatizing the Monodic Fragment of First-Order Temporal Logic.Frank Wolter & Michael Zakharyaschev - 2002 - Annals of Pure and Applied Logic 118 (1-2):133-145.
    It is known that even seemingly small fragments of the first-order temporal logic over the natural numbers are not recursively enumerable. In this paper we show that the monodic fragment is an exception by constructing its finite Hilbert-style axiomatization. We also show that the monodic fragment with equality is not recursively axiomatizable.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  27.  1
    Query Inseparability forALContologies.Elena Botoeva, Carsten Lutz, Vladislav Ryzhikov, Frank Wolter & Michael Zakharyaschev - 2019 - Artificial Intelligence 272:1-51.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  28.  2
    Dynamic Topological Logics Over Spaces with Continuous Functions.B. Konev, R. Kontchakov, F. Wolter & M. Zakharyaschev - 2006 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 299-318.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  29. Fusions of Modal Logics Revisited.Frank Wolter - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic, Volume 1. CSLI Publications. pp. 361-379.
    No categories
     
    Export citation  
     
    Bookmark   4 citations  
  30.  48
    Superintuitionistic Companions of Classical Modal Logics.Frank Wolter - 1997 - Studia Logica 58 (2):229-259.
    This paper investigates partitions of lattices of modal logics based on superintuitionistic logics which are defined by forming, for each superintuitionistic logic L and classical modal logic , the set L[] of L-companions of . Here L[] consists of those modal logics whose non-modal fragments coincide with L and which axiomatize if the law of excluded middle p V p is added. Questions addressed are, for instance, whether there exist logics with the disjunction property in L[], whether L[] contains a (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  31.  7
    Decidable Fragments of First-Order Modal Logics.Frank Wolter & Michael Zakharyaschev - 2001 - Journal of Symbolic Logic 66 (3):1415-1438.
    The paper considers the set $\mathscr{M}\mathscr{L}_1$ of first-order polymodal formulas the modal operators in which can be applied to subformulas of at most one free variable. Using a mosaic technique, we prove a general satisfiability criterion for formulas in $\mathscr{M}\mathscr{L}_1$, which reduces the modal satisfiability to the classical one. The criterion is then used to single out a number of new, in a sense optimal, decidable fragments of various modal predicate logics.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  32.  4
    Dynamic Topological Logics Over Spaces with Continuous Functions.B. Konev, R. Kontchakov, F. Wolter & M. Zakharyaschev - 2006 - In Guido Governatori, Ian Hodkinson & Yde Venema (eds.), Advances in Modal Logic, Volume 6. CSLI Publications. pp. 299-318.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  33.  22
    All Finitely Axiomatizable Tense Logics of Linear Time Flows Are CoNP-Complete.Tadeusz Litak & Frank Wolter - 2005 - Studia Logica 81 (2):153-165.
    We prove that all finitely axiomatizable tense logics with temporal operators for ‘always in the future’ and ‘always in the past’ and determined by linear fows time are coNP-complete. It follows, for example, that all tense logics containing a density axiom of the form ■n+1F p → nF p, for some n ≥ 0, are coNP-complete. Additionally, we prove coNP-completeness of all ∩-irreducible tense logics. As these classes of tense logics contain many Kripke incomplete bimodal logics, we obtain many natural (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  34.  10
    Properties of Tense Logics.Frank Wolter - 1996 - Mathematical Logic Quarterly 42 (1):481-500.
    Based on the results of [11] this paper delivers uniform algorithms for deciding whether a finitely axiomatizable tense logic has the finite model property, is complete with respect to Kripke semantics, is strongly complete with respect to Kripke semantics, is d-persistent, is r-persistent.It is also proved that a tense logic is strongly complete iff the corresponding variety of bimodal algebras is complex, and that a tense logic is d-persistent iff it is complete and its Kripke frames form a first order (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  35.  23
    A Logic for Metric and Topology.Frank Wolter & Michael Zakharyaschev - 2005 - Journal of Symbolic Logic 70 (3):795 - 828.
    We propose a logic for reasoning about metric spaces with the induced topologies. It combines the 'qualitative' interior and closure operators with 'quantitative' operators 'somewhere in the sphere of radius r.' including or excluding the boundary. We supply the logic with both the intended metric space semantics and a natural relational semantics, and show that the latter (i) provides finite partial representations of (in general) infinite metric models and (ii) reduces the standard '∈-definitions' of closure and interior to simple constraints (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  36.  28
    Axiomatizing Distance Logics.Oliver Kutz, Holger Sturm, Nobu-Yuki Suzuki, Frank Wolter & Michael Zakharyaschev - 2002 - Journal of Applied Non-Classical Logics 12 (3-4):425-439.
    In [STU 00, KUT 03] we introduced a family of ‘modal' languages intended for talking about distances. These languages are interpreted in ‘distance spaces' which satisfy some of the standard axioms of metric spaces. Among other things, we singled out decidable logics of distance spaces and proved expressive completeness results relating classical and modal languages. The aim of this paper is to axiomatize the modal fragments of the semantically defined distance logics of [KUT 03] and give a new proof of (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  37. De Rijke, M., 109 Di Maio, MC, 435 Doria, FA, 553 French, S., 603.E. M. Hammer, J. Hawthorne, M. Kracht, E. Martino, J. M. Mendez, R. K. Meyer, L. S. Moss, A. Tzouvaras, J. van Benthem & F. Wolter - 1998 - Journal of Philosophical Logic 27 (661).
  38. Advances in Modal Logic, Volume.F. Wolter, H. Wansing, M. de Rijke & M. Zakharyaschev - unknown
    We study a propositional bimodal logic consisting of two S4 modalities £ and [a], together with the interaction axiom scheme a £ϕ → £ aϕ. In the intended semantics, the plain £ is given the McKinsey-Tarski interpretation as the interior operator of a topology, while the labelled [a] is given the standard Kripke semantics using a reflexive and transitive binary relation a. The interaction axiom expresses the property that the Ra relation is lower semi-continuous with respect to the topology. The (...)
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  39. Dynamic Description Logics.Frank Wolter & Michael Zakharyaschev - 2000 - In Michael Zakharyaschev, Krister Segerberg, Maarten de Rijke & Heinrich Wansing (eds.), Advances in Modal Logic, Volume 2. CSLI Publications. pp. 449-463.
    No categories
     
    Export citation  
     
    Bookmark   2 citations  
  40. Fusions of Modal Logics Revisited.Frank Wolter - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 361-379.
    No categories
     
    Export citation  
     
    Bookmark   2 citations  
  41.  56
    First-Order Expressivity for S5-Models: Modal Vs. Two-Sorted Languages.Holger Sturm & Frank Wolter - 2001 - Journal of Philosophical Logic 30 (6):571-591.
    Standard models for model predicate logic consist of a Kripke frame whose worlds come equipped with relational structures. Both modal and two-sorted predicate logic are natural languages for speaking about such models. In this paper we compare their expressivity. We determine a fragment of the two-sorted language for which the modal language is expressively complete on S5-models. Decidable criteria for modal definability are presented.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  42.  27
    What is the Upper Part of the Lattice of Bimodal Logics?Frank Wolter - 1994 - Studia Logica 53 (2):235 - 241.
    We define an embedding from the lattice of extensions ofT into the lattice of extensions of the bimodal logic with two monomodal operators 1 and 2, whose 2-fragment isS5 and 1-fragment is the logic of a two-element chain. This embedding reflects the fmp, decidability, completenes and compactness. It follows that the lattice of extension of a bimodal logic can be rather complicated even if the monomodal fragments of the logic belong to the upper part of the lattice of monomodal logics.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  43.  1
    Islands of Tractability for Relational Constraints: Towards Dichotomy Results for the Description of Logic EL.Agi Kurucz, Frank Wolter & Michael Zakharyaschev - 2010 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 271-291.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  44. Logic-Based Ontology Comparison and Module Extraction, with an Application to DL-Lite.Roman Kontchakov, Frank Wolter & Michael Zakharyaschev - 2010 - Artificial Intelligence 174 (15):1093-1141.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  45.  81
    A Tableau Decision Algorithm for Modalized ALC with Constant Domains.Carsten Lutz, Holger Sturm, Frank Wolter & Michael Zakharyaschev - 2002 - Studia Logica 72 (2):199-232.
    The aim of this paper is to construct a tableau decision algorithm for the modal description logic K ALC with constant domains. More precisely, we present a tableau procedure that is capable of deciding, given an ALC-formula with extra modal operators (which are applied only to concepts and TBox axioms, but not to roles), whether is satisfiable in a model with constant domains and arbitrary accessibility relations. Tableau-based algorithms have been shown to be practical even for logics of rather high (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  46.  1
    Topology, Connectedness, and Modal Logic.Roman Kontchakov, Ian Pratt-Hartmann, Frank Wolter & Michael Zakharyaschev - 2008 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 151-176.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  47.  9
    Completeness and Decidability of Tense Logics Closely Related to Logics Above K4.Frank Wolter - 1997 - Journal of Symbolic Logic 62 (1):131-158.
    Tense logics formulated in the bimodal propositional language are investigated with respect to Kripke-completeness and decidability. It is proved that all minimal tense extensions of modal logics of finite width as well as all minimal tense extensions of cofinal subframe logics are complete. The decidability of all finitely axiomatizable minimal tense extensions of cofinal subframe logics is shown. A number of variations and extensions of these results are also presented.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  48.  43
    All Finitely Axiomatizable Subframe Logics Containing the Provability Logic CSM $_{0}$ Are Decidable.Frank Wolter - 1998 - Archive for Mathematical Logic 37 (3):167-182.
    In this paper we investigate those extensions of the bimodal provability logic ${\vec CSM}_{0}$ (alias ${\vec PRL}_{1}$ or ${\vec F}^{-})$ which are subframe logics, i.e. whose general frames are closed under a certain type of substructures. Most bimodal provability logics are in this class. The main result states that all finitely axiomatizable subframe logics containing ${\vec CSM}_{0}$ are decidable. We note that, as a rule, interesting systems in this class do not have the finite model property and are not even (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  49.  6
    First-Order Rewritability of Ontology-Mediated Queries in Linear Temporal Logic.Alessandro Artale, Roman Kontchakov, Alisa Kovtunova, Vladislav Ryzhikov, Frank Wolter & Michael Zakharyaschev - 2021 - Artificial Intelligence 299:103536.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  50. Advances in Modal Logic, Volume 4: Papers From the Fourth Aiml Conference, Held in Toulouse, October 2002.Philippe Balbiani, Nobu-Yuki Suzuki & Frank Wolter (eds.) - 2003 - London, England: King's College Publications.
1 — 50 / 70