2214 search results - page 74 / 443 » Complexity of Reasoning |
116
click to vote
CSL
2006
Springer
15 years 6 months ago
2006
Springer
In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong c...
KR
2000
Springer
15 years 6 months ago
2000
Springer
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
139
click to vote
JACM
2010
15 years 1 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
277
click to vote
PLDI
2009
ACM
16 years 3 months ago
2009
ACM
We present an integrated proof language for guiding the actions of multiple reasoning systems as they work together to prove complex correctness properties of imperative programs....
116
click to vote
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
— In this paper, we propose a new implementation of the EMS decoder for non binary LDPC codes presented in [7]. A particularity of the new algorithm is that it takes into account...