Learning from conflicts in propositional satisfiability
From MaRDI portal
Publication:427560
DOI10.1007/s10288-011-0191-7zbMath1242.68287OpenAlexW2047512375MaRDI QIDQ427560
Youssef Hamadi, Lakhdar Saïs, Saïd Jabbour
Publication date: 13 June 2012
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-011-0191-7
Learning and adaptive systems in artificial intelligence (68T05) Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Twelve surveys in operations research, What we can learn from conflicts in propositional satisfiability, Surveys in operations research
Uses Software
Cites Work
- A linear-time transformation of linear inequalities into conjunctive normal form
- 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
- Clause Elimination Procedures for CNF Formulas
- Theory and Applications of Satisfiability Testing
- A Machine-Oriented Logic Based on the Resolution Principle
- 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
