| Alternate document: Details An Automata-Theoretic Approach to Constraint LTL (02) Stéphane Demri, Deepak D'Souza |
Stéphane Demri, Ulrike Sattler  Home/Search
Context
Related
| lsv.enscachan.fr/Publi...dsfund02.ps 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....lisy32002.php (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Automata-theoretic decision procedures for solving model-checking and satisfiability problems for temporal, dynamic, and description logics have ourished during the past decades. In the paper we define an ExpTime decision procedure based on the emptiness problem of Büchi automata on infinite trees for the very expressive information logic SIM designed for reasoning about information systems. This logic involves modal parameters satisfying certain properties to capture the relevant properties of ... (Update)
Active bibliography (related documents): More All
1.1: Display Calculi for Logics with Relative Accessibility.. - Demri, Goré (1998) (Correct)
0.8: Informational representability of models for information.. - Demri, Orlowska (1996) (Correct)
0.6: A Hierarchy of Modal Logics With Relative Accessibility.. - Balbiani, Orlowska (1998) (Correct)
Similar documents based on text: More All
0.8: An Automata-Theoretic Approach to Constraint LTL - Demri, D'Souza (2002) (Correct)
0.8: The Complexity of Regularity in Grammar Logics - Demri (2001) (Correct)
0.7: Safe programming of PLC using formal verification methods - De Smet, Couffin.. (2000) (Correct)
BibTeX entry: (Update)
@misc{ demri-automatatheoretic,
author = "St\'ephane Demri and Ulrike Sattler",
title = "Automata-Theoretic Decision Procedures for Information Logics",
url = "citeseer.ist.psu.edu/demri02automatatheoretic.html" }
Citations (may not include all citations):951 Computational Complexity (context) - Papadimitriou - 1994
241 Decidability of second-order theories and automata on in nit.. (context) - Rabin - 1969
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
131 The complexity of tree automata and logics of programs (context) - Emerson, Jutla - 1988
86 An automata-theoretic approach to branching-time model check.. - Kupferman, Vardi et al. - 2000
60 An automata theoretic decision procedure for the proposition.. (context) - Streett, Emerson - 1989
56 Reasoning about past with two-way automata - Vardi - 1998
54 Complexity of Modal Logics (context) - Spaan - 1993
34 Automata on in nite objects (context) - Thomas - 1990
29 a decision method in restricted second-order arithmetic (context) - uchi - 1962
27 Internalizing labelled deduction - Blackburn - 2000
24 The complexity of reasoning with Boolean modal logics - Lutz, Sattler - 2001
22 A note on Boolean modal logic (context) - Gargov, Passy - 1990
22 A logic for reasoning about relative similarity (context) - Konikowska - 1997
20 Information systems theoretical foundations (context) - Pawlak - 1981
19 Notre Dame Journal of Formal Logic (context) - Hemaspaandra, of - 1996
19 and relational structures: a hybrid logic manifesto (context) - Blackburn, reasoning - 2000
14 Reasoning about in nite computations (context) - Vardi, Wolper - 1994
13 Sequent calculi for nominal tense logics: a step towards mec.. - Demri - 1999
13 Why are modal logics so robustly decidable (context) - Gr - 1999
12 the decision problem for twovariable rst-order logic (context) - Gr, Ph et al. - 1997
11 Theoretical Computer Science (context) - Emerson, Jutla et al. - 2001
11 Reasoning in expressive description logics with xpoints base.. (context) - Calvanese, De Giacomo et al. - 1999
10 Incomplete Information: Rough Set Analysis (context) - lowska - 1998
9 Alternating automata: unifying truth and validity checking f.. (context) - Vardi - 1997
8 Modal logics for knowledge representation systems (context) - Vakarelov - 1991
8 A logic for reasoning about similarity (context) - Konikowska - 1998
8 The hybrid mu-calculus (context) - Sattler, Vardi - 2001
7 The complexity of propositional modal theories and the compl.. (context) - Chen, Lin - 1994
7 Weakly de nable relations and special automata (context) - Rabin - 1970
6 The complexity of the graded -calculus (context) - Kupferman, Sattler et al. - 2002
5 Tableau calculi for hybrid logics (context) - Tzakova - 1999
5 Incomplete Information: Structure (context) - Demri, Orlowska - 2002
4 Abstract characterization of some knowledge representation s.. (context) - Vakarelov - 1987
4 Relative similarity logics are decidable: reduction to FO wi.. (context) - Demri, Konikowska - 1998
2 Description logics: Foundations for class-based knowledge re.. - Calvanese, De Giacomo et al. - 2002
2 Expressive power of knowledge representation system (context) - lowska, Pawlak - 1981
2 A logic with relative knowledge operators (context) - Demri - 1999
2 Internalization: the case of hybrid logics - Seligman - 2001
2 similarity and modal logics (context) - Vakarelov - 1998
1 Improved reductions of the Entscheidungsproblem to subclasse.. (context) - Kahr - 1962
1 Studies in Fuzziness and Soft Computing (context) - Polkowski, Skowron et al. - 1998
1 On modal logics characterized by models with relative access.. (context) - Demri, Gabbay - 2000
1 IEEE Transations on Software Engineering (context) - Holzmann, checker - 1997
1 Modal logics with relative accessibility relations (context) - Balbiani - 1996
1 Rough relations and logics (context) - Stepaniuk - 1998
Documents on the same site (http://www.lsv.ens-cachan.fr/Publis/publis-y3-2002.php): More
On Verifying Fair Lossy Channel Systems - Masson, Schnoebelen (2002) (Correct)
Temporal Logic with Forgettable Past - Laroussinie, Markey, Schnoebelen (2002) (Correct)
Analysing the PGM Protocol with UPPAAL - Bérard, Bouyer, Petit (2002) (Correct)
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