955 search results - page 43 / 191 » Tractable Temporal Reasoning |
DLOG
2011
13 years 15 days ago
2011
Abstract. We consider the problem of characterising relational constraints under which TBox reasoning in EL is tractable. We obtain P vs. coNP-hardness dichotomies for tabular cons...
KR
1992
Springer
14 years 1 months ago
1992
Springer
Converting complex equations into simpler, more tractable equations usually involves approximation. Approximation is usually done by identifying and removing insignificant terms, ...
CADE
2002
Springer
14 years 9 months ago
2002
Springer
Abstract. Description Logics are a family of class based knowledge representation formalisms characterised by the use of various constructors to build complex classes from simpler ...
DEXAW
2007
IEEE
14 years 3 months ago
2007
IEEE
In this paper we explore embeddings of the various kinds of RDF entailment in F-Logic. We show that the embeddings of simple, RDF, and RDFS entailment, as well as a large fragment...
IJCAI
2007
13 years 10 months ago
2007
Current research on qualitative spatial representation and reasoning usually focuses on one single aspect of space. However, in real world applications, several aspects are often ...