What we can learn from conflicts in propositional satisfiability
From MaRDI portal
Publication:2630816
DOI10.1007/s10479-015-2028-9zbMath1411.91118OpenAlexW1531403982MaRDI QIDQ2630816
Youssef Hamadi, Saïd Jabbour, Lakhdar Saïs
Publication date: 22 July 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-015-2028-9
Symbolic computation and algebraic computation (68W30) Boolean programming (90C09) Rationality and learning in game theory (91A26) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)
Uses Software
Cites Work
- A linear-time transformation of linear inequalities into conjunctive normal form
- Learning from conflicts in propositional satisfiability
- Optimal speedup of Las Vegas algorithms
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- Branch-and-cut solution of inference problems in propositional logic
- Solving propositional satisfiability problems
- Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
- On Freezing and Reactivating Learnt Clauses
- Efficient CNF Simplification Based on Binary Implication Graphs
- A Way to Simplify Truth Functions
- A Generalized Framework for Conflict Analysis
- Adaptive Restart Strategies for Conflict Driven SAT Solvers
- Input Proofs and Rank One Cutting Planes
- GRASP: a search algorithm for propositional satisfiability
- Clause Elimination Procedures for CNF Formulas
- SATO: An efficient propositional prover
- Theory and Applications of Satisfiability Testing
- A Machine-Oriented Logic Based on the Resolution Principle
- Resolution With Merging
- A machine program for theorem-proving
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
