283 search results - page 51 / 57 » Solving Over-Constrained Problems with SAT |
128
click to vote
COCO
2005
Springer
15 years 7 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
105
click to vote
CC
2007
Springer
15 years 1 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
106
click to vote
CPAIOR
2006
Springer
15 years 5 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
149
click to vote
LOGCOM
2011
14 years 4 months ago
2011
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: satplan has been the winning system in the deterministic track for optim...
118
click to vote
KBSE
2007
IEEE
15 years 8 months ago
2007
IEEE
Monitoring the satisfaction of software requirements and diagnosing what went wrong in case of failure is a hard problem that has received little attention in the Software and Req...