{"id":"https://openalex.org/W1997110410","doi":"https://doi.org/10.1007/s10817-013-9283-8","title":"Reducing Higher-Order Theorem Proving to a Sequence of SAT Problems","display_name":"Reducing Higher-Order Theorem Proving to a Sequence of SAT Problems","publication_year":2013,"publication_date":"2013-03-14","ids":{"openalex":"https://openalex.org/W1997110410","doi":"https://doi.org/10.1007/s10817-013-9283-8","mag":"1997110410"},"language":"en","primary_location":{"id":"doi:10.1007/s10817-013-9283-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10817-013-9283-8","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/A5031812667","display_name":"Chad E. Brown","orcid":"https://orcid.org/0000-0003-4050-4361"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Chad E. Brown","raw_affiliation_strings":["Programming Systems Lab, Universit\u00e4t des Saarlandes, Campus E1 3, 66123, Saarbr\u00fccken, Germany","Programming Systems Lab, Universit\u00e4t des Saarlandes, Saarbr\u00fccken, Germany 66123#TAB#"],"affiliations":[{"raw_affiliation_string":"Programming Systems Lab, Universit\u00e4t des Saarlandes, Campus E1 3, 66123, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]},{"raw_affiliation_string":"Programming Systems Lab, Universit\u00e4t des Saarlandes, Saarbr\u00fccken, Germany 66123#TAB#","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5031812667"],"corresponding_institution_ids":["https://openalex.org/I91712215"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":3.4838,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.92635341,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"51","issue":"1","first_page":"57","last_page":"77"},"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.9998000264167786,"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.9998000264167786,"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.9987000226974487,"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.9987000226974487,"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/automated-theorem-proving","display_name":"Automated theorem proving","score":0.7343600988388062},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.7236738801002502},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.6870288848876953},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.5760396718978882},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.5224555730819702},{"id":"https://openalex.org/keywords/propositional-formula","display_name":"Propositional formula","score":0.5076867341995239},{"id":"https://openalex.org/keywords/propositional-variable","display_name":"Propositional variable","score":0.5030421614646912},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4926374554634094},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49114033579826355},{"id":"https://openalex.org/keywords/first-order-logic","display_name":"First-order logic","score":0.4858645796775818},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.4687628448009491},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.46071064472198486},{"id":"https://openalex.org/keywords/natural-deduction","display_name":"Natural deduction","score":0.453006386756897},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38339734077453613},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3321227431297302},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29851454496383667},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18442657589912415},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1278391182422638},{"id":"https://openalex.org/keywords/intermediate-logic","display_name":"Intermediate logic","score":0.09788727760314941}],"concepts":[{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.7343600988388062},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.7236738801002502},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.6870288848876953},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.5760396718978882},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.5224555730819702},{"id":"https://openalex.org/C74640108","wikidata":"https://www.wikidata.org/wiki/Q1372900","display_name":"Propositional formula","level":5,"score":0.5076867341995239},{"id":"https://openalex.org/C14523651","wikidata":"https://www.wikidata.org/wiki/Q3492863","display_name":"Propositional variable","level":4,"score":0.5030421614646912},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4926374554634094},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49114033579826355},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.4858645796775818},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.4687628448009491},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.46071064472198486},{"id":"https://openalex.org/C62073222","wikidata":"https://www.wikidata.org/wiki/Q1572108","display_name":"Natural deduction","level":2,"score":0.453006386756897},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38339734077453613},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3321227431297302},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29851454496383667},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18442657589912415},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1278391182422638},{"id":"https://openalex.org/C33203268","wikidata":"https://www.wikidata.org/wiki/Q5361594","display_name":"Intermediate logic","level":3,"score":0.09788727760314941},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10817-013-9283-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10817-013-9283-8","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"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.5899999737739563,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W26338302","https://openalex.org/W26772505","https://openalex.org/W836255558","https://openalex.org/W1514763875","https://openalex.org/W1518705996","https://openalex.org/W1520118813","https://openalex.org/W1523618566","https://openalex.org/W1573992413","https://openalex.org/W1602187006","https://openalex.org/W1689403734","https://openalex.org/W1821440096","https://openalex.org/W1955821421","https://openalex.org/W1987549075","https://openalex.org/W2046306553","https://openalex.org/W2081512679","https://openalex.org/W2106192381","https://openalex.org/W2126771288","https://openalex.org/W2137351629","https://openalex.org/W2143415975","https://openalex.org/W2188321126","https://openalex.org/W2263480042","https://openalex.org/W2561675875","https://openalex.org/W2914221638","https://openalex.org/W3102485161","https://openalex.org/W4242147496","https://openalex.org/W4250846042","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2022840750","https://openalex.org/W1492881020","https://openalex.org/W1859833606","https://openalex.org/W2045432969","https://openalex.org/W2753667555","https://openalex.org/W2373482785","https://openalex.org/W2149552919","https://openalex.org/W1969569184","https://openalex.org/W2060997531","https://openalex.org/W4387656450"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}