Branching rules for satisfiability

DOI10.1007/BF00881805zbMath0838.68098OpenAlexW2776836749MaRDI QIDQ1904401

V. Vinay, John N. Hooker

Publication date: 20 December 1995

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00881805

zbMATH Keywords

satisfiabilitybranching algorithmsJeroslow-Wang rule

Mathematics Subject Classification ID

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A continuous approach to inductive inference
• Compact normal forms in propositional logic and integer programming formulations
• A robust heuristic for the generalized assignment problem
• Branch-and-cut solution of inference problems in propositional logic
• Solving propositional satisfiability problems
• A new algorithm for the propositional satisfiability problem
• Algorithms for testing the satisfiability of propositional formulae
• Needed: An Empirical Science of Algorithms
• A Computational Study of Satisfiability Algorithms for Propositional Logic
• A Computing Procedure for Quantification Theory