72 search results - page 1 / 15 » Conflict Analysis in Search Algorithms for Satisfiability |
ICCAD
1996
IEEE
13 years 9 months ago
1996
IEEE
This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), an integrated algorithmic framework for SAT that unifies several previously proposed searchp...
ICTAI
1996
IEEE
13 years 9 months ago
1996
IEEE
DISOPT
2008
13 years 5 months ago
2008
The paper is concerned with the computational evaluation and comparison of a new family of conflict-based branching heuristics for evolved DPLL Satisfiability solvers. Such a fami...
CPAIOR
2006
Springer
13 years 7 months ago
2006
Springer
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
AIPS
2000
13 years 6 months ago
2000
The paradigm of advisable planning, in which a user provides guidance to influence the content of solutions produced by an underlying planning system, holds much promise for impro...