(Enter summary)
Abstract: Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Expressive role constructors are important in many applications, but can be computationally problematical. We present an algorithm that decides satisfiability of the DL ALC extended with transitive and inverse roles, role hierarchies, and functional restrictions; early experiments indicate that this algorithm is well-suited for... (Update)
Cited by: More
Reasoning about Semantic Web in Isabelle/HOL - Yue Tang School
(Correct)
Verifying DAML+OIL and Beyond in Z/EVES - Jin Song Dong
(Correct)
OWL DL vs. OWL Flight: Conceptual Modeling and.. - de Bruijn, Lara.. (2005)
(Correct)
Similar documents (at the sentence level): More
76.1%: Practical Reasoning for Very Expressive Description Logics - Horrocks, Sattler, Tobies (2000)
(Correct)
75.9%: Logic Journal - Of The Editor-In-Chief
(Correct)
41.9%: Logic Journal of the IGPL 8:3 - Areces, Franconi, Goré, de.. (2000)
(Correct)
Active bibliography (related documents): More All
0.8: Evaluating Optimised Decision Procedures for.. - Horrocks.. (1999)
(Correct)
0.6: FaCT and iFaCT - Horrocks
(Correct)
0.3: A Description Logic with Transitive and Inverse Roles and.. - Horrocks, Sattler (1998)
(Correct)
Similar documents based on text: More All
0.8: Decidability of SHIQ with Complex Role Inclusion Axioms - Horrocks (2003)
(Correct)
0.8: Optimised Reasoning for SHIQ - Horrocks, Sattler (2001)
(Correct)
0.6: Adding Numbers to the SHIQ Description Logic - First Results - Lutz (2002)
(Correct)
Related documents from co-citation: More All
9: RACER system description
- Haarslev, Moller - 2001
8: Attributive concept descriptions with complements (context) - ss, Smolka - 1991
7: Reducing OWL entailment to description logic satisfiability
- Horrocks, Patel-Schneider - 2003
BibTeX entry: (Update)
I. Horrocks, U. Sattler, and S. Tobies. Practical reasoning for very expressive description logics. Logic Journal of the IGPL, 8(3):239{ 264, May 2000. http://citeseer.ist.psu.edu/article/horrocks00practical.html More
@article{ horrocks00practical,
author = "I. Horrocks and U. Sattler and S. Tobies",
title = "Practical Reasoning for Very Expressive Description Logics",
journal = "Logic Journal of the IGPL",
volume = "8",
number = "3",
pages = "239--264",
year = "2000",
url = "citeseer.ist.psu.edu/article/horrocks00practical.html" }
Citations (may not include all citations):
390
A machine program for theorem proving (context) - Davis, Logemann et al. - 1962
195
Propositional dynamic logic of regular programs (context) - Fischer, Ladner - 1979
180
Reasoning in description logics
- Donini, Lenzerini et al. - 1996
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
92
Building decision procedures for modal logics from propositi..
- Giunchiglia, Sebastiani - 1996
88
Subsumption algorithms for concept description languages
- Hollunder, Nutt et al. - 1990
85
Augmenting concept languages by transitive closure of roles:..
- Baader - 1990
72
A description logic with transitive and inverse roles and ro..
- Horrocks, Sattler - 1999
57
Optimising Tableaux Decision Procedures for Description Logi.. (context) - Horrocks - 1997
57
Qualifying number restrictions in concept languages (context) - Hollunder, Baader - 1991
51
Tbox and Abox reasoning in expressive description logics
- De Giacomo, Lenzerini - 1996
50
FaCT and iFaCT
- Horrocks - 1999
49
HARP: A tableau-based theorem prover (context) - Oppacher, Suen - 1988
45
The FaCT system
- Horrocks - 1998
42
A benchmark method for the propositional modal logics K (context) - Heuerding, Schwendimann - 1996
41
What's in an aggregate: Foundations for description logics w..
- De Giacomo, Lenzerini - 1995
38
Goals for concept representation in the Galen project
- Rector, Nowlan et al. - 1993
38
Optimising description logic subsumption
- Horrocks, Patel-Schneider - 1999
36
Intelligent Backtracking on Constraint Satisfaction Problems..
- Baker - 1995
36
Cardinality restrictions on concepts
- Baader, Buchheit et al. - 1996
34
Using an expressive description logic: FaCT or ction
- Horrocks - 1998
31
Source integration in data warehousing
- Calvanese, De Giacomo et al. - 1998
31
DLP system description (context) - Patel-Schneider - 1998
31
the expressivity of feature logics with negation (context) - Baader, urckert et al. - 1993
27
The undecidability of the dominoe problem (context) - Berger - 1966
24
Combining deduction and model checking into tableaux and alg.. (context) - De Giacomo, Massacci - 1999
18
Improvements to propositional satisability search algorithms (context) - Freeman - 1995
17
Hard random 3-SAT problems and the Davis-Putnam procedure (context) - Freeman - 1996
16
Comparing subsumption optimizations
- Horrocks, Patel-Schneider - 1998
15
RACE system description
- Haarslev, oller - 1999
13
Description logics with inverse roles (context) - De Giacomo, Lenzerini - 1994
11
Collected Papers from the International Description Logics W.. (context) - Franconi, De Giacomo et al. - 1998
10
A concept language extended with dierent kinds of transitiv.. (context) - Sattler - 1996
9
A unied framework for class based representation formalisms (context) - Calvanese, Lenzerini et al. - 1994
8
Patel-Schneider (context) - Lambrix, Borgida et al. - 1999
7
Solving propositional satisability problems (context) - Jeroslow, Wang - 1990
7
A note on encoding inverse roles and functional restrictions..
- Calvanese, De Giacomo et al. - 1998
4
Comparison of theorem provers for modal logics | introductio.. (context) - Balsiger, Heuerding - 1998
4
A PSpace-algorithm for deciding ALCI R + -satisability (context) - Horrocks, Sattler et al. - 1998
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/~tobies/publications/index.html): More
The Complexity of Cardinality Restrictions - Tobies (2000)
(Correct)
On the Relation between Conceptual Graphs and Description.. - Baader, Molitor, Tobies (1998)
(Correct)
PSpace Reasoning for Graded Modal Logics - Tobies (1999)
(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