Pages that link to "Item:Q2941732"
From MaRDI portal
The following pages link to Clause Elimination for SAT and QSAT (Q2941732):
Displaying 21 items.
- Simulating circuit-level simplifications on CNF (Q352967) (← links)
- Non-clausal redundancy properties (Q2055860) (← links)
- Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations (Q2058378) (← links)
- Covered clauses are not propagation redundant (Q2096437) (← links)
- Clause redundancy and preprocessing in maximum satisfiability (Q2104499) (← links)
- Contradiction separation based dynamic multi-clause synergized automated deduction (Q2198231) (← links)
- Logical reduction of metarules (Q2203321) (← links)
- New models for generating hard random Boolean formulas and disjunctive logic programs (Q2287195) (← links)
- On preprocessing techniques and their impact on propositional model counting (Q2362107) (← links)
- Solution validation and extraction for QBF preprocessing (Q2362496) (← links)
- Conformant planning as a case study of incremental QBF solving (Q2398267) (← links)
- A polyhedral projection procedure for Q2SAT (Q2741538) (← links)
- Super-Blocked Clauses (Q2817910) (← links)
- Q-Resolution with Generalized Axioms (Q2818032) (← links)
- HordeQBF: A Modular and Massively Parallel QBF Solver (Q2818039) (← links)
- Truth Assignments as Conditional Autarkies (Q3297584) (← links)
- (Q4553279) (← links)
- Solving Advanced Argumentation Problems with Answer Set Programming (Q4957200) (← links)
- The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1 (Q5015602) (← links)
- Theory and Applications of Satisfiability Testing (Q5713747) (← links)
- Mining definitions in Kissat with Kittens (Q6056639) (← links)
