{"id":"https://openalex.org/W1595962583","doi":"https://doi.org/10.1007/978-3-540-71070-7_40","title":"Engineering DPLL(T) + Saturation","display_name":"Engineering DPLL(T) + Saturation","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1595962583","doi":"https://doi.org/10.1007/978-3-540-71070-7_40","mag":"1595962583"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-71070-7_40","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-71070-7_40","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045859619","display_name":"Leonardo de Moura","orcid":"https://orcid.org/0000-0002-5158-4726"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Leonardo de Moura","raw_affiliation_strings":["Microsoft Research, Redmond, USA","Microsoft Research, Redmond, USA 98074#TAB#"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft Research, Redmond, USA 98074#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091080723","display_name":"Nikolaj Bj\u00f8rner","orcid":"https://orcid.org/0000-0002-1695-2810"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nikolaj Bj\u00f8rner","raw_affiliation_strings":["Microsoft Research, Redmond, USA","Microsoft Research, Redmond, USA 98074#TAB#"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft Research, Redmond, USA 98074#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5045859619"],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":4.4476,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.95167256,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"475","last_page":"490"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"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/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9994000196456909,"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/dpll-algorithm","display_name":"DPLL algorithm","score":0.9517242908477783},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.8374866247177124},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7468112707138062},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.7134817242622375},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4644849896430969},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45788633823394775},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4483982026576996},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4429699182510376},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.43730950355529785},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.4364716708660126},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3731650710105896}],"concepts":[{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.9517242908477783},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.8374866247177124},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7468112707138062},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.7134817242622375},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4644849896430969},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45788633823394775},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4483982026576996},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4429699182510376},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.43730950355529785},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.4364716708660126},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3731650710105896},{"id":"https://openalex.org/C12707504","wikidata":"https://www.wikidata.org/wiki/Q52637","display_name":"Phase-locked loop","level":3,"score":0.0},{"id":"https://openalex.org/C134652429","wikidata":"https://www.wikidata.org/wiki/Q1052698","display_name":"Jitter","level":2,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-540-71070-7_40","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-71070-7_40","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.147.7726","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.7726","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/~leonardo/z3spc.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W26772505","https://openalex.org/W184671686","https://openalex.org/W1480909796","https://openalex.org/W1507112684","https://openalex.org/W1513576223","https://openalex.org/W1557130751","https://openalex.org/W1560857865","https://openalex.org/W1569747018","https://openalex.org/W1585533089","https://openalex.org/W1780472831","https://openalex.org/W1843822920","https://openalex.org/W1860739477","https://openalex.org/W1881680935","https://openalex.org/W1959256509","https://openalex.org/W1989689843","https://openalex.org/W2022846948","https://openalex.org/W2027752737","https://openalex.org/W2055477538","https://openalex.org/W2056181378","https://openalex.org/W2084417024","https://openalex.org/W2114917372","https://openalex.org/W2121707639","https://openalex.org/W2125967324","https://openalex.org/W2132638915","https://openalex.org/W2142197905","https://openalex.org/W2479999086","https://openalex.org/W2494986075","https://openalex.org/W2798401172","https://openalex.org/W2913204979","https://openalex.org/W3098346725","https://openalex.org/W4242079953","https://openalex.org/W6633839772"],"related_works":["https://openalex.org/W2913204979","https://openalex.org/W59043292","https://openalex.org/W2914680778","https://openalex.org/W4285602010","https://openalex.org/W1868334863","https://openalex.org/W2159786179","https://openalex.org/W2585406248","https://openalex.org/W1595962583","https://openalex.org/W1572868659","https://openalex.org/W2518934056"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}