Boundary Points and Resolution

DOI10.1007/978-3-642-02777-2_16zbMath1247.68234OpenAlexW1604167085MaRDI QIDQ3637164

Eugene Goldberg

Publication date: 7 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02777-2_16

zbMATH Keywords

resolutionboundary pointsSAT-solverproof quality

Mathematics Subject Classification ID

Related Items (1)

Quantifier elimination by dependency sequents

Uses Software

• MiniSat
• SATO
• Chaff
• BerkMin
• PicoSAT

Cites Work

• Unnamed Item
• Unnamed Item
• Proving unsatisfiability of CNFs locally
• BerkMin: A fast and robust SAT-solver
• Resolution Is Not Automatizable Unless W[P Is Tractable]
• A Decision-Making Procedure for Resolution-Based SAT-Solvers
• On Interpolation and Automatization for Frege Systems
• Theory and Applications of Satisfiability Testing
• On Bridging Simulation and Formal Verification
• A machine program for theorem-proving
• Computer Aided Verification

This page was built for publication: Boundary Points and Resolution