Stéphane Demri  Home/Search
Context Related
| lsv.enscachan.fr/~d...TRregular.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lsv.enscachan.fr/~dem...index_gb (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A modal reduction principle of the form [i 1 ] : : : [i n ]p ) [j 1 ] : : : [j n 0 ]p can be viewed as a production rule i 1 : : : i n ! j 1 : : : j n 0 in a formal grammar. We study the extensions of the multimodal logic Km with m independent K modal connectives by finite addition of axiom schemes of the above form such that the associated finite set of production rules forms a regular grammar. We show that given a regular grammar G and a modal formula , deciding whether the formula is... (Update)
Context of citations to this paper: More
...new labels for modal operators. Such class includes grammar logic. These results were recently extended and generalized by Demri [14]. In particular in [14] it is shown that every regular grammar logics is decidable, where also more expressive logics including structured...
Cited by: More
Reasoning about Complex Actions with - Incomplete Knowledge Modal (2001) (Correct)
Active bibliography (related documents): More All
3.1: Deciding Regular Grammar Logics With Converse Through.. - Demri, de Nivelle (2003) (Correct)
1.8: A Polynomial Space Construction of Tree-Like Models for Logics.. - Demri (2002) (Correct)
0.8: Logic Programming: The Case of Description and Hybrid Logic - Areces (Correct)
Similar documents based on text: More All
0.8: Automata-Theoretic Decision Procedures for Information Logics - Demri, Sattler (2002) (Correct)
0.7: An Automata-Theoretic Approach to Constraint LTL - Demri, D'Souza (2002) (Correct)
0.5: BTL2 and expressive completeness for ECTL+ - Rabinovich, Schnoebelen (2000) (Correct)
BibTeX entry: (Update)
S. Demri. The Complexity of Regularity in Grammar Logics. J. of Logic and Computation, 2001. To appear, available at http://www.lsv.ens-cachan.fr/~demri/. http://citeseer.ist.psu.edu/article/demri01complexity.html More
@article{ demri01complexity,
author = "S. Demri",
title = "The Complexity of Regularity in Grammar Logics and Related Modal Logics",
journal = "Journal of Logic and Computation",
volume = "11",
number = "6",
pages = "933--960",
year = "2001",
url = "citeseer.ist.psu.edu/article/demri01complexity.html" }
Citations (may not include all citations):1911 Introduction to automata theory (context) - Hopcroft, Ullman - 1979
951 Computational Complexity (context) - Papadimitriou - 1994
362 Dynamic logic - Harel - 1984
362 Dynamic Logic - Harel, Kozen et al. - 2000
240 A guide to completeness and complexity for modal logics of k.. (context) - Halpern, Moses - 1992
197 The complexity of concept languages - Donini, Lenzerini et al. - 1997
195 Propositional dynamic logic of regular programs (context) - Fischer, Ladner - 1979
189 Parameterized complexity - Downey, Fellows - 1999
177 Temporal logic can be more expressive (context) - Wolper - 1983
176 A correspondence theory for terminological logics: prelimina.. - Schild - 1991
165 Theoretical Computer Science (context) - Kozen, the et al. - 1983
162 Automata-theoretic techniques for modal logics of programs (context) - Vardi, Wolper - 1986
131 The complexity of tree automata and logics of programs (context) - Emerson, Jutla - 1999
130 The computational complexity of provability in systems of mo.. (context) - Ladner - 1977
80 Finite automata (context) - Perrin - 1990
72 A description logic with transitive and inverse roles and ro.. - Horrocks, Sattler - 1999
68 Why is modal logic so robustly decidable - Vardi - 1997
62 An essay in combinatory dynamic logic (context) - Passy, Tinchev - 1991
59 Models of program logics (context) - Pratt - 1979
54 Complexity of Modal Logics (context) - Spaan - 1993
50 Complete problems for deterministic polynomial-time (context) - Jones, Laaser - 1976
45 Correspondence Theory (context) - van Benthem - 1984
40 Modal languages and bounded fragments of predicate logic (context) - Andreka, Nemeti et al. - 1998
40 the restraining power of guards - Gr, On - 1999
36 Expressive functional completeness in tense logic (context) - Gabbay - 1981
34 The two-variable guarded fragment with transitive relations - Ganzinger, Meyer et al. - 1999
31 Practical reasoning for very expressive description logics - Horrocks, Sattler et al. - 2000
31 Power and weakness of the modal display calculus - Kracht - 1996
30 Expressive ABox reasoning with number restrictions - Haarslev, oller - 2000
29 and covering problems for the regular and contextfree langua.. (context) - Hunt, Rosenkrantz et al. - 1976
22 Boosting the correspondence between description logics and p.. - de Giacomo, Lenzerini - 1994
21 Tools and Techniques in Modal Logic (context) - Kracht - 1999
19 Notre Dame Journal of Formal Logic (context) - Hemaspaandra, of - 1996
19 Nonmonotonic default modal logics (context) - Tiomkin, Kaminsky - 1991
17 Cornerstones of Undecidability (context) - Rozenberg, Salomaa - 1994
15 Complexity of terminological reasoning revisited - Lutz - 1999
15 Guarded xed point logic (context) - Gr, Walukiewicz - 1999
14 Reasoning about in nite computations (context) - Vardi, Wolper - 1994
14 Resolution-Based Decision Procedures for Subclasses of First.. (context) - Hustadt - 1999
13 Why are modal logics so robustly decidable (context) - Gr - 1999
11 Decidability of Class-Based Knowledge Representation Formali.. - de Giacomo - 1995
11 Propositional dynamic logic of nonregular programs - Harel, Pnueli et al. - 1983
10 A concept language extended with di erent kinds of transitiv.. (context) - Sattler - 1996
10 On regularity of context-free languages (context) - Ehrenfeucht, Haussler et al. - 1983
9 Gentzen-type and resolution rules part I: propositional logi.. (context) - Mints - 1988
9 A resolution decision procedure for the guarded fragment (context) - de Nivelle - 1998
9 Formal languages: an introduction and a synopsis (context) - Mateescu, Salomaa - 1997
9 A tableau calculus for multimodal logics and some (context) - Baldoni, Giordano et al. - 1998
9 Complexity transfer for modal logic (context) - Hemaspaandra - 1994
7 Single steps tableaux for modal logics (context) - Massacci - 2000
7 The complexity of propositional modal theories and the compl.. (context) - Chen, Lin - 1994
7 Modal deduction with applications in epistemic and temporal .. (context) - nas, Cerro et al. - 1995
7 Complexity measures for regular expressions (context) - Ehrenfeucht, Zeiger - 1976
7 Completeness and correspondence in the rst and second order .. (context) - Sahlqvist - 1975
6 Using graphs to understand PDL (context) - Pratt - 1981
6 Undecidability results on two-variable logics - Gr, Otto et al. - 1997
6 Deciding properties of nonregular programs (context) - Harel, Raz - 1993
6 Normal Multimodal Logics: Automated Deduction and Logic Prog.. (context) - Baldoni - 1998
5 Context-free languages (context) - Autebert, Berstel et al. - 1997
5 the completeness of the inductive assertion method (context) - de Bakker, Meertens - 1975
5 Subsumption in KL-ONE is undecidable (context) - Schmidt-Schauss - 1989
4 Optimised Modal Translation and Resolution - Schmidt - 1997
4 Logic Engineering: The Case of Description and Hybrid Logics (context) - Areces - 2000
4 The decision problem for combined (context) - Wolter - 1999
4 Les logiques multimodales (context) - Catach - 1989
3 Complexity of hybrid temporal logics (context) - Areces, Blackburn et al. - 2000
3 Modal logics with weak forms of recursion: PSPACE specimens (context) - Demri - 2001
3 ALCRA - ALC with role axioms (context) - Wessel, Haarslev et al. - 2000
3 nas del Cerro and M (context) - Fari - 1988
2 the existence of nite models and decision procedures for pro.. (context) - Harrop - 1958
2 A complete epistemic logic for multiple agents - combining d.. - van der Hoek, Meyer - 1997
2 Dynamic logic as a uniform framework for theorem proving in .. (context) - Tuominen - 1990
2 Attribute concept descriptions with complements (context) - Schmidt-Schauss, Smolka - 1991
2 Preprint available via httpturing (context) - de Rijke, Logic et al. - 2001
2 Program constructions that are safe for bisimulation (context) - van Benthem - 1998
2 Algorithmic aspects of propositional tense logics (context) - Chagrov, Shehtman - 1994
2 Representation of events in nerve nets (context) - Kleene - 1956
2 productions in context-free grammars (context) - Goldschlager - 1981
1 part III: the nite model property (context) - Zakharyaschev, for - 1997
1 eduction automatique en logique multi-modale par traduction (context) - Gasquet - 1994
1 Modal reduction principles (context) - van Benthem - 1976
1 Available via httpturing (context) - Modal, Two et al. - 1998
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC