{"id":"https://openalex.org/W4379193137","doi":"https://doi.org/10.29007/432m","title":"An Interactive SMT Tactic in Coq using Abductive Reasoning","display_name":"An Interactive SMT Tactic in Coq using Abductive Reasoning","publication_year":2023,"publication_date":"2023-06-03","ids":{"openalex":"https://openalex.org/W4379193137","doi":"https://doi.org/10.29007/432m"},"language":"en","primary_location":{"id":"doi:10.29007/432m","is_oa":true,"landing_page_url":"https://doi.org/10.29007/432m","pdf_url":"https://easychair.org/publications/open/lNvq","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://easychair.org/publications/open/lNvq","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000310752","display_name":"Haniel Barbosa","orcid":"https://orcid.org/0000-0003-0188-2300"},"institutions":[{"id":"https://openalex.org/I110200422","display_name":"Universidade Federal de Minas Gerais","ror":"https://ror.org/0176yjw32","country_code":"BR","type":"education","lineage":["https://openalex.org/I110200422"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Haniel Barbosa","raw_affiliation_strings":["UFMG - Universidade Federal de Minas Gerais = Federal University of Minas Gerais [Belo Horizonte, Brazil] (Av. Ant\u00f4nio Carlos, 6627, Pampulha - Belo Horizonte - MG - CEP 31270-901 BRAZIL - Brazil)"],"affiliations":[{"raw_affiliation_string":"UFMG - Universidade Federal de Minas Gerais = Federal University of Minas Gerais [Belo Horizonte, Brazil] (Av. Ant\u00f4nio Carlos, 6627, Pampulha - Belo Horizonte - MG - CEP 31270-901 BRAZIL - Brazil)","institution_ids":["https://openalex.org/I110200422"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007051267","display_name":"Chantal Keller","orcid":"https://orcid.org/0000-0002-1282-0677"},"institutions":[{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]},{"id":"https://openalex.org/I4387154672","display_name":"Laboratoire M\u00e9thodes Formelles","ror":"https://ror.org/00gdtta79","country_code":"FR","type":"facility","lineage":["https://openalex.org/I11559806","https://openalex.org/I1294671590","https://openalex.org/I277688954","https://openalex.org/I277688954","https://openalex.org/I4387154672"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Chantal Keller","raw_affiliation_strings":["Universit\u00e9 Paris-Saclay (B\u00e2timent Br\u00e9guet, 3 Rue Joliot Curie 2e \u00e9t, 91190 Gif-sur-Yvette - France)","LMF - Laboratoire M\u00e9thodes Formelles (4, avenue des Sciences, 91190, Gif-sur-Yvette - France)"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris-Saclay (B\u00e2timent Br\u00e9guet, 3 Rue Joliot Curie 2e \u00e9t, 91190 Gif-sur-Yvette - France)","institution_ids":["https://openalex.org/I277688954"]},{"raw_affiliation_string":"LMF - Laboratoire M\u00e9thodes Formelles (4, avenue des Sciences, 91190, Gif-sur-Yvette - France)","institution_ids":["https://openalex.org/I4387154672"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083954589","display_name":"Andrew Reynolds","orcid":"https://orcid.org/0000-0002-3529-8682"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew Reynolds","raw_affiliation_strings":["University of Iowa [Iowa City] (Iowa City, IA 52242 - United States)"],"affiliations":[{"raw_affiliation_string":"University of Iowa [Iowa City] (Iowa City, IA 52242 - United States)","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080974343","display_name":"Arjun Viswanathan","orcid":"https://orcid.org/0009-0005-4464-8807"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Arjun Viswanathan","raw_affiliation_strings":["University of Iowa [Iowa City] (Iowa City, IA 52242 - United States)"],"affiliations":[{"raw_affiliation_string":"University of Iowa [Iowa City] (Iowa City, IA 52242 - United States)","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046830049","display_name":"Cesare Tinelli","orcid":"https://orcid.org/0000-0002-6726-775X"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cesare Tinelli","raw_affiliation_strings":["University of Iowa [Iowa City] (Iowa City, IA 52242 - United States)"],"affiliations":[{"raw_affiliation_string":"University of Iowa [Iowa City] (Iowa City, IA 52242 - United States)","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026961968","display_name":"Clark Barrett","orcid":"https://orcid.org/0000-0002-9522-3084"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Clark Barrett","raw_affiliation_strings":["Stanford University (450 Serra Mall, Stanford, CA 94305-2004 - United States)"],"affiliations":[{"raw_affiliation_string":"Stanford University (450 Serra Mall, Stanford, CA 94305-2004 - United States)","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5000310752"],"corresponding_institution_ids":["https://openalex.org/I110200422"],"apc_list":null,"apc_paid":null,"fwci":0.5298,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.70675016,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"94","issue":null,"first_page":"11","last_page":""},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9685999751091003,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.8004710674285889},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.7876176834106445},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.7856371998786926},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7242215871810913},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6513559222221375},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.641738772392273},{"id":"https://openalex.org/keywords/proof-assistant","display_name":"Proof assistant","score":0.6390872001647949},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.6136354804039001},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.4820064604282379},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4655486047267914},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.410851389169693},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23013600707054138},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2255423665046692},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.1380407214164734}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.8004710674285889},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.7876176834106445},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.7856371998786926},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7242215871810913},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6513559222221375},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.641738772392273},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.6390872001647949},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.6136354804039001},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.4820064604282379},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4655486047267914},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.410851389169693},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23013600707054138},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2255423665046692},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.1380407214164734},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.29007/432m","is_oa":true,"landing_page_url":"https://doi.org/10.29007/432m","pdf_url":"https://easychair.org/publications/open/lNvq","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-04287029v1","is_oa":true,"landing_page_url":"https://hal.science/hal-04287029","pdf_url":"https://hal.science/hal-04287029/document","source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"24th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Jun 2023, Manizales, Colombia. pp.11-22, &#x27E8;10.29007/432m&#x27E9;","raw_type":"Conference papers"}],"best_oa_location":{"id":"doi:10.29007/432m","is_oa":true,"landing_page_url":"https://doi.org/10.29007/432m","pdf_url":"https://easychair.org/publications/open/lNvq","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G451523763","display_name":"FMitF: Track II: Strengthening the integration of the CVC4 SMT solver in the Coq proof assistant","funder_award_id":"2019348","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4379193137.pdf"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W81349459","https://openalex.org/W176283517","https://openalex.org/W1481397690","https://openalex.org/W1497978324","https://openalex.org/W1508641834","https://openalex.org/W1521904835","https://openalex.org/W1522613702","https://openalex.org/W1590649805","https://openalex.org/W1592751104","https://openalex.org/W1674186056","https://openalex.org/W1751510650","https://openalex.org/W1970168990","https://openalex.org/W1982239968","https://openalex.org/W1992012690","https://openalex.org/W2022589543","https://openalex.org/W2094878426","https://openalex.org/W2097437276","https://openalex.org/W2124145386","https://openalex.org/W2144196848","https://openalex.org/W2154984259","https://openalex.org/W2181712945","https://openalex.org/W2189959137","https://openalex.org/W2253642644","https://openalex.org/W2291662397","https://openalex.org/W2792493843","https://openalex.org/W2810160031","https://openalex.org/W2955722367","https://openalex.org/W2970244683","https://openalex.org/W3006751250","https://openalex.org/W3015951847","https://openalex.org/W3039989778","https://openalex.org/W3104094248","https://openalex.org/W4225562157","https://openalex.org/W4225922019","https://openalex.org/W4300828955","https://openalex.org/W4315630554","https://openalex.org/W4316096221"],"related_works":["https://openalex.org/W2560696689","https://openalex.org/W1524804222","https://openalex.org/W2906661256","https://openalex.org/W2213028572","https://openalex.org/W3098927713","https://openalex.org/W3026697850","https://openalex.org/W2888810578","https://openalex.org/W1505872263","https://openalex.org/W2810367355","https://openalex.org/W1945774704"],"abstract_inverted_index":{"A":[0],"well-known":[1],"challenge":[2],"in":[3],"leveraging":[4],"automatic":[5],"theorem":[6,21,56],"provers,":[7],"such":[8],"as":[9],"satisfiability":[10],"modulo":[11],"theories":[12],"(SMT)":[13],"solvers,":[14],"to":[15,28,30,38,62,69,109,123,131],"discharge":[16],"proof":[17],"obligations":[18],"from":[19],"interactive":[20],"provers":[22],"(ITPs)":[23],"is":[24,67],"determining":[25],"which":[26,72,118],"axioms":[27,43],"send":[29],"the":[31,35,48,70,85,89,102,106,111,113,129,133],"solver":[32,60,92,107,130],"together":[33],"with":[34,94],"con-":[36],"jecture":[37],"be":[39],"proven.":[40],"Too":[41],"many":[42],"may":[44,53,115],"confuse":[45],"or":[46],"clog":[47],"solver,":[49],"while":[50],"too":[51],"few":[52],"make":[54],"a":[55,59,64,95],"unprovable.":[57],"When":[58,105],"fails":[61,108],"prove":[63,110,132],"conjecture,":[65],"it":[66],"unclear":[68],"user":[71,114],"case":[73],"transpired.":[74],"In":[75],"this":[76],"paper":[77],"we":[78],"enhance":[79],"SMTCoq":[80],"\u2014":[81,93],"an":[82],"integration":[83],"between":[84],"Coq":[86],"ITP":[87],"and":[88],"cvc5":[90],"SMT":[91],"tactic":[96],"called":[97],"abduce":[98,117],"aimed":[99],"at":[100],"mitigating":[101],"uncertainty":[103],"above.":[104],"goal,":[112,134],"invoke":[116],"will":[119,127],"use":[120],"abductive":[121],"reasoning":[122],"provide":[124],"facts":[125],"that":[126],"allow":[128],"if":[135],"any.":[136]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2026-03-15T09:29:46.208133","created_date":"2025-10-10T00:00:00"}
