An Abstract Interpretation of DPLL(T)
From MaRDI portal
Publication:2926657
DOI10.1007/978-3-642-35873-9_27zbMath1426.68249OpenAlexW2099272825MaRDI QIDQ2926657
Daniel Kroening, Vijay D'Silva, Martin Brain, Alberto Griggio, Leopold Haller
Publication date: 3 November 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-35873-9_27
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Related Items (3)
Satisfiability Modulo Theories ⋮ Deciding floating-point logic with abstract conflict driven clause learning ⋮ \textsc{OptiMathSAT}: a tool for optimization modulo theories
This page was built for publication: An Abstract Interpretation of DPLL(T)