MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Practical Reasoning for Very Expressive Description Logics (2000) [97 citations — 17 self]

by Ian Horrocks ,  Ulrike Sattler ,  Stephan Tobies
Logic Journal of the IGPL
Add To MetaCart

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.

Citations

553 A machine program for theorem proving – Davis, Logemann, et al. - 1962
274 RACE system description – Haarslev, Möller - 1999
260 The propositional dynamic logic of regular programs – Fischer, Ladner - 1979
240 Practical reasoning for expressive description logics – Horrocks, Sattler, et al. - 1999
212 A correspondence theory for terminological logics – Schild - 1991
205 Using an expressive description logic: FaCT or fiction – Horrocks - 1998
193 Reasoning in description logics – Donini, Lenzerini, et al. - 1996
189 The Undecidability of the Dominoe Problem – Berger - 1966
158 Decidable reasoning in terminological knowledge representation systems – Buchheit, Donini, et al. - 1993
135 Improvements to Propositional Satisfiability Search Algorithms – Freeman - 1995
120 Logics of program – Kozen, Tiurzyn - 1990
115 The FaCT system – Horrocks - 1998
105 Augmenting Concept Languages by Transitive Closure of Roles: An Alternative to Terminological Cycles – Baader - 1991
105 Attributive concept descriptions with complements – Schmidt-Schauß, Smolka - 1991
96 Solving propositional satisfiability problems – Jeroslow, Wang - 1990
93 Building Decision Procedures for Modal Logics from Propositional Decision Procedures. The Case Study of Modal K(m – Giunchiglia, Sebastiani
90 Optimising Tableaux Decision Procedures for Description Logics – Horrocks - 1997
89 A description logic with transitive and inverse roles and role hierarchies – Horrocks, Sattler - 1999
80 Subsumption algorithms for concept description languages – Hollunder, Nutt, et al. - 1990
76 Models of program logics – Pratt - 1979
71 Tbox and Abox reasoning in expressive description logics – Giacomo, Lenzerini - 1996
66 Qualifying number restrictions in concept languages – Hollunder, Baader - 1991
63 Fact and ifact – Horrocks - 1999
53 Source Integration in Data Warehousing – CALVANESE, GIACOMO, et al. - 1998
50 B.: Cardinality restrictions on concepts – Baader, Buchheit, et al. - 1996
48 What’s in an aggregate: Foundations for description logics with tuples and sets – Giacomo, Lenzerini - 1995
46 Optimising Description Logic Subsumption – Horrocks, Patel-Schneider - 1999
45 Combining deduction and model checking into tableaux and algorithms for converse-PDL – Giacomo, Massacci
43 DLP system description – Patel-Schneider - 1998
43 A concept language extended with different kinds of transitive roles – Sattler - 1996
42 Intelligent Backtracking on constraint satisfaction problems: experimental and theoretical results – Baker - 1995
41 A unified framework for class based representation formalisms – Calvanese, Lenzerini, et al. - 1994
41 A benchmark method for the propositional modal logics K, KT, and S4 – Heuerding, Schwendimann - 1996
35 A tableau-based theorem prover – Oppacher, Suen, et al. - 1988
34 On the Expressivity of Feature Logics with Negation, Functional Uncertainty, and Sort Equations – Baader, Bürckert, et al. - 1993
28 Number restrictions on complex roles in description logics – Baader, Sattler - 1996
24 Goals for concept representation in the GALEN project – Rector, Nowlan, et al. - 1993
21 Comparison of Theorem Provers for Modal Logics – Balsiger, Heuerding - 1998
19 Comparing subsumption optimizations – Horrocks, Patel-Schneider
16 Description logics with inverse roles, functional restrictions, and n-ary relations – Giacomo, Lenzerini - 1994
15 random 3-SAT problems and the Davis-Putnam procedure – Hard - 1996
10 A note on encoding inverse roles and functional restrictions in ALC knowledge bases – Calvanese, Giacomo, et al. - 1998
10 The complexity of propositional tense logics – Spaan - 1993
2 A PSPACE-algorithm for deciding ALCI R +satisfiability – Horrocks, Sattler, et al. - 1998
View or Download | Add to My Collection | Correct Errors