Applying modern SAT-solvers to solving hard problems

DOI10.3233/FI-2019-1788MaRDI QIDQ5377330zbMATH OpenOpenAlexWikidataFDO

Authors Artur Niewiadomski, Piotr Switalski, Teofil Sidoruk, Wojciech Penczek

Publication date 24 May 2019

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2019-1788

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• SMT-Solvers in Action: Encoding and Solving Selected Problems in NP and EXPTIME
• scientific article; zbMATH DE number 5605058
• scientific article; zbMATH DE number 956858
• Present and Future of Practical SAT Solving
• BerkMin: A fast and robust SAT-solver

Cited in

(7)

• Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition
• URSA: a system for uniform reduction to SAT
• scientific article; zbMATH DE number 5575002 (Why is no real title available?)
• Solving constraint satisfaction problems with SAT modulo theories
• Parallel algorithms for minimal nondeterministic finite automata inference
• SAT-Based Analysis of Cellular Automata
• Theory and Applications of Satisfiability Testing

This page was built for publication: Applying modern SAT-solvers to solving hard problems

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