Pages that link to "Item:Q1100093"

The following pages link to Resolution vs. cutting plane solution of inference problems: Some computational experience (Q1100093):

Displaying 22 items.

• A weight-balanced branching rule for SAT (Q597527) (← links)
• A dual algorithm for the satisfiability problem (Q750165) (← links)
• Computational experience with an interior point algorithm on the satisfiability problem (Q753688) (← links)
• Differential approximation of MIN SAT, MAX SAT and related problems (Q877035) (← links)
• Probabilistic bounds and algorithms for the maximum satisfiability problem (Q920845) (← links)
• A linear and discrete programming framework for representing qualitative knowledge (Q1309850) (← links)
• New methods for computing inferences in first order logic (Q1309900) (← links)
• An exact algorithm for the constraint satisfaction problem: Application to logical inference (Q1313760) (← links)
• Generating logical expressions from positive and negative examples via a branch-and-bound approach (Q1318514) (← links)
• Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach (Q1330807) (← links)
• Branch-and-cut solution of inference problems in propositional logic (Q1356213) (← links)
• A BDD SAT solver for satisfiability testing: An industrial case study (Q1380431) (← links)
• Backtracking tactics in the backtrack method for SAT (Q1596804) (← links)
• Differential approximation for optimal satisfiability and related problems (Q1869721) (← links)
• Improving the performance of enumerative search methods. I: Exploiting structure and intelligence (Q1892667) (← links)
• Improving the performance of enumerative search methods. II: Computational experiments (Q1905078) (← links)
• The \(Multi\)-SAT algorithm (Q1961449) (← links)
• Mixed logical-linear programming (Q1961464) (← links)
• The state of SAT (Q2643296) (← links)
• Generating hard satisfiability problems (Q2674174) (← links)
• Some pitfalls for experimenters with random SAT (Q2674180) (← links)
• Simplifying clausal satisfiability problems (Q5096298) (← links)