{"id":"https://openalex.org/W2130826366","doi":"https://doi.org/10.3233/sat190011","title":"Interpolant based Decision Procedure for Quantifier-Free Presburger Arithmetic","display_name":"Interpolant based Decision Procedure for Quantifier-Free Presburger Arithmetic","publication_year":2007,"publication_date":"2007-05-01","ids":{"openalex":"https://openalex.org/W2130826366","doi":"https://doi.org/10.3233/sat190011","mag":"2130826366"},"language":"en","primary_location":{"id":"doi:10.3233/sat190011","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190011","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190011?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190011","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190011?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190011","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041084431","display_name":"Shuvendu K. Lahiri","orcid":"https://orcid.org/0000-0002-4446-4777"},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Shuvendu K. Lahiri","raw_affiliation_strings":["Microsoft Research, Redmond. E-mail:\u00a0shuvendu@microsoft.com"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond. E-mail:\u00a0shuvendu@microsoft.com","institution_ids":["https://openalex.org/I4210164937"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029880614","display_name":"Krishna K. Mehra","orcid":null},"institutions":[{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Krishna K. Mehra","raw_affiliation_strings":["Microsoft Research India, Bangalore. E-mail:\u00a0kmehra@microsoft.com"],"affiliations":[{"raw_affiliation_string":"Microsoft Research India, Bangalore. E-mail:\u00a0kmehra@microsoft.com","institution_ids":["https://openalex.org/I4210124949"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5041084431"],"corresponding_institution_ids":["https://openalex.org/I4210164937"],"apc_list":null,"apc_paid":null,"fwci":1.1207,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.79651839,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"1","issue":"3-4","first_page":"187","last_page":"207"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":1.0,"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":1.0,"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.9980999827384949,"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.9944999814033508,"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/presburger-arithmetic","display_name":"Presburger arithmetic","score":0.9612659215927124},{"id":"https://openalex.org/keywords/quantifier","display_name":"Quantifier (linguistics)","score":0.7838025093078613},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.646378219127655},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4624057114124298},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45806601643562317},{"id":"https://openalex.org/keywords/quantifier-elimination","display_name":"Quantifier elimination","score":0.4445052146911621},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3095766603946686},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21120992302894592},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.18889346718788147}],"concepts":[{"id":"https://openalex.org/C5852641","wikidata":"https://www.wikidata.org/wiki/Q956059","display_name":"Presburger arithmetic","level":3,"score":0.9612659215927124},{"id":"https://openalex.org/C2778523021","wikidata":"https://www.wikidata.org/wiki/Q5532504","display_name":"Quantifier (linguistics)","level":2,"score":0.7838025093078613},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.646378219127655},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4624057114124298},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45806601643562317},{"id":"https://openalex.org/C32278780","wikidata":"https://www.wikidata.org/wiki/Q1849020","display_name":"Quantifier elimination","level":2,"score":0.4445052146911621},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3095766603946686},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21120992302894592},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.18889346718788147}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3233/sat190011","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190011","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190011?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190011","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.153.3611","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.3611","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.microsoft.com/pubs/70216/tr-2005-121.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.86.9720","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.9720","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.microsoft.com/~shuvendu/papers/jsat-eazi.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.3233/sat190011","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190011","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190011?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190011","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.7799999713897705}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2130826366.pdf","grobid_xml":"https://content.openalex.org/works/W2130826366.grobid-xml"},"referenced_works_count":46,"referenced_works":["https://openalex.org/W323309086","https://openalex.org/W1489527380","https://openalex.org/W1490156001","https://openalex.org/W1498734916","https://openalex.org/W1500991862","https://openalex.org/W1510368738","https://openalex.org/W1515930456","https://openalex.org/W1520105804","https://openalex.org/W1534850143","https://openalex.org/W1568333198","https://openalex.org/W1589982562","https://openalex.org/W1592502301","https://openalex.org/W1747583082","https://openalex.org/W1823736747","https://openalex.org/W1838348862","https://openalex.org/W1993836075","https://openalex.org/W2055477538","https://openalex.org/W2057361103","https://openalex.org/W2062897452","https://openalex.org/W2069748505","https://openalex.org/W2098244894","https://openalex.org/W2100126165","https://openalex.org/W2103658959","https://openalex.org/W2124682870","https://openalex.org/W2129874841","https://openalex.org/W2151463894","https://openalex.org/W2162284942","https://openalex.org/W2165775376","https://openalex.org/W2752885492","https://openalex.org/W3145128584","https://openalex.org/W4233090747","https://openalex.org/W4241223029","https://openalex.org/W4251447274","https://openalex.org/W4256147943","https://openalex.org/W4285719527","https://openalex.org/W4298335305","https://openalex.org/W6629352142","https://openalex.org/W6629435544","https://openalex.org/W6638582322","https://openalex.org/W6648671313","https://openalex.org/W6664373103","https://openalex.org/W6664827099","https://openalex.org/W6682276045","https://openalex.org/W6683744938","https://openalex.org/W6814292443","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W4214737172","https://openalex.org/W1851760673","https://openalex.org/W1992963060","https://openalex.org/W3012938552","https://openalex.org/W2170779139","https://openalex.org/W1541391869","https://openalex.org/W3135280923","https://openalex.org/W2400855043","https://openalex.org/W2097821910","https://openalex.org/W2049924983"],"abstract_inverted_index":{"Recently,":[0],"off-the-shelf":[1],"Boolean":[2],"SAT":[3],"solvers":[4],"have":[5],"been":[6],"used":[7],"to":[8],"construct":[9],"ground":[10],"decision":[11],"procedures":[12],"for":[13],"various":[14],"theories,":[15],"including":[16],"Quantifier-Free":[17],"Presburger":[18],"(QFP)":[19],"arithmetic.":[20],"One":[21],"such":[22],"approach":[23],"(often":[24],"called":[25],"the":[26],"eager":[27],"approach)":[28],"is":[29],"based":[30],"on":[31],"a":[32],"satisfia":[33]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}