Hooker, J.N. (1988). Resolution vs. cutting plane solution of inference problems: Some computational experience. Operations Research Letter, 7(1), 1988, 1--7. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Generating Hard Satisfiability Problems - Selman, Mitchell, Levesque (1996) (60 citations) (Correct)
....preponderance of easy instances. That is, from the space of all problem instances, they sampled in a way that produced almost no hard cases. Nevertheless, papers continue to appear purporting to empirically demonstrate 2 the efficacy of some new procedure, but using just this distribution (e.g. Hooker, 1988; Kamath et al. 1990) or presenting data suggesting that very large satisfiability problems with thousands of propositional variables can be solved. How are we to evaluate these empirical results, given the danger of biasing the sample to suit the procedure in question, or of simply using ....
Hooker, J.N. (1988). Resolution vs. cutting plane solution of inference problems: Some computational experience. Operations Research Letter, 7(1), 1988, 1--7.
A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT.. - Borchers, Furman (1997) (27 citations) (Correct)
.... to three literals each (Garey and Johnson, 1979) Exact algorithms for the satisfiability problem include the Davis Putnam Loveland algorithm (Davis and Putnam, 1960; Loveland, 1978) resolution (Robinson, 1965) and integer programming approaches (Blair et al. 1986; Harche and Thompson, 1990; Hooker, 1988; Hooker and Fedjki, 1990; Jeroslow and Wang, 1990) Heuristics for SAT include Selman, Levesque, and Mitchell s GSAT heuristic (Selman et al. 1992; Selman and Kautz, 1993) and Resende and Feo s GRASP heuristic (Resende and Feo, 1996) These algorithms search for a sat2 isfying truth assignment. ....
Hooker, J. N. (1988). Resolution vs. cutting plane solution of inference problems: some computational experience. Operations Research Letters, 7(1):1--7.
A New Method for Solving Hard Satisfiability Problems - Selman, Levesque, Mitchell (1992) (393 citations) (Correct)
....is that so few natural constraints (such as the obvious one of using only N queens) are maintained during the search. Nonetheless, solutions are found quickly. Boolean induction Promising results have recently been obtained using integer programming techniques to solve satisfiability problems (Hooker 1988; Kamath et al. 1991) Most of the experimental evaluations of these methods have been based on the constant density random clause model, which unfortunately under represents hard instances (Mitchell et al. 1992) To compare GSAT and these methods, we considered the formulas as studied by Kamath ....
Hooker, J.N. (1988) Resolution vs. cutting plane solution of inference problems: Some computational experience.
Hard and Easy Distributions of SAT Problems - Mitchell, Selman, Levesque (1992) (298 citations) (Correct)
....a preponderance of easy instances. That is, from the space of all problem instances, they sampled in a way that produced almost no hard cases. Nevertheless, papers continue to appear purporting to empirically demonstrate the efficacy of some new procedure, but using just this distribution (e.g. Hooker, 1988; Kamath et al. 1990) or presenting data suggesting that very large satisfiability problems with thousands of propositional variables can be solved. In fact, we are presenting one of the latter kind our PROCEDURE DP Given a set of clauses Sigma defined over a set of variables V : ....
Hooker, J.N. (1988). Resolution vs. cutting plane solution of inference problems: Some computational experience.
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