482 search results - page 27 / 97 » Expressive probabilistic description logics |
ESWS
2005
Springer
14 years 2 months ago
2005
Springer
We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason ...
AIME
2007
Springer
14 years 3 months ago
2007
Springer
Reification of parthood relations according to the SEP-triplet encoding pattern has been employed in the clinical terminology SNOMED CT to simulate transitivity of the part-of rel...
LICS
1999
IEEE
14 years 1 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...
FLAIRS
2006
13 years 10 months ago
2006
Description Logics (DL) are gaining more popularity as the foundation of ontology languages for the Semantic Web. As most information in real life is imperfect, there has been an ...
ICDT
2003
ACM
14 years 2 months ago
2003
ACM
We define a boolean complete description logic dialect called DLFDreg that can be used to reason about structural equality in semistructured ordered data in the presence of docume...