R. J. Wallace and E. C. Freuder. Comparing constraint satisfaction and davis-putnam algorithms for the maximal satisfiability problem. In D. S. Johnson and M. A. Trick, editors, Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, (to appear). American Mathematical Society, 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Anytime Algorithms for Constraint Satisfaction and SAT problems - Wallace, Freuder (1995) (10 citations) Self-citation (Wallace Freuder) (Correct)
....on current domain size (smallest domain first) For MAX SAT problems we used a branch and bound version of the Davis Putnam algorithm that includes the in most shortest clause heuristic for choosing the next variable to assign. These algorithms are described in detail in [FW92] SH81] Wal95][WF95]. Heuristic repair procedures for CSPs begin with a complete assignment and try to improve it by choosing alternative assignments that reduce the number of constraint violations. In the minconflicts procedure, the first assignment is made by choosing values that minimize the number of constraint ....
R. J. Wallace and E. C. Freuder. Comparing constraint satisfaction and davis-putnam algorithms for the maximal satisfiability problem. In D. S. Johnson and M. A. Trick, editors, Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, (to appear). American Mathematical Society, 1995.
Heuristic Methods for Over-Constrained Constraint.. - Wallace, Freuder (1995) (15 citations) Self-citation (Wallace Freuder) (Correct)
.... and may also allow some assessment of trends with increasing problem size (as well as changes in other parameters such as density and constraint tightness) The complete methods used in the present work are branch and bound algorithms developed to solve MAX CSPs [ Freuder and Wallace, 1992 ] Wallace, 1995 ] and MAX SAT problems [ Wallace and Freuder, 1995 ] These were used to evaluate several important heuristic methods. For MAX CSPs, heuristic methods are based on the min conflicts procedure [ Minton et al. 1992 ] and include versions that incorporate tabu search procedures [ Glover, 1990 ] ....
.... of trends with increasing problem size (as well as changes in other parameters such as density and constraint tightness) The complete methods used in the present work are branch and bound algorithms developed to solve MAX CSPs [ Freuder and Wallace, 1992 ] Wallace, 1995 ] and MAX SAT problems [ Wallace and Freuder, 1995 ] These were used to evaluate several important heuristic methods. For MAX CSPs, heuristic methods are based on the min conflicts procedure [ Minton et al. 1992 ] and include versions that incorporate tabu search procedures [ Glover, 1990 ] For MAX SAT, heuristic methods are variants of ....
[Article contains additional citation context not shown here]
R. J. Wallace and E. C. Freuder. Comparing constraint satisfaction and davis-putnam algorithms for the maximal satisfiability problem. In D. S. Johnson and M. A. Trick, editors, Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, (to appear). American Mathematical Society, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC