{"id":"https://openalex.org/W2617878194","doi":"https://doi.org/10.2168/lmcs-8(3:3)2012","title":"Efficient Interpolant Generation in Satisfiability Modulo Linear Integer Arithmetic","display_name":"Efficient Interpolant Generation in Satisfiability Modulo Linear Integer Arithmetic","publication_year":2012,"publication_date":"2012-08-10","ids":{"openalex":"https://openalex.org/W2617878194","doi":"https://doi.org/10.2168/lmcs-8(3:3)2012","mag":"2617878194"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-8(3:3)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(3:3)2012","pdf_url":"https://lmcs.episciences.org/1033/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/1033/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038636493","display_name":"Alberto Griggio","orcid":"https://orcid.org/0000-0002-3311-0893"},"institutions":[{"id":"https://openalex.org/I2277624104","display_name":"Fondazione Bruno Kessler","ror":"https://ror.org/01j33xk10","country_code":"IT","type":"facility","lineage":["https://openalex.org/I2277624104"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Alberto Griggio","raw_affiliation_strings":["Fondazione Bruno Kessler, Trento, Italy"],"raw_orcid":"https://orcid.org/0000-0002-3311-0893","affiliations":[{"raw_affiliation_string":"Fondazione Bruno Kessler, Trento, Italy","institution_ids":["https://openalex.org/I2277624104"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011192878","display_name":"Thi Thieu Hoa Le","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thi Thieu Hoa Le","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5088301538","display_name":"Roberto Sebastiani","orcid":"https://orcid.org/0000-0002-0989-6101"},"institutions":[{"id":"https://openalex.org/I193223587","display_name":"University of Trento","ror":"https://ror.org/05trd4x28","country_code":"IT","type":"education","lineage":["https://openalex.org/I193223587"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Roberto Sebastiani","raw_affiliation_strings":["DISI, University of Trento, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DISI, University of Trento, Italy","institution_ids":["https://openalex.org/I193223587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5038636493"],"corresponding_institution_ids":["https://openalex.org/I2277624104"],"apc_list":null,"apc_paid":null,"fwci":1.3823,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.83187638,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"Volume 8, Issue 3","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9988999962806702,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.8517881631851196},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5832763910293579},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5654236078262329},{"id":"https://openalex.org/keywords/interpolation","display_name":"Interpolation (computer graphics)","score":0.5487013459205627},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5420776605606079},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.4968240559101105},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.49524107575416565},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.4640246033668518},{"id":"https://openalex.org/keywords/rational-number","display_name":"Rational number","score":0.4227268695831299},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.42161670327186584},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4082645773887634},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33765536546707153},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29791179299354553},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1625216007232666}],"concepts":[{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.8517881631851196},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5832763910293579},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5654236078262329},{"id":"https://openalex.org/C137800194","wikidata":"https://www.wikidata.org/wiki/Q11713455","display_name":"Interpolation (computer graphics)","level":3,"score":0.5487013459205627},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5420776605606079},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.4968240559101105},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.49524107575416565},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4640246033668518},{"id":"https://openalex.org/C46875033","wikidata":"https://www.wikidata.org/wiki/Q1244890","display_name":"Rational number","level":2,"score":0.4227268695831299},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.42161670327186584},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4082645773887634},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33765536546707153},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29791179299354553},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1625216007232666},{"id":"https://openalex.org/C502989409","wikidata":"https://www.wikidata.org/wiki/Q11425","display_name":"Animation","level":2,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2168/lmcs-8(3:3)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(3:3)2012","pdf_url":"https://lmcs.episciences.org/1033/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1010.4422","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1010.4422","pdf_url":"https://arxiv.org/pdf/1010.4422","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:b7b60ed5204442f3ac07d06603df91e2","is_oa":true,"landing_page_url":"https://doaj.org/article/b7b60ed5204442f3ac07d06603df91e2","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 8, Issue 3 (2012)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-8(3:3)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(3:3)2012","pdf_url":"https://lmcs.episciences.org/1033/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2271161947","display_name":null,"funder_award_id":"226070","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G3817409036","display_name":null,"funder_award_id":"PCOFUND-GA-2008-226070","funder_id":"https://openalex.org/F4320326086","funder_display_name":"Provincia Autonoma di Trento"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320326086","display_name":"Provincia Autonoma di Trento","ror":"https://ror.org/017e99q89"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2617878194.pdf","grobid_xml":"https://content.openalex.org/works/W2617878194.grobid-xml"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W276224435","https://openalex.org/W1500752789","https://openalex.org/W1510368738","https://openalex.org/W1516304047","https://openalex.org/W1528301227","https://openalex.org/W1541391869","https://openalex.org/W1545415851","https://openalex.org/W1551465820","https://openalex.org/W1565898282","https://openalex.org/W1582116296","https://openalex.org/W1882377980","https://openalex.org/W1963547452","https://openalex.org/W2003690673","https://openalex.org/W2008863752","https://openalex.org/W2044095368","https://openalex.org/W2080841971","https://openalex.org/W2084294613","https://openalex.org/W2097699872","https://openalex.org/W2098467159","https://openalex.org/W2108174021","https://openalex.org/W2114754094","https://openalex.org/W2125967324","https://openalex.org/W2133527541","https://openalex.org/W2137351629","https://openalex.org/W2151463894","https://openalex.org/W2159786179","https://openalex.org/W2188469581","https://openalex.org/W4212792638","https://openalex.org/W4230270073","https://openalex.org/W4236684541","https://openalex.org/W4242333425","https://openalex.org/W4245630182","https://openalex.org/W4246015842","https://openalex.org/W4301808069","https://openalex.org/W6628836516","https://openalex.org/W6631721999"],"related_works":["https://openalex.org/W2578463151","https://openalex.org/W4281812495","https://openalex.org/W2810367355","https://openalex.org/W2293855260","https://openalex.org/W2275420537","https://openalex.org/W1483783534","https://openalex.org/W4379142300","https://openalex.org/W2155162307","https://openalex.org/W4386723279","https://openalex.org/W2048447692"],"abstract_inverted_index":{"The":[0],"problem":[1,73],"of":[2,15,35,39,64,74,84,98,128,137,145,148],"computing":[3],"Craig":[4],"interpolants":[5],"in":[6,21,152],"SAT":[7],"and":[8,41,49,52,81,115],"SMT":[9,155],"has":[10],"recently":[11],"received":[12],"a":[13,117],"lot":[14],"interest,":[16],"mainly":[17],"for":[18,26,32,89,121],"its":[19],"applications":[20],"formal":[22],"verification.":[23],"Efficient":[24],"algorithms":[25],"interpolant":[27,77,87],"generation":[28],"have":[29],"been":[30],"presented":[31],"some":[33],"theories":[34],"interest":[36],"---including":[37],"that":[38],"equality":[40],"uninterpreted":[42],"functions,":[43],"linear":[44,65],"arithmetic":[45,66],"over":[46,67],"the":[47,62,68,72,82,90,96,125,135,149,153],"rationals,":[48],"their":[50],"combination---":[51],"they":[53],"are":[54],"successfully":[55],"used":[56],"within":[57],"model":[58],"checking":[59],"tools.":[60],"For":[61],"theory":[63,92],"integers":[69],"(LA(Z)),":[70],"however,":[71],"finding":[75],"an":[76,141],"is":[78,94],"more":[79],"challenging,":[80],"task":[83],"developing":[85],"efficient":[86],"generators":[88],"full":[91,126],"LA(Z)":[93],"still":[95],"objective":[97],"ongoing":[99],"research.":[100],"In":[101],"this":[102,108],"paper":[103],"we":[104],"try":[105],"to":[106],"close":[107],"gap.":[109],"We":[110,133],"build":[111],"on":[112],"previous":[113],"work":[114],"present":[116],"novel":[118],"interpolation":[119],"algorithm":[120,151],"SMT(LA(Z)),":[122],"which":[123],"exploits":[124],"power":[127],"current":[129],"state-of-the-art":[130],"SMT(LA(Z))":[131],"solvers.":[132],"demonstrate":[134],"potential":[136],"our":[138,146],"approach":[139],"with":[140],"extensive":[142],"experimental":[143],"evaluation":[144],"implementation":[147],"proposed":[150],"MathSAT":[154],"solver.":[156]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2017-06-05T00:00:00"}