Sciweavers

135 search results - page 3 / 27
» A Distributed Algorithm to Evaluate Quantified Boolean Formu...
Sort
View
ECAI
2006
Springer
13 years 8 months ago
A Solver for QBFs in Nonprenex Form
Various problems in AI can be solved by translating them into a quantified boolean formula (QBF) and evaluating the resulting encoding. In this approach, a QBF solver is used as a ...
Uwe Egly, Martina Seidl, Stefan Woltran
ICCAD
2002
IEEE
146views Hardware» more  ICCAD 2002»
14 years 1 months ago
Conflict driven learning in a quantified Boolean Satisfiability solver
Within the verification community, there has been a recent increase in interest in Quantified Boolean Formula evaluation (QBF) as many interesting sequential circuit verification ...
Lintao Zhang, Sharad Malik
COLT
1991
Springer
13 years 8 months ago
Learning Probabilistic Read-Once Formulas on Product Distributions
Abstract. This paper presents a polynomial-time algorithm for inferring a probabilistic generalization of the class of read-once Boolean formulas over the usual basis {AND,OR,NOT}....
Robert E. Schapire
DAC
2009
ACM
14 years 6 months ago
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
Himanshu Jain, Edmund M. Clarke
ENTCS
2008
110views more  ENTCS 2008»
13 years 5 months ago
A New Proposal Of Quasi-Solved Form For Equality Constraint Solving
Most well-known algorithms for equational solving are based on quantifier elimination. This technique iteratively eliminates the innermost block of existential/universal quantifie...
Javier Álvez, Paqui Lucio