{"id":"https://openalex.org/W2143703311","doi":"https://doi.org/10.1109/fmcad.2006.7","title":"Ario: A Linear Integer Arithmetic Logic Solver","display_name":"Ario: A Linear Integer Arithmetic Logic Solver","publication_year":2006,"publication_date":"2006-11-01","ids":{"openalex":"https://openalex.org/W2143703311","doi":"https://doi.org/10.1109/fmcad.2006.7","mag":"2143703311"},"language":"en","primary_location":{"id":"doi:10.1109/fmcad.2006.7","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fmcad.2006.7","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 Formal Methods in Computer Aided Design","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064496079","display_name":"Hossein M. Sheini","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hossein Sheini","raw_affiliation_strings":["Electrical Engineering and Computer Science Department, University of Michigan, Ann Arbor, MI, USA","University of Michigan , USA"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science Department, University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"University of Michigan , USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077314055","display_name":"Karem A. Sakallah","orcid":"https://orcid.org/0000-0002-5819-9089"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Karem Sakallah","raw_affiliation_strings":["Electrical Engineering and Computer Science Department, University of Michigan, Ann Arbor, MI, USA","University of Michigan , USA"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science Department, University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"University of Michigan , USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5064496079"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":0.6741,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.7263763,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"47","last_page":"48"},"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.9975000023841858,"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.9847000241279602,"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/solver","display_name":"Solver","score":0.8661856055259705},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5907468795776367},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.5863285660743713},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5649642944335938},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5528964400291443},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.538611888885498},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5012462139129639},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.4801573157310486},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3832241892814636},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38286158442497253},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36757194995880127},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2835298776626587},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09620314836502075}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.8661856055259705},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5907468795776367},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.5863285660743713},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5649642944335938},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5528964400291443},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.538611888885498},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5012462139129639},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.4801573157310486},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3832241892814636},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38286158442497253},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36757194995880127},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2835298776626587},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09620314836502075}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/fmcad.2006.7","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fmcad.2006.7","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 Formal Methods in Computer Aided Design","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.124.212","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.124.212","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.umich.edu/~hsheini/papers/FMCAD06_Sheini.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.85.2586","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.2586","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.csl.sri.com/users/demoura/smt-comp/descriptions/ario.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1500991862","https://openalex.org/W1515175581","https://openalex.org/W1520105804","https://openalex.org/W1522857917","https://openalex.org/W1572868659","https://openalex.org/W1589982562","https://openalex.org/W1823736747","https://openalex.org/W2097414162","https://openalex.org/W6635207884"],"related_works":["https://openalex.org/W3176904788","https://openalex.org/W1964664152","https://openalex.org/W2578463151","https://openalex.org/W21597398","https://openalex.org/W2087572620","https://openalex.org/W1505872263","https://openalex.org/W4243317326","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W2268872489"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,51],"describe":[4],"our":[5,71,118,130],"solver":[6,82,87,99,119,131],"for":[7,60],"systems":[8,15],"of":[9,42,70,77,93,107,117],"linear":[10],"integer":[11,47,109],"arithmetic":[12],"logic.":[13],"Such":[14],"are":[16,24,44],"commonly":[17],"used":[18],"in":[19,36],"design":[20],"verification":[21],"applications":[22,39],"and":[23,83,124],"classified":[25],"under":[26],"satisfiability":[27],"modulo":[28],"theories":[29],"(SMT)":[30],"problems.":[31],"Recognizing":[32],"the":[33,40,105,112],"fact":[34],"that":[35,55,127],"many":[37],"such":[38],"majority":[41],"atoms":[43,62],"equalities":[45],"or":[46],"unit-two-variable":[48],"inequalities":[49],"(UTVPIs),":[50],"present":[52],"a":[53,64,79,84,90],"framework":[54],"integrates":[56],"specialized":[57],"theory":[58],"solvers":[59,135],"those":[61,94],"within":[63,111],"SAT":[65],"solver.":[66],"The":[67],"unique":[68],"feature":[69],"strategy":[72],"is":[73,100],"its":[74,121],"simultaneous":[75],"adoption":[76],"both":[78],"congruence-closure":[80],"equality":[81],"transitive-closure":[85],"UTVPI":[86],"to":[88,103],"find":[89],"satisfiable":[91],"set":[92],"atoms.":[95],"A":[96],"full-scale":[97],"ILP":[98],"then":[101],"utilized":[102],"check":[104],"consistency":[106],"all":[108],"constraints":[110],"solution.":[113],"Other":[114],"notable":[115],"features":[116],"include":[120],"combined":[122],"deduction":[123],"learning":[125],"schemes":[126],"collectively":[128],"make":[129],"distinct":[132],"among":[133],"similar":[134]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}