Pages that link to "Item:Q1904401"

The following pages link to Branching rules for satisfiability (Q1904401):

Displaying 22 items.

• On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\) (Q400514) (← links)
• Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers (Q421579) (← links)
• A weight-balanced branching rule for SAT (Q597527) (← links)
• How good are branching rules in DPLL? (Q1281405) (← links)
• Approximating minimal unsatisfiable subformulae by means of adaptive core search (Q1408373) (← links)
• On the limit of branching rules for hard random unsatisfiable 3-SAT (Q1408384) (← links)
• Backtracking tactics in the backtrack method for SAT (Q1596804) (← links)
• A cost-reducing question-selection algorithm for propositional knowledge-based systems (Q1776198) (← links)
• A complete adaptive algorithm for propositional satisfiability (Q1811072) (← links)
• Solving satisfiability problems using elliptic approximations -- effective branching rules (Q1841892) (← links)
• Testing heuristics: We have it all wrong (Q1922626) (← links)
• New methods for 3-SAT decision and worst-case analysis (Q1960406) (← links)
• On the complexity of choosing the branching literal in DPLL (Q1978252) (← links)
• Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics (Q1978312) (← links)
• On look-ahead heuristics in disjunctive logic programming (Q2426102) (← links)
• MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability (Q2457672) (← links)
• (Q2741521) (← links)
• (Q2741526) (← links)
• (Q2741536) (← links)
• How Many Conflicts Does It Need to Be Unsatisfiable? (Q3502712) (← links)
• ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver (Q5015596) (← links)
• A practical integration of first-order reasoning and decision procedures (Q5234694) (← links)