See this document in CiteSeerX!

Tableau Algorithms for Description Logics (2000)  (Make Corrections)  (12 citations)
Franz Baader, Ulrike Sattler
Proceedings of the International Conference on Automated Reasoning with Tableaux and Related Methods (Tableaux 2000)



  Home/Search   Context   Related

 
View or download:
lti.informatik.rwt...ableaux2000.ps.gz
unikoblenz.de/fb4/publik...A_Baader.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  lti.informatik.rwthaach...Papers (more)
(Enter author homepages)

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

Abstract: . Description logics are a family of knowledge representation formalisms that are descended from semantic networks and frames via the system Kl-one. During the last decade, it has been shown that the important reasoning problems (like subsumption and satisfiability) in a great variety of description logics can be decided using tableaulike algorithms. This is not very surprising since description logics have turned out to be closely related to propositional modal logics and logics of... (Update)

Context of citations to this paper:   More

...will now be described in detail. Please note that, due to the absence of inverse roles, subset blocking is sufficient (see also [Baader and Sattler, 2000]) to ensure termination and correctness. Definition 4 Let R be a role box, D a SHOQ(D) concept in NNF, R D A the set of...

...we encounter a node which is similar to an already existing one, then this node does not need to be further explored. Speaking in terms of [33, 10], we employ a mechanism called subset blocking. Definition 46 (Blocked) Let be the reflexive closure of #. V a is blocked by a...

Cited by:   More
A Defeasible Ontology Language - Heymans And Vermeir (2002)   (Correct)
Keys, Nominals, and Concrete Domains - Lutz, Areces, Horrocks, Sattler (2002)   (Correct)
Ontology Reasoning in the SHOQ(D) Description Logic - Horrocks, Sattler (2001)   (Correct)

Similar documents (at the sentence level):
64.7%:   An Overview of Tableau Algorithms for Description Logics - Baader, Sattler (2000)   (Correct)
7.0%:   Basic Description Logics - Baader, Nutt (2003)   (Correct)

Active bibliography (related documents):   More   All
0.4:   Logic Programming: The Case of Description and Hybrid Logic - Areces   (Correct)
0.4:   Description Logics as Ontology Languages for the Semantic Web - Baader, Horrocks, Sattler (2003)   (Correct)
0.4:   Logic-based Knowledge Representation - Baader (1997)   (Correct)

Similar documents based on text:   More   All
0.2:   Description Logics with Aggregates and Concrete Domains, Part II - Baader, Sattler (1998)   (Correct)
0.2:   Unification of Concept Terms in Description Logics - Baader, Narendran (1998)   (Correct)
0.2:   Description Logics with Symbolic Number Restrictions - Baader, Sattler (1996)   (Correct)

Related documents from co-citation:   More   All
8:   Practical reasoning for expressive description logics - Horrocks, Sattler et al. - 1999
6:   A scheme for integrating concrete domains into concept languages - Baader, Hanschke - 1991
5:   Interval-based temporal reasoning with general tboxes - Lutz - 2000

BibTeX entry:   (Update)

F. Baader and U. Sattler. Tableau algorithms for description logics. In R. Dyckhoff, editor, Proceedings of Tableaux 2000, vol. 1847 of LNAI, pages 1--18, Springer, 2000. http://citeseer.ist.psu.edu/baader00tableau.html   More

@inproceedings{ baader00tableau,
    author = "F. Baader and U. Sattler",
    title = "Tableau Algorithms for Description Logics",
    booktitle = "Proceedings of the International Conference on Automated Reasoning with Tableaux and Related Methods (Tableaux 2000)",
    volume = "1847",
    publisher = "Springer-Verlag",
    address = "St Andrews, Scotland, UK",
    editor = "R.~Dyckhoff",
    pages = "1--18",
    year = "2000",
    url = "citeseer.ist.psu.edu/baader00tableau.html" }
