1435 search results - page 132 / 287 » E-connections of Description Logics |
DLOG
2008
15 years 3 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...
115
click to vote
FOIS
2006
15 years 2 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 ...
FLAIRS
2001
15 years 2 months ago
2001
We introduce the graph-based relational concept learner SubdueCL. We start with a brief description of other graph-based learning systems: the Galois lattice, Conceptual Graphs, a...
104
click to vote
DLOG
2003
15 years 2 months ago
2003
We consider description logic knowledge bases in which the ABox can contain Boolean combinations of traditional ABox assertions (represented as clauses or sequents). A linear redu...
CORR
2010
Springer
15 years 1 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...