884 search results - page 41 / 177 » A Proof Theory for DL-Lite |
CP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
107
click to vote
LICS
2003
IEEE
15 years 5 months ago
2003
IEEE
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
COCO
2008
Springer
15 years 1 months ago
2008
Springer
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...
117
click to vote
IFSA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The paper develops fuzzy attribute logic, i.e. a logic for reasoning about formulas of the form A ⇒ B where A and B are fuzzy sets of attributes. A formula A ⇒ B repr...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...