{"id":"https://openalex.org/W1564470442","doi":"https://doi.org/10.1007/978-3-642-16242-8_26","title":"Clause Elimination Procedures for CNF Formulas","display_name":"Clause Elimination Procedures for CNF Formulas","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1564470442","doi":"https://doi.org/10.1007/978-3-642-16242-8_26","mag":"1564470442"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-16242-8_26","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-16242-8_26","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/A5025921874","display_name":"Marijn J. H. Heule","orcid":"https://orcid.org/0000-0002-5587-8801"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Marijn Heule","raw_affiliation_strings":["Department of Software Technology, Delft University of Technology, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Software Technology, Delft University of Technology, The Netherlands","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081120128","display_name":"Matti J\u0084\u00e4rvisalo","orcid":"https://orcid.org/0000-0003-2572-063X"},"institutions":[{"id":"https://openalex.org/I133731052","display_name":"University of Helsinki","ror":"https://ror.org/040af2s02","country_code":"FI","type":"education","lineage":["https://openalex.org/I133731052"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Matti J\u00e4rvisalo","raw_affiliation_strings":["Department of Computer Science, University of Helsinki, Finland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Helsinki, Finland","institution_ids":["https://openalex.org/I133731052"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082596567","display_name":"Armin Biere","orcid":"https://orcid.org/0000-0001-7170-9242"},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Armin Biere","raw_affiliation_strings":["Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria"],"affiliations":[{"raw_affiliation_string":"Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria","institution_ids":["https://openalex.org/I121883995"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5025921874"],"corresponding_institution_ids":["https://openalex.org/I98358874"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":6.9002,"has_fulltext":false,"cited_by_count":69,"citation_normalized_percentile":{"value":0.97967657,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"357","last_page":"371"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9937999844551086,"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.9937999844551086,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9927999973297119,"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/T11549","display_name":"Synthetic Organic Chemistry Methods","score":0.9883000254631042,"subfield":{"id":"https://openalex.org/subfields/1605","display_name":"Organic Chemistry"},"field":{"id":"https://openalex.org/fields/16","display_name":"Chemistry"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7254771590232849},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6944378614425659},{"id":"https://openalex.org/keywords/tautology","display_name":"Tautology (logic)","score":0.6533926129341125},{"id":"https://openalex.org/keywords/transitive-reduction","display_name":"Transitive reduction","score":0.6297034025192261},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5165928602218628},{"id":"https://openalex.org/keywords/confluence","display_name":"Confluence","score":0.5152350068092346},{"id":"https://openalex.org/keywords/logical-equivalence","display_name":"Logical equivalence","score":0.5056173801422119},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.482679158449173},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.45332804322242737},{"id":"https://openalex.org/keywords/binary-decision-diagram","display_name":"Binary decision diagram","score":0.43881526589393616},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38473427295684814},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3841865062713623},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.34774887561798096},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3293871283531189},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.23536762595176697},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22247391939163208},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11133703589439392},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.07936841249465942},{"id":"https://openalex.org/keywords/propositional-variable","display_name":"Propositional variable","score":0.06337302923202515}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7254771590232849},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6944378614425659},{"id":"https://openalex.org/C166374712","wikidata":"https://www.wikidata.org/wiki/Q209555","display_name":"Tautology (logic)","level":5,"score":0.6533926129341125},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.6297034025192261},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5165928602218628},{"id":"https://openalex.org/C77906462","wikidata":"https://www.wikidata.org/wiki/Q1140902","display_name":"Confluence","level":2,"score":0.5152350068092346},{"id":"https://openalex.org/C70846408","wikidata":"https://www.wikidata.org/wiki/Q220433","display_name":"Logical equivalence","level":3,"score":0.5056173801422119},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.482679158449173},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.45332804322242737},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.43881526589393616},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38473427295684814},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3841865062713623},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.34774887561798096},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3293871283531189},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.23536762595176697},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22247391939163208},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11133703589439392},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.07936841249465942},{"id":"https://openalex.org/C14523651","wikidata":"https://www.wikidata.org/wiki/Q3492863","display_name":"Propositional variable","level":4,"score":0.06337302923202515},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"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/C33203268","wikidata":"https://www.wikidata.org/wiki/Q5361594","display_name":"Intermediate logic","level":3,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-3-642-16242-8_26","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-16242-8_26","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.172.3726","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.172.3726","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cs.helsinki.fi/matti.jarvisalo/papers/heule-jarvisalo-biere.lpar10.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.364.9421","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.364.9421","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://fmv.jku.at/papers/HeuleJarvisaloBiere-LPAR17.pdf","raw_type":"text"},{"id":"pmh:oai:freidok.uni-freiburg.de:239470","is_oa":false,"landing_page_url":"https://freidok.uni-freiburg.de/data/239470","pdf_url":null,"source":{"id":"https://openalex.org/S4306401057","display_name":"FreiDok plus (Universit\u00e4tsbibliothek Freiburg)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I161046081","host_organization_name":"University of Freiburg","host_organization_lineage":["https://openalex.org/I161046081"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logic for Programming, Artificial Intelligence, and Reasoning. - Berlin, 2010. - 357-371, ISBN: 978-3-642-16242-8","raw_type":"article_in_conference_proceedings"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.5,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W87194468","https://openalex.org/W1556434751","https://openalex.org/W1593625524","https://openalex.org/W1600869845","https://openalex.org/W1656268799","https://openalex.org/W1950282396","https://openalex.org/W1973267383","https://openalex.org/W1999823208","https://openalex.org/W2021870295","https://openalex.org/W2037395516","https://openalex.org/W2058440744","https://openalex.org/W2110920860","https://openalex.org/W2120926795","https://openalex.org/W2135117708","https://openalex.org/W2141245565","https://openalex.org/W2225800216","https://openalex.org/W4248922942"],"related_works":["https://openalex.org/W4378506732","https://openalex.org/W1482220610","https://openalex.org/W90984379","https://openalex.org/W2888125526","https://openalex.org/W2585250070","https://openalex.org/W3128141066","https://openalex.org/W4289672344","https://openalex.org/W2143556329","https://openalex.org/W2995607835","https://openalex.org/W1564470442"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}