scientific article; zbMATH DE number 5605058

zbMATH Open1169.68444MaRDI QIDQ3396552FDOQ3396552

David G. Mitchell

Publication date: 19 September 2009

Title of this publication is not available (Why is that?)

Recommendations

• A complexity analysis of the SAT problem
• scientific article; zbMATH DE number 2157028
• SAT solving with reference points
• Introduction to Mathematics of Satisfiability
• On solving word equations using SAT
• Solving SAT problems by orthogonal method

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Mechanization of proofs and logical operations (03B35)

Cited In (20)

• Title not available (Why is that?)
• SATRIX -- algorithms for Boolean satisfiability
• Title not available (Why is that?)
• Solving satisfiability problems with preferences
• BerkMin: A fast and robust SAT-solver
• Towards an efficient library for SAT: A manifesto
• Theory and Applications of Satisfiability Testing
• Visualizing SAT instances and runs of the DPLL algorithm
• Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
• SAT Modulo Graphs: Acyclicity
• Conflict-driven answer set solving: from theory to practice
• LCF-Style Propositional Simplification with BDDs and SAT Solvers
• An abstract view on optimizations in SAT and ASP
• Theory and Applications of Satisfiability Testing
• Data compression for proof replay
• An abstract view on optimizations in propositional frameworks
• Planning as satisfiability: heuristics
• Tools and Algorithms for the Construction and Analysis of Systems
• tts: a SAT-solver for small, difficult instances
• Algorithms for Solving Satisfiability Problems with Qualitative Preferences

Uses Software

• Chaff
• BerkMin

This page was built for publication:

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