See this document in CiteSeerX!

Why Is Modal Logic So Robustly Decidable? (1997)  (Make Corrections)  (4 citations)
Moshe Y. Vardi



  Home/Search   Context   Related

 
View or download:
rice.edu/~vardi/papers...dimacs96.ps.gz
Cached:  PDF   PS.gz  PS  Image  Update  Help

From:  rice.edu/~vardi/papers/index (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: this paper. References (Update)


Similar documents based on text:   More   All
0.3:   BDD-Based Decision Procedures for K - Pan, Sattler, Vardi (2002)   (Correct)
0.2:   Optimizing a BDD-based Modal Solver - Pan, Vardi   (Correct)
0.2:   Weak Alternating Automata Are Not That Weak - Kupferman, Vardi (1997)   (Correct)

Related documents from co-citation:   More   All
2:   An automatatheoretic approach to branching-time model checking - Bernholtz, Vardi et al. - 1994
2:   Design and Synthesis of Synchronization Skeletons using Branching-Time Temporal .. (context) - Clarke, Emerson - 1981
2:   Modal logic and classical logic (context) - Van Benthem - 1983

BibTeX entry:   (Update)

M.Y. Vardi, "Why is Modal Logic So Robustly Decidable?"in Descriptive Complexity and Finite Models, N. Immerman and Ph. Kolaitis, eds., 1997, American Mathematical Society. http://citeseer.ist.psu.edu/vardi97why.html   More

@techreport{ vardi97why,
    author = "Moshe Y. Vardi",
    title = "Why Is Modal Logic So Robustly Decidable?",
    number = "TR97-274",
    month = "12,",
    pages = "24",
    year = "1997",
    url = "citeseer.ist.psu.edu/vardi97why.html" }
Citations (may not include all citations):
1180   The Temporal Logic of Reactive and Concurrent Systems: Speci.. (context) - Manna, Pnueli - 1992
1097   Automatic verification of finitestate concurrent systems usi.. (context) - Clarke, Emerson et al. - 1986
663   Some philosophical problems from the standpoint of artificia.. (context) - McCarthy, Hayes - 1969
604   Reasoning about Knowledge (context) - Fagin, Halpern et al. - 1995
539   The temporal logic of programs (context) - Pnueli - 1977
502   Concurrency and automata on infinite sequences (context) - Park - 1981
434   An automata-theoretic approach to automatic program verifica.. (context) - Vardi, Wolper - 1986
397   Design and synthesis of synchronization skeletons using bran.. (context) - Clarke, Emerson - 1981
357   Algebraic laws for nondeterminism and concurrency (context) - Hennessy, Milner - 1985
264   Knowledge and common knowledge in a distributed environment - Halpern, Moses - 1990
241   Decidability of second-order theories and automata on infini.. (context) - Rabin - 1969
240   A guide to completeness and complexity for modal logics of k.. (context) - Halpern, Moses - 1992
232   Optimal implementation of conjunctive queries in relational .. (context) - Chandra, Merlin - 1977
221   Specification and verification of concurrent systems in CESA.. (context) - Queille, Sifakis - 1982
203   An Introduction to Modal Logic (context) - Hughes, Cresswell - 1968
198   Structure and complexity of relational queries - Chandra, Harel - 1982
195   Propositional dynamic logic of regular programs (context) - Fischer, Ladner - 1979
195   Propositional dynamic logic of regular programs (context) - Fischer, Ladner - 1979
194   Knowledge and Belief (context) - Hintikka - 1962
165   Theoretical Computer Science (context) - Kozen, the et al. - 1983
131   The complexity of tree automata and logics of programs (context) - Emerson, Jutla - 1988
130   The computational complexity of provability in systems of mo.. (context) - Ladner - 1977
127   An automata-theoretic approach to branching-time model check.. - Bernholtz, Vardi et al. - 1994
126   Semantical considerations on Floyd-Hoare logic - Pratt - 1976
120   Handbook of theoretical computer science (context) - Emerson, modal - 1990
113   Cambridge University Press (context) - Chellas - 1980
106   A linear-time model-checking algorithm for the alternationfr.. - Cleaveland - 1993
102   Verification tools for finite-state concurrent systems - Clarke, Grumberg et al. - 1993
102   Formal verification of parallel programs (context) - Keller - 1976
100   The complexity of reasoning about knowledge and time - Halpern, Vardi - 1989
85   Upper and lower bounds for first-order expressibility (context) - Immerman - 1982
84   Decision procedures and expressiveness in the temporal logic.. (context) - Emerson, Halpern - 1985
65   Modal Logic and Classical Logic (context) - van Benthem - 1985
58   Characterizing correctness properties of parallel programs u.. (context) - Emerson, Clarke - 1980
57   Propositional dynamic logic of looping and converse (context) - Streett - 1982
47   the complexity of bounded-variable queries (context) - Vardi - 1995
45   Quantification in modal logic (context) - Garson - 1977
43   Zeitschrift fur Mathematische Logik und Grundlagen der Mathe.. (context) - Fagin, spectra - 1975
42   On language with two variables (context) - Mortimer - 1975
42   A completeness theorem in modal logic (context) - Kripke - 1959
40   The Decision Problem: Solvable Classes of Quantificational F.. (context) - Dreben, Goldfarb - 1979
36   Expressive functional completeness in tense logic (context) - Gabbay - 1971
36   Weakly definable relations and special automata (context) - Rabin - 1970
34   is sometimes (context) - Lamport - 1980
33   A decision method for validity of sentences in two variables (context) - Scott - 1962
31   Meaning and Necessity (context) - Carnap - 1947
29   Weak monadic second order theory of successor is not element.. (context) - Meyer - 1975
28   The logic of distributed protocols (context) - Ladner, Reif - 1986
27   Unsolvable Classes of Quantificational Formulas (context) - Lewis - 1979
25   Protocol engineering (context) - Liu - 1989
23   Model checking and transitive closure logic - Immerman, Vardi - 1996
20   On model-checking for fragments of ¯-calculus (context) - Emerson, Jutla et al. - 1993
17   Back and forth between modal logic and classical logic (context) - Andrika, van Benthem et al. - 1995
16   Hardware specification with temporal logic: an example (context) - Bochmann - 1982
14   Network protocols and tools to help produce them (context) - Rudin - 1987
12   the complexity of epistemic reasoning (context) - Vardi - 1989
12   A temporal framework for database specification (context) - Castilho, Casanova et al. - 1982
12   Undecidability results for two-variable logics (context) - Gradel, Otto et al. - 1996
11   A decision procedure for the propositional mu- calculus (context) - Kozen, Parikh - 1984
11   Knowledge as a tool in motion planning under uncertainty - Brafman, Latombe et al. - 1994
9   Symbolic Logic (context) - Lewis, Langford - 1959
9   University of Amsterdam (context) - van Benthem, Report et al. - 1991
8   Communication and Concurrecny (context) - Milner - 1989
7   The computational complexity of the unconstrained limited do.. (context) - Furer - 1981
6   Stockholm Studies in Philosophy (context) - Kanger, Logic - 1957
5   Efficient model checking in fragments of the proposoitional .. (context) - Emerson, Lei - 1986
4   The decision problem for 2variable first-order logic (context) - Gradel, Kolaitis et al. - 1996
4   Authetication: a practical study in belief and action (context) - Burrows, Abadi et al. - 1988
4   Ein spezialfall des entscheidungsproblem der theoretischen l.. (context) - Godel - 1932
4   the logic of incomplete information (context) - Lipski - 1977
3   Decidability results in non-classical logics (context) - Gabbay - 1975
3   A multiprocessor network logic with temporal and spatial mod.. (context) - Reif, Sistla - 1983
3   The Godel class with equality is unsolvable (context) - Goldfarb - 1984
3   Checking the finite-state concurrent programs satisfy their .. (context) - Lichtenstein, Pnueli - 1985
2   Modalities and quantification (context) - Carnap - 1946
2   Untersuchungen zum entscheidungsproblem der mathematischen l.. (context) - Schutte - 1934
2   An elementary decision procedure for the mu-calculus (context) - Street, Emerson - 1984
1   Commentationes Humanarum Literarum (context) - Hintikka, deontic et al. - 1957
1   physical necessity (context) - Montague - 1960
1   Model checking and the ¯-calculus (context) - Emerson - 1996
1   La correction de la logique modale du premier et second ordr.. (context) - Bayart - 1958
1   Modalities and quantification (context) - Hintikka - 1961
1   Uber die erfullbarkeit derjenigen zalhausdrucke (context) - Kalm'ar - 1933
1   A survey of decidability results for modal tense and interme.. (context) - Gabbay - 1973
1   property calculus (context) - Meredith, different et al. - 1956
1   idea attributed to P (context) - Prior - 1962
1   Some correspondence results in modal logic (context) - van Benthem - 1974

Documents on the same site (http://www.cs.rice.edu/~vardi/papers/index.html):   More
An Operational Semantics for Knowledge Bases - Fagin, Halpern, al. (1994)   (Correct)
Nontraditional Applications of Automata Theory - Vardi (1994)   (Correct)
Synthesis with Incomplete Information - Kupferman, Vardi (1997)   (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