4573 search results - page 347 / 915 » Automated Reasoning |
215
click to vote
EWCBR
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we introduce a new instance-based approach to the label ranking problem. This approach is based on a probability model on rankings which is known as the Mallows mode...
177
click to vote
FLOPS
2008
Springer
15 years 8 months ago
2008
Springer
In this paper we describe some certified algorithms for exact real arithmetic based on co-recursion. Our work is based on previous experiences using redundant digits of base 2 but ...
162
click to vote
DLOG
2004
15 years 8 months ago
2004
Recently, it was shown for the DL EL that subsumption and instance problem w.r.t. cyclic terminologies can be decided in polynomial time. In this paper, we show that both problems...
183
click to vote
DLOG
2006
15 years 8 months ago
2006
Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this ...
167
Voted
DLOG
2006
15 years 8 months ago
2006
We propose a technique to make consistency detection scalable for large Aboxes in secondary storage. We use static analysis of knowledge representation with summarization techniqu...