{"id":"https://openalex.org/W1607550340","doi":"https://doi.org/10.1007/978-3-540-73595-3_15","title":"Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic","display_name":"Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic","publication_year":2007,"publication_date":"2007-08-30","ids":{"openalex":"https://openalex.org/W1607550340","doi":"https://doi.org/10.1007/978-3-540-73595-3_15","mag":"1607550340"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-73595-3_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-73595-3_15","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://infoscience.epfl.ch/record/110254","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008699657","display_name":"Viktor Kun\u010dak","orcid":"https://orcid.org/0000-0001-7044-9522"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Viktor Kuncak","raw_affiliation_strings":["Ecole Politechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, VD, Switzerland"],"affiliations":[{"raw_affiliation_string":"Ecole Politechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, VD, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045127387","display_name":"Martin Rinard","orcid":"https://orcid.org/0000-0001-8095-8523"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martin Rinard","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA","Massachusetts Institute of Technology; ,; Cambridge MA USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology; ,; Cambridge MA USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008699657"],"corresponding_institution_ids":["https://openalex.org/I5124864"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":9.8548,"has_fulltext":false,"cited_by_count":96,"citation_normalized_percentile":{"value":0.98910851,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"215","last_page":"230"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"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.9994999766349792,"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.9966999888420105,"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/T11424","display_name":"Security and Verification in Computing","score":0.9919000267982483,"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/presburger-arithmetic","display_name":"Presburger arithmetic","score":0.9740124940872192},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.8061419725418091},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7443234324455261},{"id":"https://openalex.org/keywords/quantifier-elimination","display_name":"Quantifier elimination","score":0.5963640213012695},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.557018518447876},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5368597507476807},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5314660668373108},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.4959793984889984},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.49155744910240173},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.4850567877292633},{"id":"https://openalex.org/keywords/boolean-algebra","display_name":"Boolean algebra","score":0.4679265022277832},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4360046982765198},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4303932785987854},{"id":"https://openalex.org/keywords/quantifier","display_name":"Quantifier (linguistics)","score":0.42288607358932495},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.421420693397522},{"id":"https://openalex.org/keywords/boolean-data-type","display_name":"Boolean data type","score":0.4211844503879547},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4112928509712219},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.410586416721344},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37092188000679016},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.21608567237854004},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15936937928199768}],"concepts":[{"id":"https://openalex.org/C5852641","wikidata":"https://www.wikidata.org/wiki/Q956059","display_name":"Presburger arithmetic","level":3,"score":0.9740124940872192},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8061419725418091},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7443234324455261},{"id":"https://openalex.org/C32278780","wikidata":"https://www.wikidata.org/wiki/Q1849020","display_name":"Quantifier elimination","level":2,"score":0.5963640213012695},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.557018518447876},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5368597507476807},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5314660668373108},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.4959793984889984},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.49155744910240173},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.4850567877292633},{"id":"https://openalex.org/C39685927","wikidata":"https://www.wikidata.org/wiki/Q173183","display_name":"Boolean algebra","level":2,"score":0.4679265022277832},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4360046982765198},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4303932785987854},{"id":"https://openalex.org/C2778523021","wikidata":"https://www.wikidata.org/wiki/Q5532504","display_name":"Quantifier (linguistics)","level":2,"score":0.42288607358932495},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.421420693397522},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.4211844503879547},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4112928509712219},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.410586416721344},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37092188000679016},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.21608567237854004},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15936937928199768},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/978-3-540-73595-3_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-73595-3_15","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.120.9847","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.120.9847","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://lara.epfl.ch/~kuncak/papers/KuncakRinard07TowardsEfficientSatisfiabilityCheckingBoolean.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.73.6809","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.6809","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cag.lcs.mit.edu/~rinard/paper/cade07.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.88.9089","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.9089","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://lara.epfl.ch/~kuncak/papers/KuncakRinard07TowardsEfficientSatisfiabilityCheckingBoolean.pdf","raw_type":"text"},{"id":"pmh:oai:infoscience.epfl.ch:110254","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/110254","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"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":"","raw_type":"Text"},{"id":"pmh:oai:infoscience.tind.io:110254","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/10403","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"conference proceedings"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:110254","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/110254","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"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":"","raw_type":"Text"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.7799999713897705}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":91,"referenced_works":["https://openalex.org/W15499555","https://openalex.org/W21465768","https://openalex.org/W26772505","https://openalex.org/W58761133","https://openalex.org/W62327733","https://openalex.org/W122118143","https://openalex.org/W564848705","https://openalex.org/W566788094","https://openalex.org/W1479744988","https://openalex.org/W1480187329","https://openalex.org/W1480600454","https://openalex.org/W1483339275","https://openalex.org/W1492625571","https://openalex.org/W1502573233","https://openalex.org/W1508729034","https://openalex.org/W1511526676","https://openalex.org/W1515278398","https://openalex.org/W1521664307","https://openalex.org/W1530895745","https://openalex.org/W1537049979","https://openalex.org/W1545666019","https://openalex.org/W1549008998","https://openalex.org/W1555563750","https://openalex.org/W1564178427","https://openalex.org/W1568082255","https://openalex.org/W1571471913","https://openalex.org/W1578097867","https://openalex.org/W1582842241","https://openalex.org/W1590795174","https://openalex.org/W1603245130","https://openalex.org/W1606647729","https://openalex.org/W1608421539","https://openalex.org/W1616713489","https://openalex.org/W1655411100","https://openalex.org/W1678959094","https://openalex.org/W1731421159","https://openalex.org/W1744728944","https://openalex.org/W1783332695","https://openalex.org/W1787768633","https://openalex.org/W1800123991","https://openalex.org/W1807555267","https://openalex.org/W1834186039","https://openalex.org/W1924576632","https://openalex.org/W1970040536","https://openalex.org/W1975885036","https://openalex.org/W1991261216","https://openalex.org/W1997790035","https://openalex.org/W1997817571","https://openalex.org/W2001341021","https://openalex.org/W2001788001","https://openalex.org/W2010312047","https://openalex.org/W2017184931","https://openalex.org/W2018221833","https://openalex.org/W2026405784","https://openalex.org/W2029693536","https://openalex.org/W2060440626","https://openalex.org/W2066949643","https://openalex.org/W2069709605","https://openalex.org/W2075644848","https://openalex.org/W2082313938","https://openalex.org/W2082963442","https://openalex.org/W2086470346","https://openalex.org/W2102913701","https://openalex.org/W2103658959","https://openalex.org/W2108533001","https://openalex.org/W2112231066","https://openalex.org/W2118154221","https://openalex.org/W2118360774","https://openalex.org/W2119478850","https://openalex.org/W2124704329","https://openalex.org/W2130123502","https://openalex.org/W2131739376","https://openalex.org/W2137407595","https://openalex.org/W2140992830","https://openalex.org/W2144973245","https://openalex.org/W2148854889","https://openalex.org/W2155859037","https://openalex.org/W2156103760","https://openalex.org/W2168838065","https://openalex.org/W2259817465","https://openalex.org/W2336123333","https://openalex.org/W2460961099","https://openalex.org/W2486481314","https://openalex.org/W2561675875","https://openalex.org/W2916441570","https://openalex.org/W2951126825","https://openalex.org/W2951476444","https://openalex.org/W2988600051","https://openalex.org/W4255288880","https://openalex.org/W4285719527","https://openalex.org/W6912992434"],"related_works":["https://openalex.org/W1851760673","https://openalex.org/W3135280923","https://openalex.org/W1502387139","https://openalex.org/W2189349654","https://openalex.org/W4240446120","https://openalex.org/W2144163060","https://openalex.org/W2486424993","https://openalex.org/W1601935780","https://openalex.org/W2104988143","https://openalex.org/W3146669578"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":24},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}