Satisfiability checking and symbolic computation

DOI10.1145/3055282.3055285zbMath1365.68478arXiv1607.06945OpenAlexW3123916761WikidataQ59590563 ScholiaQ59590563MaRDI QIDQ5268815

Bernd Becker, Stephen Forrest, Alessandro Cimatti, Alberto Griggio, Matthew England, Bruno Buchberger, Anna Maria Bigatti, Erika Ábrahám, Werner M. Seiler, John Abbott, Martin Brain, Thomas Sturm, Daniel Kroening, Pascal Fontaine, James H. Davenport

Publication date: 21 June 2017

Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.06945

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation
• Building Bridges between Symbolic Computation and Satisfiability Checking
• Real World Verification