Pages that link to "Item:Q5714759"
From MaRDI portal
The following pages link to Theory and Applications of Satisfiability Testing (Q5714759):
Displayed 18 items.
- NiVER (Q19021) (← links)
- Simulating circuit-level simplifications on CNF (Q352967) (← links)
- On Davis-Putnam reductions for minimally unsatisfiable clause-sets (Q391124) (← links)
- Learning from conflicts in propositional satisfiability (Q427560) (← links)
- Incremental preprocessing methods for use in BMC (Q453488) (← links)
- Automatically improving constraint models in Savile Row (Q1680696) (← links)
- Definability for model counting (Q2303508) (← links)
- On preprocessing techniques and their impact on propositional model counting (Q2362107) (← links)
- What we can learn from conflicts in propositional satisfiability (Q2630816) (← links)
- SATenstein: automatically building local search SAT solvers from components (Q2634473) (← links)
- Predicate Elimination for Preprocessing in First-Order Theorem Proving (Q2818027) (← links)
- SAT Modulo Graphs: Acyclicity (Q2938490) (← links)
- An Expressive Model for Instance Decomposition Based Parallel SAT Solvers (Q2964456) (← links)
- PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF (Q3453205) (← links)
- On Quantifying Literals in Boolean Logic and its Applications to Explainable AI (Q5026182) (← links)
- SAT-Inspired Eliminations for Superposition (Q5875949) (← links)
- Mining definitions in Kissat with Kittens (Q6056639) (← links)
- SAT-Inspired Higher-Order Eliminations (Q6135757) (← links)