Ulrike Sattler, Moshe Y. Vardi  Home/Search
Context
Related
| rice.edu/~vardi/papers/ijcar01.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: rice.edu/~vardi/papers/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present an ExpTime decision procedure for the full mh-Calculus (including convers programs) extended with nominals anf a universal program, tgus devising a new, highly epression ExpTime logic. The decision procedure is based on tree automata, and makes explicit the problems cause by nominals and how to overcome them. Roughy speaking, we show how to reason in a logic lacking the tree module property. The controbution of this paper is two-fold: we extend the family of ExpTime logics, and we... (Update)
Active bibliography (related documents): More All
0.9: An Overview of Tableau Algorithms for Description Logics - Baader, Sattler (2000) (Correct)
0.7: Unifying Class-Based Representation Formalisms - Calvanese, Lenzerini, Nardi (1999) (Correct)
0.5: The Complexity of the Graded µ-Calculus - Kupferman, Sattler, Vardi (Correct)
Similar documents based on text: More All
0.4: BDD-Based Decision Procedures for K - Pan, Sattler, Vardi (2002) (Correct)
0.3: The Complexity of Cardinality Restrictions - Tobies (2000) (Correct)
0.3: BDD-Based Decision Procedures for the Modal Logic K - Pan, Sattler, Vardi (2005) (Correct)
BibTeX entry: (Update)
@article{ sattler01hybrid,
author = "Ulrike Sattler and Moshe Y. Vardi",
title = "The Hybrid {$\mu$}-Calculus",
journal = "Lecture Notes in Computer Science",
volume = "2083",
pages = "76--??",
year = "2001",
url = "citeseer.ist.psu.edu/sattler01hybrid.html" }
Citations (may not include all citations):207 Attributive concept descriptions with complements (context) - Schmidt-Schau, Smolka - 1991
197 The complexity of concept languages - Donini, Lenzerini et al. - 1991
197 The complexity of concept languages - Donini, Lenzerini et al. - 1997
193 Reasoning and Revision in Hybrid Representation Systems (context) - Nebel - 1990
176 A correspondence theory for terminological logics: Prelimina.. - Schild - 1991
131 and logic (context) - Thomas, automata - 1997
118 Using an Expressive Description Logic: FaCT or Fiction - Horrocks - 1998
97 Description logic framework for information integration - Calvanese, De Giacomo et al. - 1998
94 Expressiveness and tractability in knowledge representation .. (context) - Levesque, Brachman - 1987
92 Present and Future (context) - Prior - 1967
89 Description logics for conceptual data modeling - Calvanese, Lenzerini et al. - 1998
86 A terminological knowledge representation system with comple.. - Baader, Hollunder - 1991
84 Another look at LTL model checking - Clarke, Grumberg et al. - 1994
60 An automata theoretic decision procedure for the proposition.. (context) - Streett, Emerson - 1989
56 van Harmelen (context) - Fensel, Horrocks - 2000
56 Reasoning about the past with two-way automata - Vardi - 1998
47 Nominal tense logic (context) - Blackburn - 1993
43 The spin model checker (context) - Holzmann - 1997
31 Practical reasoning for very expressive description logics - Horrocks, Sattler et al. - 2000
30 Expressive abox reasoning with number restrictions - Haarslev, oller - 2000
23 Tbox and Abox reasoning in expressive description logics (context) - De Giacomo, Lenzerini - 1996
22 Boosting the correspondence between description logics and p.. - De Giacomo, Lenzerini - 1994
20 A data warehouse conceptual data model for multidimensional .. - Franconi, Sattler - 1999
19 Weak alternating automata and tree automata emptiness - Kupferman, Vardi - 1998
15 on and C. S. Jutla. Tree automata, -calculus, and determina.. (context) - Emers - 1991
13 On model checking for fragments of the -calculus (context) - Emerson, Jutla et al. - 1993
13 The complexity of reasoning with cardinality restrictions an.. - Tobies - 2000
12 The computational complexity of hybrid temporal logics - Areces, Blackburn et al. - 2000
11 Reasoning in expressive description logics with xpoints base.. (context) - Calvanese, De Giacomo et al. - 1999
11 Results on the propositional -calculus (context) - Kozen - 1982
11 re-usable medical ontology using a description logic with tr.. (context) - Rector, Horrocks et al. - 1997
8 What makes modal logic so robustly decidable (context) - Vardi - 1997
7 Alternating automata on innite trees (context) - Muller, Schupp - 1987
6 Terminological cycles and the propositional -calculus (context) - Schild - 1994
6 PSPACE reasoning for graded modal logics - Tobies - 2001
5 calculus synthesis - Kupferman, Vardi - 2000
2 DLP and FaCT (context) - Patel-Schneider, Horrocks - 1999
2 Concept language with number restrictions and xpoints (context) - De Giacomo, Lenzerini - 1994
1 Ecient local model-checking for fragments of the modal -cal.. (context) - Bhat, Cleaveland - 1996
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