25 search results - page 3 / 5 » The Boolean Formula Value Problem Is in ALOGTIME |
110
Voted
ENTCS
2006
15 years 2 months ago
2006
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
129
click to vote
AAAI
2011
14 years 2 months ago
2011
We consider a new class of planning problems involving a set of non-negative real variables, and a set of non-deterministic actions that increase or decrease the values of these v...
126
click to vote
DATE
2008
IEEE
15 years 4 months ago
2008
IEEE
Many decision and optimization problems in Electronic Design Automation (EDA) can be solved with Boolean Satisfiability (SAT). Moreover, well-known extensions of SAT also find app...
130
click to vote
CCECE
2006
IEEE
15 years 9 months ago
2006
IEEE
Several approaches have been proposed to accelerate the NP-complete Boolean Satisfiability problem (SAT) using reconfigurable computing. We present an FPGA based clause evaluator,...
133
click to vote
ICTCS
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...