4117 search results - page 512 / 824 » On the Satisfiability of Complex Constraints |
182
click to vote
TCC
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
250
click to vote
PODS
2012
ACM
13 years 9 months ago
2012
ACM
Data is increasingly being bought and sold online, and Webbased marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are ...
175
click to vote
ICAI
2004
15 years 8 months ago
2004
This paper shows how to generate an English step-by-step explanation that describes how an automated reasoning system solves a complex logic program. We limit our attention to pro...
177
click to vote
IVC
2006
15 years 6 months ago
2006
While the SoftAssign algorithm imposes a two-way constraint embedded into the deterministic annealing scheme and the EMICP algorithm imposes a one-way constraint, they represent t...
212
click to vote
JAR
2006
15 years 6 months ago
2006
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...