Toward leaner binary-clause reasoning in a satisfiability solver
From MaRDI portal
Publication:1777406
DOI10.1007/s10472-005-0433-5zbMath1099.68097OpenAlexW4248922942MaRDI QIDQ1777406
Publication date: 13 May 2005
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-005-0433-5
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
On preprocessing techniques and their impact on propositional model counting ⋮ Preprocessing for DQBF ⋮ Simulating circuit-level simplifications on CNF ⋮ Efficient CNF Simplification Based on Binary Implication Graphs ⋮ The configurable SAT solver challenge (CSSC) ⋮ Producing and verifying extremely large propositional refutations ⋮ SAT encodings for pseudo-Boolean constraints together with at-most-one constraints ⋮ The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Eliminating dublication with the hyper-linking strategy
- A strong-connectivity algorithm and its applications in data flow analysis
- An efficient algorithm for the 3-satisfiability problem
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- SATO: An efficient propositional prover
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
This page was built for publication: Toward leaner binary-clause reasoning in a satisfiability solver
