1941 search results - page 44 / 389 » On the Hardness of Approximate Reasoning |
DLOG
2008
15 years 2 months ago
2008
We show that reasoning in the temporal conceptual model ERV T , a fragment of ERV T that only allows timestamping is complete for 2-ExpTime. The membership result is based on an em...
DLOG
2003
15 years 1 months ago
2003
We present a translation of looping alternating two-way automata into a comparably inexpressive description logic, which is contained in SHIQ. This enables us to perform the empti...
DATE
2004
IEEE
15 years 3 months ago
2004
IEEE
We propose a new arithmetic reasoning calculus to speed up a SAT solver based on the Davis Putnam Longman Loveland (DPLL) procedure. It is based on an arithmetic bit level descrip...
CP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We introduce a new approach for focusing constraint reasoning using so-called streamlining constraints. Such constraints partition the solution space to drive the search ...
AAAI
1998
15 years 1 months ago
1998
In this paper weexplore the computationalaspects of Propositional PowerDefault Reasoning (PDR),a form of non-monotonicreasoning whichthe underlyinglogic is Kleene's3-valued p...