Theory and Applications of Satisfiability Testing
From MaRDI portal
Publication:5714759
DOI10.1007/11527695zbMath1122.68618OpenAlexW2483910514MaRDI QIDQ5714759
Dhiraj K. Pradhan, Sathiamoorthy Subbarayan
Publication date: 16 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11527695
Related Items
On preprocessing techniques and their impact on propositional model counting ⋮ What we can learn from conflicts in propositional satisfiability ⋮ PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF ⋮ SATenstein: automatically building local search SAT solvers from components ⋮ Simulating circuit-level simplifications on CNF ⋮ SAT Modulo Graphs: Acyclicity ⋮ Automatically improving constraint models in Savile Row ⋮ On Davis-Putnam reductions for minimally unsatisfiable clause-sets ⋮ Mining definitions in Kissat with Kittens ⋮ SAT-Inspired Higher-Order Eliminations ⋮ An Expressive Model for Instance Decomposition Based Parallel SAT Solvers ⋮ Learning from conflicts in propositional satisfiability ⋮ Incremental preprocessing methods for use in BMC ⋮ Definability for model counting ⋮ Predicate Elimination for Preprocessing in First-Order Theorem Proving ⋮ NiVER ⋮ On Quantifying Literals in Boolean Logic and its Applications to Explainable AI ⋮ SAT-Inspired Eliminations for Superposition
Uses Software
