{"id":"https://openalex.org/W2150307403","doi":"https://doi.org/10.1007/s10817-010-9213-y","title":"On Deciding Satisfiability by Theorem Proving with Speculative Inferences","display_name":"On Deciding Satisfiability by Theorem Proving with Speculative Inferences","publication_year":2010,"publication_date":"2010-12-21","ids":{"openalex":"https://openalex.org/W2150307403","doi":"https://doi.org/10.1007/s10817-010-9213-y","mag":"2150307403"},"language":"en","primary_location":{"id":"doi:10.1007/s10817-010-9213-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10817-010-9213-y","pdf_url":null,"source":{"id":"https://openalex.org/S99781599","display_name":"Journal of Automated Reasoning","issn_l":"0168-7433","issn":["0168-7433","1573-0670"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Automated Reasoning","raw_type":"journal-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/A5082604888","display_name":"Maria Paola Bonacina","orcid":"https://orcid.org/0000-0001-9104-2692"},"institutions":[{"id":"https://openalex.org/I119439378","display_name":"University of Verona","ror":"https://ror.org/039bp8j42","country_code":"IT","type":"education","lineage":["https://openalex.org/I119439378"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Maria Paola Bonacina","raw_affiliation_strings":["Dipartimento di Informatica, Universit\u00e0 degli Studi di Verona, Strada Le Grazie 15, 37134, Verona, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e0 degli Studi di Verona, Strada Le Grazie 15, 37134, Verona, Italy","institution_ids":["https://openalex.org/I119439378"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051586876","display_name":"Christopher S. Lynch","orcid":"https://orcid.org/0000-0001-9989-7097"},"institutions":[{"id":"https://openalex.org/I16944753","display_name":"Clarkson University","ror":"https://ror.org/03rwgpn18","country_code":"US","type":"education","lineage":["https://openalex.org/I16944753"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Christopher A. Lynch","raw_affiliation_strings":["Department of Mathematics and Computer Science, Clarkson University, Potsdam, NY, 13699-5815, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Clarkson University, Potsdam, NY, 13699-5815, USA","institution_ids":["https://openalex.org/I16944753"]}]},{"author_position":"last","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":false,"raw_author_name":"Leonardo de Moura","raw_affiliation_strings":["Microsoft Research, One Microsoft Way, Redmond, WA, 98052, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, One Microsoft Way, Redmond, WA, 98052, USA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5082604888"],"corresponding_institution_ids":["https://openalex.org/I119439378"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":5.574,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.95788823,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"47","issue":"2","first_page":"161","last_page":"189"},"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.9995999932289124,"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.9995999932289124,"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.9994000196456909,"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.9972000122070312,"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.8579318523406982},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.7269954681396484},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6826894283294678},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.6200185418128967},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5485426783561707},{"id":"https://openalex.org/keywords/horn-clause","display_name":"Horn clause","score":0.5403627753257751},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.535365104675293},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5179785490036011},{"id":"https://openalex.org/keywords/dpll-algorithm","display_name":"DPLL algorithm","score":0.4981658458709717},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4663402736186981},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.43170374631881714},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4172728955745697},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3968513607978821},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3595554232597351},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.34987109899520874},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.3023896813392639},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15188857913017273}],"concepts":[{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.8579318523406982},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.7269954681396484},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6826894283294678},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.6200185418128967},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5485426783561707},{"id":"https://openalex.org/C189790780","wikidata":"https://www.wikidata.org/wiki/Q933932","display_name":"Horn clause","level":3,"score":0.5403627753257751},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.535365104675293},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5179785490036011},{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.4981658458709717},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4663402736186981},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.43170374631881714},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4172728955745697},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3968513607978821},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3595554232597351},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.34987109899520874},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.3023896813392639},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15188857913017273},{"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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C12707504","wikidata":"https://www.wikidata.org/wiki/Q52637","display_name":"Phase-locked loop","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10817-010-9213-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10817-010-9213-y","pdf_url":null,"source":{"id":"https://openalex.org/S99781599","display_name":"Journal of Automated Reasoning","issn_l":"0168-7433","issn":["0168-7433","1573-0670"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Automated Reasoning","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.190.6238","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.190.6238","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/%7Eleonardo/JAR2010dpllSPsi.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5299999713897705,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":77,"referenced_works":["https://openalex.org/W26772505","https://openalex.org/W124433265","https://openalex.org/W169672073","https://openalex.org/W171867237","https://openalex.org/W1480909796","https://openalex.org/W1485127077","https://openalex.org/W1507112684","https://openalex.org/W1511737804","https://openalex.org/W1513699999","https://openalex.org/W1519073978","https://openalex.org/W1534896904","https://openalex.org/W1535925611","https://openalex.org/W1537601430","https://openalex.org/W1541001066","https://openalex.org/W1543051890","https://openalex.org/W1550776561","https://openalex.org/W1552077729","https://openalex.org/W1557130751","https://openalex.org/W1569747018","https://openalex.org/W1573267491","https://openalex.org/W1578446848","https://openalex.org/W1581943269","https://openalex.org/W1587191403","https://openalex.org/W1593635240","https://openalex.org/W1595962583","https://openalex.org/W1661099014","https://openalex.org/W1716633099","https://openalex.org/W1747570770","https://openalex.org/W1792111512","https://openalex.org/W1829473688","https://openalex.org/W1959256509","https://openalex.org/W1963220690","https://openalex.org/W1968386045","https://openalex.org/W1980102547","https://openalex.org/W1980250820","https://openalex.org/W1993836075","https://openalex.org/W2010001930","https://openalex.org/W2014030742","https://openalex.org/W2022846948","https://openalex.org/W2023447392","https://openalex.org/W2027211529","https://openalex.org/W2036277633","https://openalex.org/W2037085273","https://openalex.org/W2037163667","https://openalex.org/W2043314428","https://openalex.org/W2044301710","https://openalex.org/W2055477538","https://openalex.org/W2056181378","https://openalex.org/W2056241458","https://openalex.org/W2057361103","https://openalex.org/W2062897452","https://openalex.org/W2067259733","https://openalex.org/W2077429176","https://openalex.org/W2079943511","https://openalex.org/W2084417024","https://openalex.org/W2086636341","https://openalex.org/W2086747974","https://openalex.org/W2100738443","https://openalex.org/W2107965579","https://openalex.org/W2108432727","https://openalex.org/W2110780548","https://openalex.org/W2113890674","https://openalex.org/W2120926795","https://openalex.org/W2125267811","https://openalex.org/W2125967324","https://openalex.org/W2144859778","https://openalex.org/W2147832077","https://openalex.org/W2151097580","https://openalex.org/W2156915267","https://openalex.org/W2161689238","https://openalex.org/W2164778826","https://openalex.org/W2168441850","https://openalex.org/W2218792248","https://openalex.org/W2507006525","https://openalex.org/W3104411811","https://openalex.org/W4205795901","https://openalex.org/W4235130846"],"related_works":["https://openalex.org/W1868334863","https://openalex.org/W124433265","https://openalex.org/W2052519470","https://openalex.org/W1595962583","https://openalex.org/W2522982407","https://openalex.org/W2585406248","https://openalex.org/W2087931334","https://openalex.org/W1747583082","https://openalex.org/W4290087445","https://openalex.org/W2150307403"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}