“An Interactive SMT Tactic in Coq using Abductive Reasoning” by Haniel Barbosa, Chantal Keller, Andrew Reynolds, Arjun Viswanathan, Cesare Tinelli, and Clark Barrett. In Proceedings of 24^th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR '23), (Ruzica Piskac and Andrei Voronkov, eds.), Mar. 2023, pp. 11-22. Manizales, Columbia.
A well-known challenge in leveraging automatic theorem provers, such as satisfiability modulo theories (SMT) solvers, to discharge proof obligations from interactive theorem provers (ITPs) is determining which axioms to send to the solver together with the con- jecture to be proven. Too many axioms may confuse or clog the solver, while too few may make a theorem unprovable. When a solver fails to prove a conjecture, it is unclear to the user which case transpired. In this paper we enhance SMTCoq — an integration between the Coq ITP and the cvc5 SMT solver — with a tactic called abduce aimed at mitigating the uncertainty above. When the solver fails to prove the goal, the user may invoke abduce which will use abductive reasoning to provide facts that will allow the solver to prove the goal, if any.
BibTeX entry:
@inproceedings{BKR+23,
author = {Haniel Barbosa and Chantal Keller and Andrew Reynolds and
Arjun Viswanathan and Cesare Tinelli and Clark Barrett},
editor = {Ruzica Piskac and Andrei Voronkov},
title = {An Interactive SMT Tactic in Coq using Abductive Reasoning},
booktitle = {Proceedings of {\it 24^{th}} International Conference on
Logic for Programming, Artificial Intelligence and Reasoning (LPAR
'23)},
series = {EPiC Series in Computing},
volume = {94},
pages = {11--22},
publisher = {EasyChair},
month = mar,
year = {2023},
doi = {10.29007/432m},
note = {Manizales, Columbia},
url = {https://easychair.org/publications/paper/lNvq}
}
(This webpage was created with bibtex2web.)