Sciweavers

1470 search results - page 133 / 294
» An Introduction to Description Logics
Sort
View
LFCS
2009
Springer
16 years 1 months ago
Completeness Results for Memory Logics
Memory logics are a family of modal logics in which standard relational structures are augmented with data structures and additional operations to modify and query these structure...
Carlos Areces, Santiago Figueira, Sergio Mera
JELIA
2004
Springer
15 years 11 months ago
Computing the Least Common Subsumer w.r.t. a Background Terminology
Methods for computing the least common subsumer (lcs) are usually restricted to rather inexpressive Description Logics (DLs) whereas existing knowledge bases are written in very e...
Franz Baader, Baris Sertkaya, Anni-Yasmin Turhan
CADE
2004
Springer
16 years 6 months ago
Sonic - Non-standard Inferences Go OilEd
Sonic1 is the first prototype implementation of non-standard inferences for Description Logics usable via a graphical user interface. The contribution of our implementation is twof...
Anni-Yasmin Turhan, Christian Kissig
VL
2007
IEEE
104views Visual Languages» more  VL 2007»
16 years 21 days ago
A Peirce Style Calculus for ALC
Description logics (DLs) are a well-understood family of knowledge representation (KR) languages. The notation of DLs has the flavour of a variable-free first order predicate lo...
Frithjof Dau, Peter W. Eklund
LICS
1999
IEEE
15 years 10 months ago
Counting and Addition Cannot Express Deterministic Transitive Closure
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...
Matthias Ruhl