EUVIMEDEUVIMED entdecken
Crossref

Machine Learning for Automated Theorem Proving: Learning to Solve SAT and QSAT

Sean B. Holden

Foundations and Trends® in Machine Learning · 22.11.2021 · 14 (6) · 807-889

DOI: 10.1561/2200000081 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Foundations and Trends® in Machine Learning, online erschienen am 22.11.2021. Verfasst von Sean B. Holden. Die Arbeit wurde bisher 20-mal zitiert (Crossref) und nennt 253 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The decision problem for Boolean satisfiability, generally referred to as SAT, is the archetypal NP-complete problem, and encodings of many problems of practical interest exist allowing them to be treated as SAT problems. Its generalization to quantified SAT (QSAT) is PSPACE-complete, and is useful for the same reason. Despite the computational complexity of SAT and QSAT, methods have been developed allowing large instances to be solved within reasonable resource constraints. These techniques have largely exploited algorithmic developments; however machine learning also exerts a significant influence in the development of state-of- the-art solvers. Here, the application of machine learning is delicate, as in many cases, even if a relevant learning problem can be solved, it may be that incorporating the result into a SAT or QSAT solver is counterproductive, because the run-time of such solvers can be sensitive to small implementation changes. The application of better machine learning methods in this area is thus an ongoing challenge, with characteristics unique to the field. This work provides a comprehensive review of the research to date on incorporating machine learning into SAT and QSAT solvers, as a resource for those interested in further advancing the field.

Zitieren

APA

Holden, S. B. (2021). Machine Learning for Automated Theorem Proving: Learning to Solve SAT and QSAT. Foundations and Trends® in Machine Learning, 14(6), 807-889. https://doi.org/10.1561/2200000081

Vancouver

Holden SB. Machine Learning for Automated Theorem Proving: Learning to Solve SAT and QSAT. Foundations and Trends® in Machine Learning. 2021;14(6):807-889. doi:10.1561/2200000081

BibTeX
@article{Holden2021,
  author = {Holden, Sean B.},
  title = {Machine Learning for Automated Theorem Proving: Learning to Solve SAT and QSAT},
  journal = {Foundations and Trends® in Machine Learning},
  year = {2021},
  volume = {14},
  number = {6},
  pages = {807--889},
  doi = {10.1561/2200000081}
}
Kostenlos starten →