Branching rules for satisfiability
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4152425 (Why is no real title available?)
- scientific article; zbMATH DE number 3934254 (Why is no real title available?)
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- scientific article; zbMATH DE number 3568056 (Why is no real title available?)
- A Computational Study of Satisfiability Algorithms for Propositional Logic
- A Computing Procedure for Quantification Theory
- A continuous approach to inductive inference
- A new algorithm for the propositional satisfiability problem
- A robust heuristic for the generalized assignment problem
- Algorithms for testing the satisfiability of propositional formulae
- Branch-and-cut solution of inference problems in propositional logic
- Compact normal forms in propositional logic and integer programming formulations
- Needed: An Empirical Science of Algorithms
- Solving propositional satisfiability problems
Cited in
(31)- March\_dl: adding adaptive heuristics and a new branching strategy
- How good are branching rules in DPLL?
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- scientific article; zbMATH DE number 1113999 (Why is no real title available?)
- The characterization of branching dependencies
- A cost-reducing question-selection algorithm for propositional knowledge-based systems
- New methods for 3-SAT decision and worst-case analysis
- How To Be Fickle
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
- On look-ahead heuristics in disjunctive logic programming
- Learning rate based branching heuristic for SAT solvers
- Learning to select branching rules in the DPLL procedure for satisfiability
- Approximating minimal unsatisfiable subformulae by means of adaptive core search
- Restoring satisfiability or maintaining unsatisfiability by finding small unsatisfiable subformulae
- On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\)
- Logics in Artificial Intelligence
- An empirical study of branching heuristics through the lens of global learning rate
- How Many Conflicts Does It Need to Be Unsatisfiable?
- Solving satisfiability problems using elliptic approximations -- effective branching rules
- On the complexity of choosing the branching literal in DPLL
- A complete adaptive algorithm for propositional satisfiability
- Testing heuristics: We have it all wrong
- PaSAT -- parallel SAT-checking with lemma exchange: Implementation and applications
- \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
- Theory and Applications of Satisfiability Testing
- A practical integration of first-order reasoning and decision procedures
- Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers
- Theory and Applications of Satisfiability Testing
- Backtracking tactics in the backtrack method for SAT
- On the limit of branching rules for hard random unsatisfiable 3-SAT
- A weight-balanced branching rule for SAT
This page was built for publication: Branching rules for satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1904401)
