{"id":"https://openalex.org/W2081479337","doi":"https://doi.org/10.1007/s10817-010-9211-0","title":"SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs","display_name":"SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs","publication_year":2010,"publication_date":"2010-12-15","ids":{"openalex":"https://openalex.org/W2081479337","doi":"https://doi.org/10.1007/s10817-010-9211-0","mag":"2081479337"},"language":"en","primary_location":{"id":"doi:10.1007/s10817-010-9211-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10817-010-9211-0","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/A5063747415","display_name":"Michael Codish","orcid":"https://orcid.org/0000-0003-0394-5854"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Michael Codish","raw_affiliation_strings":["Department of Computer Science, Ben-Gurion University of the Negev, PoB 653, Beer-Sheva, 84105, Israel","Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel 84105"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Ben-Gurion University of the Negev, PoB 653, Beer-Sheva, 84105, Israel","institution_ids":["https://openalex.org/I124227911"]},{"raw_affiliation_string":"Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel 84105","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025232172","display_name":"J\u00fcrgen Giesl","orcid":"https://orcid.org/0000-0003-0283-8520"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"J\u00fcrgen Giesl","raw_affiliation_strings":["LuFG Informatik 2, RWTH Aachen University, Ahornstr. 55, 52074, Aachen, Germany","LuFG Informatik 2, RWTH Aachen University, Aachen, Germany 52074"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LuFG Informatik 2, RWTH Aachen University, Ahornstr. 55, 52074, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]},{"raw_affiliation_string":"LuFG Informatik 2, RWTH Aachen University, Aachen, Germany 52074","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058200123","display_name":"Peter Schneider\u2013Kamp","orcid":"https://orcid.org/0000-0003-4000-5570"},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Peter Schneider-Kamp","raw_affiliation_strings":["Department of Mathematics & Computer Science, University of Southern Denmark, Campusvej 55, 5230, Odense M, Denmark","Department of Mathematics and Computer Science, University of Southern Denmark, Odense M, Denmark 5230"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics & Computer Science, University of Southern Denmark, Campusvej 55, 5230, Odense M, Denmark","institution_ids":["https://openalex.org/I177969490"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Odense M, Denmark 5230","institution_ids":["https://openalex.org/I177969490"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078037586","display_name":"Ren\u00e9 Thiemann","orcid":"https://orcid.org/0000-0002-0323-8829"},"institutions":[{"id":"https://openalex.org/I190249584","display_name":"Universit\u00e4t Innsbruck","ror":"https://ror.org/054pv6659","country_code":"AT","type":"education","lineage":["https://openalex.org/I190249584"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Ren\u00e9 Thiemann","raw_affiliation_strings":["Institute of Computer Science, University of Innsbruck, Techniker Str. 21a, 6020, Innsbruck, Austria","Institute of Computer Science, University of Innsbruck, Innsbruck, Austria 6020"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Innsbruck, Techniker Str. 21a, 6020, Innsbruck, Austria","institution_ids":["https://openalex.org/I190249584"]},{"raw_affiliation_string":"Institute of Computer Science, University of Innsbruck, Innsbruck, Austria 6020","institution_ids":["https://openalex.org/I190249584"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5025232172"],"corresponding_institution_ids":["https://openalex.org/I887968799"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.3776,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.84939935,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"49","issue":"1","first_page":"53","last_page":"93"},"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.9979000091552734,"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.9979000091552734,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9976999759674072,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9976000189781189,"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/multiset","display_name":"Multiset","score":0.9142158031463623},{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.729870617389679},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.618423342704773},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6044411063194275},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5798858404159546},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5189637541770935},{"id":"https://openalex.org/keywords/dpll-algorithm","display_name":"DPLL algorithm","score":0.48073244094848633},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.461618036031723},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45709696412086487},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.4287329614162445},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39703238010406494},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3895415663719177},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35651206970214844},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3480255603790283},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.24008452892303467},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.0970124900341034}],"concepts":[{"id":"https://openalex.org/C2779623528","wikidata":"https://www.wikidata.org/wiki/Q864377","display_name":"Multiset","level":2,"score":0.9142158031463623},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.729870617389679},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.618423342704773},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6044411063194275},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5798858404159546},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5189637541770935},{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.48073244094848633},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.461618036031723},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45709696412086487},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.4287329614162445},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39703238010406494},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3895415663719177},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35651206970214844},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3480255603790283},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.24008452892303467},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0970124900341034},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"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/C12707504","wikidata":"https://www.wikidata.org/wiki/Q52637","display_name":"Phase-locked loop","level":3,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s10817-010-9211-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10817-010-9211-0","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:sdu.dk:openaire_cris_publications/ae732c2a-9fc6-4ba9-a9a4-f019622e20cc","is_oa":false,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/ae732c2a-9fc6-4ba9-a9a4-f019622e20cc","pdf_url":null,"source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Codish, M, Giesl, J, Schneider-Kamp, P & Thiemann, R 2012, 'SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs', Journal of Automated Reasoning, vol. 49, no. 1, pp. 53-93. https://doi.org/10.1007/s10817-010-9211-0","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.186.7933","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.7933","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cl-informatik.uibk.ac.at/%7Ethiemann/paper/JAR10RPO.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.308.7103","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.308.7103","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://verify.rwth-aachen.de/giesl/papers/RPO-Journal-distribute.pdf","raw_type":"text"},{"id":"pmh:oai:publications.rwth-aachen.de:195090","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/record/195090","pdf_url":null,"source":{"id":"https://openalex.org/S4306401362","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of automated reasoning 49(1), 53-93 (2012). doi:10.1007/s10817-010-9211-0","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.5699999928474426,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W91193428","https://openalex.org/W1484559376","https://openalex.org/W1489107600","https://openalex.org/W1497075744","https://openalex.org/W1507237133","https://openalex.org/W1508261706","https://openalex.org/W1531034707","https://openalex.org/W1540443495","https://openalex.org/W1543075099","https://openalex.org/W1578701395","https://openalex.org/W1582592616","https://openalex.org/W1583295953","https://openalex.org/W1629587635","https://openalex.org/W1820313840","https://openalex.org/W1994958005","https://openalex.org/W1996522627","https://openalex.org/W2001932052","https://openalex.org/W2024390796","https://openalex.org/W2028065013","https://openalex.org/W2055043227","https://openalex.org/W2055323844","https://openalex.org/W2066911265","https://openalex.org/W2077827857","https://openalex.org/W2086747974","https://openalex.org/W2090855107","https://openalex.org/W2099083823","https://openalex.org/W2116758077","https://openalex.org/W2133527541","https://openalex.org/W2133652069","https://openalex.org/W2136514805","https://openalex.org/W2144407603","https://openalex.org/W2147996890","https://openalex.org/W2164290630","https://openalex.org/W2168096396","https://openalex.org/W2605289564","https://openalex.org/W2911880377","https://openalex.org/W2913313741","https://openalex.org/W2913551129","https://openalex.org/W4230919050","https://openalex.org/W4231565824","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2188821552","https://openalex.org/W2007316622","https://openalex.org/W2408711288","https://openalex.org/W1024451821","https://openalex.org/W2094368841","https://openalex.org/W2048447692","https://openalex.org/W1615988984","https://openalex.org/W2128006027","https://openalex.org/W302791680","https://openalex.org/W2142281466"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}