Determinization of Resolution by an Algorithm Operating on Complete Assignments

DOI10.1007/11814948_11zbMATH Open1187.68543OpenAlexW2098835807MaRDI QIDQ5756586FDOQ5756586

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

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

Mathematics Subject Classification ID

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

Cited In (7)

• Title not available (Why is that?)
• A Decision-Making Procedure for Resolution-Based SAT-Solvers
• Title not available (Why is that?)
• On Bridging Simulation and Formal Verification
• On the use of naturality in algorithmic resolution
• An overview of parallel SAT solving
• Pool resolution is NP-hard to recognize

Uses Software

• UnitWalk
• SATO
• Chaff
• BerkMin

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)