Sciweavers

DLOG
2009
13 years 2 months ago
Terminating Tableaux for SOQ with Number Restrictions on Transitive Roles
Abstract. We show that the description logic SOQ with number restrictions on transitive roles is decidable by a terminating tableau calculus. The language decided by the calculus i...
Mark Kaminski, Gert Smolka
DLOG
2003
13 years 5 months ago
Computing Least Common Subsumers for FLE+
Transitive roles are important for adequate representation of knowledge in a range of applications. In this paper we present a first algorithm to compute least common subsumers i...
Sebastian Brandt, Anni-Yasmin Turhan
IJCAI
2007
13 years 6 months ago
Conjunctive Query Answering for the Description Logic SHIQ
Conjunctive queries play an important role as an expressive query language for Description Logics (DLs). Although modern DLs usually provide for transitive roles, conjunctive quer...
Birte Glimm, Ian Horrocks, Carsten Lutz, Ulrike Sa...
DLOG
2008
13 years 6 months ago
Two Upper Bounds for Conjunctive Query Answering in SHIQ
We have shown recently that, in extensions of ALC that involve inverse roles, conjunctive query answering is harder than satisfiability: it is 2-ExpTime-complete in general and NEx...
Carsten Lutz
TABLEAUX
2000
Springer
13 years 8 months ago
Benchmark Analysis with FaCT
FaCT (Fast Classification of Terminologies) is a Description Logic (DL) classifier that can also be used for modal logic satisfiability testing. The FaCT system includes two reason...
Ian Horrocks
LPAR
2007
Springer
13 years 10 months ago
How Many Legs Do I Have? Non-Simple Roles in Number Restrictions Revisited
Abstract. The Description Logics underpinning OWL impose a well-known syntactic restriction in order to preserve decidability: they do not allow to use nonsimple roles—that is, t...
Yevgeny Kazakov, Ulrike Sattler, Evgeny Zolin