An Interactive SMT Tactic in Coq using Abductive Reasoning - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

An Interactive SMT Tactic in Coq using Abductive Reasoning

Résumé

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.
Fichier principal
Vignette du fichier
LPAR_2023_paper_453.pdf (509.91 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04287029 , version 1 (15-11-2023)

Identifiants

Citer

Haniel Barbosa, Chantal Keller, Andrew Reynolds, Arjun Viswanathan, Cesare Tinelli, et al.. An Interactive SMT Tactic in Coq using Abductive Reasoning. 24th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Jun 2023, Manizales, Colombia. pp.11-22, ⟨10.29007/432m⟩. ⟨hal-04287029⟩
45 Consultations
20 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More