On the complexity of choosing the branching literal in DPLL
From MaRDI portal
Publication:1978252
DOI10.1016/S0004-3702(99)00097-1zbMATH Open0939.68646OpenAlexW2057832617MaRDI QIDQ1978252FDOQ1978252
Authors: Paolo Liberatore 
Publication date: 4 June 2000
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(99)00097-1
Recommendations
Cites Work
- Title not available (Why is that?)
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Title not available (Why is that?)
- Title not available (Why is that?)
- Branching rules for satisfiability
- Solving propositional satisfiability problems
- How good are branching rules in DPLL?
Cited In (11)
- Learning to select branching rules in the DPLL procedure for satisfiability
- On the limit of branching rules for hard random unsatisfiable 3-SAT
- Argumentation in artificial intelligence
- Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates
- On the relation among answer set solvers
- How important are branching decisions: fooling MIP solvers
- How good are branching rules in DPLL?
- New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability
- Complexity results on DPLL and resolution
- Advances in Artificial Intelligence
- Scaling up DPLL(T) string solvers using context-dependent simplification
This page was built for publication: On the complexity of choosing the branching literal in DPLL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978252)
