Piero A. Bonatti, Carsten Lutz, Aniello Murano, Moshe Y. Vardi  Home/Search
Context
Related
| people.na.infn.it/...ucalculifinal.pdf 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: people.na.infn.it...pubblicazioni (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The fully enriched -calculus is the extension of the propositional -calculus with inverse programs, graded modalities, and nominals. While satisfiability in several expressive fragments of the fully enriched -calculus is known to be decidable and EXPTIME-complete, it has recently been proved that the full calculus is undecidable. In this paper, we study the fragments of the fully enriched -calculus that are obtained by dropping at least one of the additional constructs. (Update)
Similar documents (at the sentence level):
5.7%: The Complexity of Enriched -Calculi - Piero Bonatti Carsten (Correct)
Active bibliography (related documents): More All
0.3: Reasoning about The Past with Two-Way Automata - Vardi (1998) (Correct)
0.3: Automata-Theoretic Decision Procedures for Information Logics - Demri, Sattler (2002) (Correct)
0.2: Automata-Theoretic Techniques for Temporal Reasoning - Vardi (2006) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ bonatti-complexity,
author = "Piero A. Bonatti and Carsten Lutz and Aniello Murano and Moshe Y. Vardi",
title = "The Complexity of Enriched μ-Calculi",
url = "citeseer.ist.psu.edu/746847.html" }
Citations (may not include all citations):374 Automata on Infinite Objects (context) - Thomas - 1990
195 Propositional dynamic logic of regular programs (context) - Fischer, Ladner - 1979
190 Results on the propositional -calculus (context) - Kozen - 1983
131 and logic (context) - Thomas, automata - 1997
103 The Description Logic Handbook: Theory (context) - Baader, McGuiness et al. - 2003
86 An automata-theoretic approach to branching-time model check.. - Kupferman, Vardi et al. - 2000
58 Alternating automata on infinite trees (context) - Muller, Schupp - 1987
56 Reasoning about the Past with Two-Way Automata - Vardi - 1998
27 Efficient local model-checking for fragments of the modal mu.. - Bhat, Cleaveland - 1996
20 Complexity of automata on infinite objects - Safra - 1989
18 Reasoning in expressive description logics with fixpoints ba.. - Calvanese, De Giacomo et al. - 1999
8 The hybrid mu-calculus (context) - Sattler, Vardi - 2001
7 Description logics for the semantic web - Baader, Horrocks et al. - 2002
6 The complexity of the Graded -calculus (context) - Kupferman, Sattler et al. - 2002
3 Information and Computation (context) - Jutla, memoryless - 1997
2 the undecidability of logics with converse (context) - Bonatti, Peron - 2004
2 Institute for Theoretical Computer Science (context) - Bonatti, Lutz et al. - 2006
Documents on the same site (http://people.na.infn.it/~murano/pubblicazioni.html): More
Optimal-Reachability and Control for Acyclic Weighted.. - Torre, Mukhopadhyay.. (2002) (Correct)
Automata-theoretic Decision of Timed Games - Marco Faella Salvatore (2002) (Correct)
Typeness for ω-Regular Automata - Kupferman, Morgenstern, Murano (2004) (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