245 search results - page 27 / 49 » Class Algebra as a Description Logic |
123
click to vote
DLOG
2010
14 years 10 months ago
2010
In this paper we outline an algebraic tableau algorithm for the DL SHOQ, which supports more informed reasoning due to the use of semantic partitioning and integer programming. We ...
111
click to vote
CADE
2005
Springer
16 years 24 days ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
TCS
2008
15 years 12 days ago
2008
Density elimination, a close relative of cut elimination, consists of removing applications of the Takeuti-Titani density rule from derivations in Gentzen-style (hypersequent) cal...
98
Voted
ENTCS
2007
15 years 13 days ago
2007
Description Logics (DLs) are a family of logic based knowledge representation formalisms. Although they have a range of applications, they are perhaps best known as the basis for ...
117
Voted
DLOG
2007
15 years 2 months ago
2007
Abstract. Concept approximation is an inference service for Description Logics that provides “translations” of concept descriptions from one DL to a less expressive DL. In [4] ...