{"id":"https://openalex.org/W2090777457","doi":"https://doi.org/10.1145/2699915","title":"Optimization Modulo Theories with Linear Rational Costs","display_name":"Optimization Modulo Theories with Linear Rational Costs","publication_year":2015,"publication_date":"2015-02-17","ids":{"openalex":"https://openalex.org/W2090777457","doi":"https://doi.org/10.1145/2699915","mag":"2090777457"},"language":"en","primary_location":{"id":"doi:10.1145/2699915","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2699915","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hdl.handle.net/11572/368143","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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":true,"raw_author_name":"Roberto Sebastiani","raw_affiliation_strings":["DISI, University of Trento, Italy"],"affiliations":[{"raw_affiliation_string":"DISI, University of Trento, Italy","institution_ids":["https://openalex.org/I193223587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011995278","display_name":"Silvia Tomasi","orcid":null},"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":"Silvia Tomasi","raw_affiliation_strings":["DISI, University of Trento, Italy"],"affiliations":[{"raw_affiliation_string":"DISI, University of Trento, Italy","institution_ids":["https://openalex.org/I193223587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5088301538"],"corresponding_institution_ids":["https://openalex.org/I193223587"],"apc_list":null,"apc_paid":null,"fwci":13.8426,"has_fulltext":false,"cited_by_count":75,"citation_normalized_percentile":{"value":0.99159451,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"16","issue":"2","first_page":"1","last_page":"43"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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.9995999932289124,"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.9817000031471252,"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.9753000140190125,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.91844642162323},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6744794249534607},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6311579346656799},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.6269993185997009},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.564785897731781},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5193015933036804},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5162487030029297},{"id":"https://openalex.org/keywords/arithmetic-function","display_name":"Arithmetic function","score":0.5015525817871094},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.457193523645401},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43295779824256897},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.4309133291244507},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3452301025390625},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34459203481674194},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3430824875831604},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27078893780708313},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.11737921833992004}],"concepts":[{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.91844642162323},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6744794249534607},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6311579346656799},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.6269993185997009},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.564785897731781},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5193015933036804},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5162487030029297},{"id":"https://openalex.org/C112343008","wikidata":"https://www.wikidata.org/wiki/Q140744","display_name":"Arithmetic function","level":2,"score":0.5015525817871094},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.457193523645401},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43295779824256897},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.4309133291244507},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3452301025390625},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34459203481674194},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3430824875831604},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27078893780708313},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.11737921833992004},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/2699915","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2699915","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},{"id":"pmh:oai:eprints-phd.biblio.unitn.it:1197","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400409","display_name":"Unitn-eprints PhD (University of Trento)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193223587","host_organization_name":"University of Trento","host_organization_lineage":["https://openalex.org/I193223587"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Doctoral Thesis"},{"id":"pmh:oai:iris.unitn.it:11572/101073","is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?doid=2699915","pdf_url":null,"source":{"id":"https://openalex.org/S4306401913","display_name":"Institutional Research Information System (Universit\u00e0 degli Studi di Trento)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193223587","host_organization_name":"University of Trento","host_organization_lineage":["https://openalex.org/I193223587"],"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":"info:eu-repo/semantics/article"},{"id":"pmh:oai:iris.unitn.it:11572/368143","is_oa":true,"landing_page_url":"https://hdl.handle.net/11572/368143","pdf_url":null,"source":{"id":"https://openalex.org/S4306401913","display_name":"Institutional Research Information System (Universit\u00e0 degli Studi di Trento)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193223587","host_organization_name":"University of Trento","host_organization_lineage":["https://openalex.org/I193223587"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/doctoralThesis"}],"best_oa_location":{"id":"pmh:oai:iris.unitn.it:11572/368143","is_oa":true,"landing_page_url":"https://hdl.handle.net/11572/368143","pdf_url":null,"source":{"id":"https://openalex.org/S4306401913","display_name":"Institutional Research Information System (Universit\u00e0 degli Studi di Trento)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193223587","host_organization_name":"University of Trento","host_organization_lineage":["https://openalex.org/I193223587"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/doctoralThesis"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.5899999737739563,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":52,"referenced_works":["https://openalex.org/W54684292","https://openalex.org/W56814239","https://openalex.org/W89830494","https://openalex.org/W92576581","https://openalex.org/W111132822","https://openalex.org/W128869332","https://openalex.org/W169672073","https://openalex.org/W221832247","https://openalex.org/W1480909796","https://openalex.org/W1481397690","https://openalex.org/W1495266209","https://openalex.org/W1497481553","https://openalex.org/W1518705996","https://openalex.org/W1525980094","https://openalex.org/W1541711253","https://openalex.org/W1548812055","https://openalex.org/W1553068379","https://openalex.org/W1559664284","https://openalex.org/W1586300459","https://openalex.org/W1586677474","https://openalex.org/W1593288312","https://openalex.org/W1757313772","https://openalex.org/W1775889152","https://openalex.org/W1787074469","https://openalex.org/W1824587283","https://openalex.org/W1965970856","https://openalex.org/W1972997295","https://openalex.org/W1999997889","https://openalex.org/W2003690673","https://openalex.org/W2022846948","https://openalex.org/W2024911455","https://openalex.org/W2045622192","https://openalex.org/W2048051309","https://openalex.org/W2048230499","https://openalex.org/W2064019550","https://openalex.org/W2094530979","https://openalex.org/W2114037873","https://openalex.org/W2125967324","https://openalex.org/W2142785340","https://openalex.org/W2147600044","https://openalex.org/W2151308681","https://openalex.org/W2154984259","https://openalex.org/W2164778826","https://openalex.org/W2187435247","https://openalex.org/W2188469581","https://openalex.org/W2209708092","https://openalex.org/W2406569938","https://openalex.org/W2501499209","https://openalex.org/W2561675875","https://openalex.org/W4250871362","https://openalex.org/W4285719527","https://openalex.org/W6606921157"],"related_works":["https://openalex.org/W2578463151","https://openalex.org/W4379142300","https://openalex.org/W2810367355","https://openalex.org/W2433853642","https://openalex.org/W2275420537","https://openalex.org/W1483783534","https://openalex.org/W2048447692","https://openalex.org/W1524612439","https://openalex.org/W583460537","https://openalex.org/W2131919998"],"abstract_inverted_index":{"In":[0,22,94],"the":[1,23,95,118,134,137,143,148,164,193,216,219],"contexts":[2],"of":[3,35,65,89,120,145,166,183,218],"automated":[4],"reasoning":[5],"(AR)":[6],"and":[7,42,108,151,206],"formal":[8],"verification":[9],"(FV),":[10],"important":[11],"decision":[12],"problems":[13,88,184],"are":[14,62],"effectively":[15],"encoded":[16],"into":[17],"Satisfiability":[18],"Modulo":[19],"Theories":[20],"(SMT).":[21],"last":[24],"decade,":[25],"efficient":[26],"SMT":[27,53,70,115,126,139,152],"solvers":[28,71],"have":[29,132,155,186],"been":[30,49,187],"developed":[31],"for":[32,113,163,192],"several":[33],"theories":[34],"practical":[36],"interest":[37,90],"(e.g.,":[38],"linear":[39,121],"arithmetic,":[40],"arrays,":[41],"bit":[43],"vectors).":[44],"Surprisingly,":[45],"little":[46],"work":[47,68,96],"has":[48],"done":[50],"to":[51,54,73,116,142,178],"extend":[52],"deal":[55],"with":[56,127],"optimization":[57],"problems;":[58],"in":[59,98,147,176],"particular,":[60],"we":[61,101,154],"not":[63],"aware":[64],"any":[66],"previous":[67],"on":[69,181,211],"able":[72],"produce":[74],"solutions":[75],"that":[76,185,199],"minimize":[77],"cost":[78,123],"functions":[79],"over":[80],"arithmetical":[81],"variables.":[82],"This":[83],"is":[84,174,202],"unfortunate,":[85],"since":[86],"some":[87],"require":[91],"this":[92,99,104],"functionality.":[93],"described":[97],"article":[100],"start":[102],"filling":[103],"gap.":[105],"We":[106,131],"present":[107],"discuss":[109],"two":[110],"general":[111],"procedures":[112,135],"leveraging":[114],"handle":[117],"minimization":[119,129],"rational":[122],"functions,":[124],"combining":[125],"standard":[128],"techniques.":[130],"implemented":[133],"within":[136],"MathSAT":[138],"solver.":[140],"Due":[141],"absence":[144],"competitors":[146],"AR,":[149],"FV,":[150],"domains,":[153],"experimentally":[156],"evaluated":[157],"our":[158,179,200],"implementation":[159],"against":[160],"state-of-the-art":[161],"tools":[162,210],"domain":[165],"Linear":[167],"Generalized":[168],"Disjunctive":[169],"Programming":[170],"(LGDP)":[171],",":[172],"which":[173],"closest":[175],"spirit":[177],"domain,":[180],"sets":[182],"previously":[188],"proposed":[189],"as":[190],"benchmarks":[191],"latter":[194],"tools.":[195],"The":[196],"results":[197],"show":[198],"tool":[201],"very":[203],"competitive":[204],"with,":[205],"often":[207],"outperforms,":[208],"these":[209,212],"problems,":[213],"clearly":[214],"demonstrating":[215],"potential":[217],"approach.":[220]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":13},{"year":2017,"cited_by_count":13},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2026-03-16T09:10:04.655348","created_date":"2025-10-10T00:00:00"}