Computing with SAT oracles: past, present and future

DOI10.1007/978-3-319-94418-0_27MaRDI QIDQ1670750zbMATH OpenOpenAlexFDO

Authors Joao Marques-Silva

Publication date 6 September 2018

Full work available at URL https://doi.org/10.1007/978-3-319-94418-0_27

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

• Satisfiability: where Theory meets Practice (Invited Talk).
• scientific article; zbMATH DE number 1903342
• scientific article; zbMATH DE number 2090309
• Propositional SAT solving
• Anatomy and empirical evaluation of modern SAT solvers

Cited in

(5)

• PySAT: a Python toolkit for prototyping with SAT oracles
• DEL-based epistemic planning: decidability and complexity
• Local search with a SAT oracle for combinatorial optimization
• scientific article; zbMATH DE number 1943828 (Why is no real title available?)
• On almost-uniform generation of SAT solutions: the power of 3-wise independent hashing

This page was built for publication: Computing with SAT oracles: past, present and future

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