Pages that link to "Item:Q4933317"
From MaRDI portal
The following pages link to Clause Elimination Procedures for CNF Formulas (Q4933317):
Displaying 21 items.
- Learning from conflicts in propositional satisfiability (Q427560) (← links)
- Projection and scope-determined circumscription (Q429594) (← links)
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability (Q511772) (← links)
- Covered clauses are not propagation redundant (Q2096437) (← links)
- Vampire getting noisy: Will random bits help conquer chaos? (system description) (Q2104552) (← links)
- Hash-based preprocessing and inprocessing techniques in SAT solvers (Q2118288) (← links)
- Definability for model counting (Q2303508) (← links)
- Set-blocked clause and extended set-blocked clause in first-order logic (Q2333858) (← links)
- On preprocessing techniques and their impact on propositional model counting (Q2362107) (← links)
- Solution validation and extraction for QBF preprocessing (Q2362496) (← links)
- What we can learn from conflicts in propositional satisfiability (Q2630816) (← links)
- Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers (Q2818024) (← links)
- Efficient CNF Simplification Based on Binary Implication Graphs (Q3007684) (← links)
- Truth Assignments as Conditional Autarkies (Q3297584) (← links)
- Preprocessing for DQBF (Q3453223) (← links)
- Inst-Gen – A Modular Approach to Instantiation-Based Automated Reasoning (Q4916080) (← links)
- The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1 (Q5015602) (← links)
- Blocked Clause Elimination for QBF (Q5200018) (← links)
- SAT-Inspired Eliminations for Superposition (Q5875949) (← links)
- Mining definitions in Kissat with Kittens (Q6056639) (← links)
- Certified SAT solving with GPU accelerated inprocessing (Q6564174) (← links)
