(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. (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
70.4%: Logic Journal of the IGPL 8:3 - Areces, Franconi, Goré, de.. (2000)
(Correct)
44.7%: Practical Reasoning for Very Expressive Description Logics - Horrocks, Sattler, Tobies (2000)
(Correct)
44.4%: Logic Journal - Of The Editor-In-Chief
(Correct)
Active bibliography (related documents): More All
0.6: Decidability of Class-Based Knowledge Representation Formalisms - De Giacomo (1995)
(Correct)
0.6: Source Integration in Data Warehousing - Calvanese, De Giacomo, Lenzerini, .. (1997)
(Correct)
0.5: Optimizing Description Logic Subsumption - Horrocks, Patel-Schneider (1999)
(Correct)
Similar documents based on text: More All
0.9: A Description Logic with Transitive and Converse Roles.. - Horrocks, Sattler.. (1998)
(Correct)
0.8: Decidability of SHIQ with Complex Role Inclusion Axioms - Horrocks (2003)
(Correct)
0.8: A Description Logic with Transitive and Inverse Roles and.. - Horrocks, Sattler (1998)
(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/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/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 DBLP
180
Reasoning in description logics
- Donini, Lenzerini et al. - 1996 ACM
176
A correspondence theory for terminological logics: Prelimina..
- Schild - 1991 DBLP
152
Decidable reasoning in terminological knowledge representati..
- Buchheit, Donini et al. - 1993 DBLP
148
Practical reasoning for expressive description logics
- Horrocks, Sattler et al. - 1999 ACM DBLP
143
Logics of programs (context) - Kozen, Tiuryn - 1990 ACM DBLP
118
Using an expressive description logic: FaCT or fiction
- Horrocks - 1998
92
Building decision procedures for modal logics from propositi..
- Giunchiglia, Sebastiani - 1996
88
Subsumption algorithms for concept description languages
- Hollunder, Nutt et al. - 1990 DBLP
85
Augmenting concept languages by transitive closure of roles:..
- Baader - 1990 DBLP
80
Improvements to propositional satisfiability search algorith..
- Freeman - 1995 ACM
75
Attributive concept descriptions with complements (context) - Schmidt-Schau, Smolka - 1991 ACM DBLP
72
A description logic with transitive and inverse roles and ro..
- Horrocks, Sattler - 1999 DBLP
64
Solving propositional satisfiability problems (context) - Jeroslow, Wang - 1990 DBLP
59
Models of program logic (context) - Pratt - 1979
57
Optimising Tableaux Decision Procedures for Description Logi.. (context) - Horrocks - 1997
57
Qualifying number restrictions in concept languages (context) - Hollunder, Baader - 1991
52
A unified framework for class based representation formalism..
- Calvanese, Lenzerini et al. - 1994
50
FaCT and iFaCT
- Horrocks DBLP
49
HARP: A tableau-based theorem prover (context) - Oppacher, Suen - 1988 ACM DBLP
45
The FaCT system
- Horrocks - 1998 ACM DBLP
42
A benchmark method for the propositional modal logics K (context) - Heuerding, Schwendimann - 1996
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 ACM DBLP
31
the expressivity of feature logics with negation (context) - Baader, Burckert et al. - 1993
31
Source integration in data warehousing
- Calvanese, De Giacomo et al. - 1998 ACM DBLP
27
The undecidability of the dominoe problem (context) - Berger - 1966
26
Number restrictions on complex roles in description logics
- Baader, Sattler - 1996 ACM
23
Tbox and Abox reasoning in expressive description logics (context) - De Giacomo, Lenzerini - 1996 DBLP
17
Hard random 3-SAT problems and the Davis-Putnam procedure (context) - Freeman - 1996 DBLP
17
DLP system description (context) - Patel-Schneider DBLP
17
Comparison of theorem provers for modal logics --- introduct.. (context) - Balsiger, Heuerding - 1998
16
Comparing subsumption optimizations
- Horrocks, Patel-Schneider DBLP
15
RACE system description
- Haarslev, Moller DBLP
10
The complexity of propositional tense logics (context) - Spaan - 2000
10
A concept language extended with di#erent kinds of transitiv.. (context) - Sattler - 1996
8
Patel-Schneider (context) - Lambrix, Borgida et al. - 1999
8
Combining deduction and model checking into tableaux and alg..
- De Giacomo, Massacci - 1999 ACM DBLP
7
A note on encoding inverse roles and functional restrictions..
- Calvanese, De Giacomo et al.
6
What's in an aggregate: Foundations for description logics w..
- De Giacomo, Lenzerini - 1995 DBLP
3
Description logics with inverse roles (context) - De Giacomo, Lenzerini - 1994
1
A PSpace-algorithm for deciding ALCI R + -satisfiability (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/): 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