Citations (may not include all citations):
480   An overview of the KL-ONE knowledge representation system (context) - Brachman, Schmolze - 1985
304   A framework for representing knowledge (context) - Minsky - 1981
197   The complexity of concept languages - Donini, Lenzerini et al. - 1991
193   Reasoning and Revision in Hybrid Representation Systems (context) - Nebel - 1990
176   A correspondence theory for terminological logics: Prelimina.. - Schild - 1991
152   Decidable reasoning in terminological knowledge representati.. - Buchheit, Donini et al. - 1993
148   Practical reasoning for expressive description logics - Horrocks, Sattler et al. - 1999
132   Relationship between nondeterministic and deterministic tape.. (context) - Savitch - 1970
118   Using an expressive description logic: FaCT or fiction - Horrocks - 1998
118   The tractability of subsumption in frame-based description l.. (context) - Brachman, Levesque - 1984
116   A semantics and complete algorithm for subsumption in the CL.. - Borgida, Patel-Schneider - 1994
112   Terminological reasoning is inherently intractable - Nebel - 1990
107   Readings in Knowledge Representation (context) - Brachman, Levesque - 1985
89   Terminological cycles: Semantics and computational propertie.. - Nebel - 1991
88   Subsumption algorithms for concept description languages - Hollunder, Nutt et al. - 1990
86   A terminological knowledge representation system with comple.. - Baader, Hollunder - 1991
85   Augmenting concept languages by transitive closure of roles:.. - Baader - 1991
77   Tractable concept languages (context) - Donini, Lenzerini et al. - 1991
75   Attributive concept descriptions with complements (context) - Schmidt-Schau, Smolka - 1991
72   A description logic with transitive and inverse roles and ro.. - Horrocks, Sattler - 1999
69   Subsumption in KL-ONE is undecidable (context) - Schmidt-Schau - 1989
57   Qualifying number restrictions in concept languages (context) - Hollunder, Baader - 1991
56   The complexity of existential quantification in concept lang.. - Donini, Hollunder et al. - 1992
51   TBox and ABox reasoning in expressive description logics - De Giacomo, Lenzerini - 1996
49   Subsumption algorithms for concept languages - Hollunder, Nutt - 1990
45   The FaCT system - Horrocks - 1998
44   Boosting the correspondence between description logics and p.. - De Giacomo, Lenzerini - 1994
40   The CLASSIC knowledge representation system: Guiding princip.. (context) - Patel-Schneider, McGuiness et al. - 1991
40   The evolving technology of classification-based knowledge re.. (context) - MacGregor - 1991
39   A schema for integrating concrete domains into concept langu.. (context) - Baader, Hanschke - 1991
36   Cardinality restrictions on concepts - Baader, Buchheit et al. - 1996
34   La Sapienza (context) - De Giacomo, Class-Based et al. - 1995
32   The BACK system -- an overview (context) - Peltason - 1991
31   the expressivity of feature logics with negation (context) - Baader, Burckert et al. - 1993
31   A concept language extended with different kinds of transiti.. - Sattler - 1996
29   Hybrid inferences in KL-ONE-based knowledge representation s.. (context) - Hollunder - 1990
22   CLASSIC to practice: Knowledge representation meets reality (context) - Brachman - 1992
22   Optimizing description logic subsumption - Horrocks, Patel-Schneider - 1999
22   Concept language with number restrictions and fixpoints - De Giacomo, Lenzerini - 1994
21   REP system overview (context) - Mays, Dionne et al. - 1991
19   Specifying role interaction in concept languages (context) - Hanschke - 1992
17   An empirical analysis of optimization techniques for termino.. (context) - Baader, Hollunder et al. - 1992
17   A PSPACE algorithm for graded modal logic - Tobies - 1999
15   Complexity of terminological reasoning revisited - Lutz - 1999
15   Expressive number restrictions in description logics - Baader, Sattler - 1999
13   La Sapienza (context) - Bresciani, Franconi et al. - 1995
13   of Logic and Computation (context) - Van der Hoek, De Rijke - 1995
11   Terminological cycles and the propositional -calculus (context) - Schild - 1994
10   The complexity of propositional tense logics (context) - Spaan - 1993
9   Tableaux and algorithms for propositional dynamic logic with.. - De Giacomo, Massacci - 1996
6   Consistency checking reduced to satisfiability of concepts i.. (context) - Hollunder - 1996
4   Patel-Schneider (context) - Peter - 1999
3   Word concepts: A theory and simulation of some basic capabil.. (context) - Quillian - 1967



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html):   More
Unification Theory - Baader, Snyder (1999)   (Correct)
Planning Mathematical Proofs with Methods - Huang, Kerber, Richts, Sehn (1994)   (Correct)
KEIM: A Toolkit for Automated Deduction - Huang, Kerber, Kohlhase, Melis..   (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