Lookahead-Based SMT Solving

DOI10.29007/GZZFMaRDI QIDQ5222970zbMATH OpenOpenAlexFDO

Authors Antti E. J. Hyvärinen, Matteo Marescotti, Parvin Sadigova, Hana Chockler, Natasha Sharygina

Publication date 4 July 2019

Published in EPiC Series in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.29007/gzzf

zbMATH Keywords

SMT solvingclause learninglookahead heuristic

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Principles and Practice of Constraint Programming – CP 2004
• Induction for SMT solvers
• Logic Programming and Nonmonotonic Reasoning
• On look-ahead heuristics in disjunctive logic programming
• Looking-ahead in backtracking algorithms for abstract argumentation
• SMT-Solvers in Action: Encoding and Solving Selected Problems in NP and EXPTIME

Cited in

(1)

• Logic Programming and Nonmonotonic Reasoning

This page was built for publication: Lookahead-Based SMT Solving

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