Sciweavers

565 search results - page 17 / 113
» Heuristics for Planning with SAT
Sort
View
DATE
2003
IEEE
82views Hardware» more  DATE 2003»
14 years 1 months ago
A Circuit SAT Solver With Signal Correlation Guided Learning
— Boolean Satistifiability has attracted tremendous research effort in recent years, resulting in the developments of various efficient SAT solver packages. Based upon their de...
Feng Lu, Li-C. Wang, Kwang-Ting Cheng, Ric C.-Y. H...
JSAT
2008
99views more  JSAT 2008»
13 years 7 months ago
A Switching Criterion for Intensification and Diversification in Local Search for SAT
We propose a new switching criterion, namely the evenness or unevenness of the distribution of variable weights, and use this criterion to combine intensification and diversificat...
Wanxia Wei, Chu Min Li, Harry Zhang
SAT
2005
Springer
133views Hardware» more  SAT 2005»
14 years 1 months ago
Solving Over-Constrained Problems with SAT Technology
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
Josep Argelich, Felip Manyà
CORR
2008
Springer
124views Education» more  CORR 2008»
13 years 8 months ago
A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach
In MaxSat, we ask for an assignment which satisfies the maximum number of clauses for a boolean formula in CNF. We present an algorithm yielding a run time upper bound of O (2 K 6....
Daniel Raible, Henning Fernau
SARA
2007
Springer
14 years 2 months ago
A Meta-CSP Model for Optimal Planning
One approach to optimal planning is to first start with a sub- optimal solution as a seed plan, and then iteratively search for shorter plans. This approach inevitably leads to an...
Peter Gregory, Derek Long, Maria Fox