936 search results - page 55 / 188 » The Logical Difference Problem for Description Logic Termino... |
DLOG
2008
13 years 10 months ago
2008
Abstract. We show that subsumption problems in EL and related description logics can be expressed as uniform word problems in classes of semilattices with monotone operators. We us...
FOIS
2006
13 years 9 months ago
2006
A critical problem for practical KR is dealing with relationships that change over time. This problem is compounded by representation languages such as OWL that are biased towards ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIMEcomplete in the presence of unrestricted axioms. Sev...
TIME
2002
IEEE
14 years 27 days ago
2002
IEEE
In this paper, we propose a logical approach to represent and reason about different time granularities. We identify a time granularity as a discrete infinite sequence of time po...
JAR
2002
13 years 7 months ago
2002
Satisfiability algorithms for propositional logic have improved enormously in recently years. This improvement increases the attractiveness of satisfiability methods for first-orde...