{"id":"https://openalex.org/W2094830274","doi":"https://doi.org/10.1016/s1571-0661(04)00284-1","title":"Induction for termination with local strategies","display_name":"Induction for termination with local strategies","publication_year":2001,"publication_date":"2001-11-01","ids":{"openalex":"https://openalex.org/W2094830274","doi":"https://doi.org/10.1016/s1571-0661(04)00284-1","mag":"2094830274"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(04)00284-1","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)00284-1","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(04)00284-1","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027851320","display_name":"Olivier Fissore","orcid":null},"institutions":[{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Olivier Fissore","raw_affiliation_strings":["LORIA-CNRS, P 239 F-54506 Vand\u0153uvre-l\u00e8s-Nancy Cedex,"],"affiliations":[{"raw_affiliation_string":"LORIA-CNRS, P 239 F-54506 Vand\u0153uvre-l\u00e8s-Nancy Cedex,","institution_ids":["https://openalex.org/I4210121838"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015156763","display_name":"Isabelle Gnaedig","orcid":null},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Isabelle Gnaedig","raw_affiliation_strings":["LORIA-INRIA, P 239 F-54506 Vand\u0153uvre-l\u00e8s-Nancy Cedex,"],"affiliations":[{"raw_affiliation_string":"LORIA-INRIA, P 239 F-54506 Vand\u0153uvre-l\u00e8s-Nancy Cedex,","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210121838"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055776480","display_name":"Claude Kirchner","orcid":"https://orcid.org/0009-0001-6778-1791"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"H\u00e9l\u00e8ne Kirchner","raw_affiliation_strings":["LORIA-INRIA & LORIA-CNRS, P 239 F-54506 Vand\u0153uvre-l\u00e8s-Nancy Cedex,"],"affiliations":[{"raw_affiliation_string":"LORIA-INRIA & LORIA-CNRS, P 239 F-54506 Vand\u0153uvre-l\u00e8s-Nancy Cedex,","institution_ids":["https://openalex.org/I4210121838","https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5015156763","https://openalex.org/A5027851320","https://openalex.org/A5055776480"],"corresponding_institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210121838"],"apc_list":null,"apc_paid":null,"fwci":9.2756,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.97668881,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"58","issue":"2","first_page":"155","last_page":"188"},"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.9997000098228455,"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.9997000098228455,"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.9980999827384949,"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.9905999898910522,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.9445368051528931},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.7181763052940369},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.6791660189628601},{"id":"https://openalex.org/keywords/mathematical-induction","display_name":"Mathematical induction","score":0.6399975419044495},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5527950525283813},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.5132331848144531},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5051766037940979},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.48311424255371094},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4734209179878235},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4657400846481323},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.42924946546554565},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4040416479110718},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3760601878166199}],"concepts":[{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.9445368051528931},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.7181763052940369},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.6791660189628601},{"id":"https://openalex.org/C206743973","wikidata":"https://www.wikidata.org/wiki/Q178377","display_name":"Mathematical induction","level":2,"score":0.6399975419044495},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5527950525283813},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.5132331848144531},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5051766037940979},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.48311424255371094},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4734209179878235},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4657400846481323},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.42924946546554565},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4040416479110718},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3760601878166199},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s1571-0661(04)00284-1","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)00284-1","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:HAL:inria-00100418v1","is_oa":false,"landing_page_url":"https://inria.hal.science/inria-00100418","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Electronic Notes in Theoretical Computer Science, 2001, 58 (2), pp.155-188. ⟨10.1016/S1571-0661(04)00284-1⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(04)00284-1","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)00284-1","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1480168175","https://openalex.org/W1488213278","https://openalex.org/W1517760837","https://openalex.org/W1528098570","https://openalex.org/W1789859907","https://openalex.org/W1826133666","https://openalex.org/W1996804992","https://openalex.org/W2013061711","https://openalex.org/W2031825596","https://openalex.org/W2035652450","https://openalex.org/W2082314942","https://openalex.org/W2088747311","https://openalex.org/W2094830274","https://openalex.org/W2114745030","https://openalex.org/W2132750992","https://openalex.org/W2154940799","https://openalex.org/W2544881903","https://openalex.org/W2625168394","https://openalex.org/W3022794709","https://openalex.org/W4211016881"],"related_works":["https://openalex.org/W2111172916","https://openalex.org/W3176904788","https://openalex.org/W21597398","https://openalex.org/W2091617677","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W1913543287","https://openalex.org/W2268872489","https://openalex.org/W2014111643","https://openalex.org/W2963044240"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4],"a":[5,36,84],"method":[6],"for":[7],"specifically":[8],"proving":[9],"termination":[10,33],"of":[11,97],"rewriting":[12],"with":[13,55],"particular":[14],"strategies:":[15],"local":[16],"strategies":[17],"on":[18,27,31,42,48],"operators.":[19],"An":[20],"inductive":[21],"proof":[22,39],"procedure":[23],"is":[24,81,89],"proposed,":[25],"based":[26],"an":[28,73],"explicit":[29],"induction":[30,46,56,71],"the":[32,38,45,53,60,68,78,92],"property.":[34],"Given":[35],"term,":[37],"principle":[40],"relies":[41],"alternatively":[43],"applying":[44],"hypothesis":[47],"its":[49,87],"subterms,":[50],"by":[51,94],"abstracting":[52],"subterms":[54],"variables,":[57],"and":[58],"narrowing":[59],"obtained":[61],"terms":[62],"in":[63],"one":[64],"step,":[65],"according":[66],"to":[67],"strategy.":[69],"The":[70],"relation,":[72],"F":[74],"-stable":[75],"ordering":[76,98],"having":[77],"subterm":[79],"property,":[80],"not":[82],"given":[83],"priori,":[85],"but":[86],"existence":[88],"checked":[90],"along":[91],"proof,":[93],"testing":[95],"satisfiability":[96],"constraints.":[99]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}