2214 search results - page 18 / 443 » Complexity of Reasoning |
LICS
1999
IEEE
14 years 3 months ago
1999
IEEE
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...
EWCBR
2004
Springer
14 years 4 months ago
2004
Springer
Case-based Reasoning (CBR) is a mature technology for building knowledge-based systems that are capable to produce useful results even if no answer matches the query exactly. Often...
DLOG
2011
13 years 2 months ago
2011
We analyze the complexity of subsumption in probabilistic variants of the description logic EL. In the case where probabilities apply only to concepts, we map out the borderline be...
LPAR
1999
Springer
14 years 3 months ago
1999
Springer
Abstract. Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Ex...
CSL
2000
Springer
14 years 3 months ago
2000
Springer
We study definability of languages in arithmetic and the free monoid by bounded versions of fixed-point and transitive-closure logics. In particular we give logical characterisat...