scientific article; zbMATH DE number 5605058

MaRDI QIDQ3396552zbMATH OpenFDO

Authors David G. Mitchell

Publication date 19 September 2009

Mathematics Subject Classification ID

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

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

Cited in

(33)

• Data compression for proof replay
• A BDD SAT solver for satisfiability testing: An industrial case study
• Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
• PySAT: a Python toolkit for prototyping with SAT oracles
• Conflict-driven answer set solving: from theory to practice
• An abstract view on optimizations in SAT and ASP
• Visualizing SAT instances and runs of the DPLL algorithm
• BerkMin: A fast and robust SAT-solver
• Towards an efficient library for SAT: A manifesto
• TG-Pro: A SAT-based ATPG system
• Algorithms for Solving Satisfiability Problems with Qualitative Preferences
• SAT modulo graphs: acyclicity
• Efficient SAT engines for concise logics: accelerating proof search for zero-one linear constraint systems
• LCF-Style Propositional Simplification with BDDs and SAT Solvers
• Boolean satisfiability and EDA applications
• SATRIX -- algorithms for Boolean satisfiability
• Planning as satisfiability: heuristics
• tts: a SAT-solver for small, difficult instances
• scientific article; zbMATH DE number 1798189 (Why is no real title available?)
• scientific article; zbMATH DE number 1903356 (Why is no real title available?)
• Implementing efficient All solutions SAT solvers
• Scalable error detection using Boolean satisfiability
• Tools and Algorithms for the Construction and Analysis of Systems
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Applying modern SAT-solvers to solving hard problems
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Solving satisfiability problems with preferences
• An abstract view on optimizations in propositional frameworks
• On the configuration of more and less expressive logic programs
• Formalization and implementation of modern SAT solvers
• SAT-solving in practice, with a tutorial example from supervisory control

Describes a project that uses

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)