470 search results - page 45 / 94 » Tabu Search for SAT |
IRI
2007
IEEE
14 years 1 months ago
2007
IEEE
This last decade, propositional reasoning and search has been one of the hottest topics of research in the A.I. community, as the Boolean framework has been recognized as a powerf...
AAAI
2000
13 years 9 months ago
2000
We describe MarketSAT, a highly decentralized, marketbased algorithm for propositional satisfiability. The approach is based on a formulation of satisfiability as production on a ...
CP
2010
Springer
13 years 6 months ago
2010
Springer
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performanc...
CP
2007
Springer
14 years 1 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
ASPDAC
2005
ACM
13 years 9 months ago
2005
ACM
－ It is a hotly research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. BFL algorithm is the most effective Counterexample minim...