Determinization of Resolution by an Algorithm Operating on Complete Assignments

DOI10.1007/11814948_11MaRDI QIDQ5756586zbMATH OpenOpenAlexFDO

Authors Eugene Goldberg

Publication date 4 September 2007

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

Full work available at URL https://doi.org/10.1007/11814948_11

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 5542984
• A Decision-Making Procedure for Resolution-Based SAT-Solvers
• Complexity results on DPLL and resolution
• The Completeness of Propositional Resolution: A Simple and Constructive Proof
• On the power of clause-learning SAT solvers as resolution engines

Cited in

(7)

• scientific article; zbMATH DE number 5542984 (Why is no real title available?)
• A Decision-Making Procedure for Resolution-Based SAT-Solvers
• scientific article; zbMATH DE number 849903 (Why is no real title available?)
• On the use of naturality in algorithmic resolution
• On Bridging Simulation and Formal Verification
• An overview of parallel SAT solving
• Pool resolution is NP-hard to recognize

Describes a project that uses

Uses Software

• BerkMin
• Chaff
• SATO
• UnitWalk

This page was built for publication: Determinization of Resolution by an Algorithm Operating on Complete Assignments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756586)