{"id":"https://openalex.org/W4415207047","doi":"https://doi.org/10.46298/lmcs-21(4:8)2025","title":"Small Term Reachability and Related Problems for Terminating Term Rewriting Systems","display_name":"Small Term Reachability and Related Problems for Terminating Term Rewriting Systems","publication_year":2025,"publication_date":"2025-10-15","ids":{"openalex":"https://openalex.org/W4415207047","doi":"https://doi.org/10.46298/lmcs-21(4:8)2025"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-21(4:8)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:8)2025","pdf_url":"https://lmcs.episciences.org/16714/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/16714/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086254817","display_name":"Franz Baader","orcid":"https://orcid.org/0000-0002-4049-221X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Franz Baader","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5025232172","display_name":"J\u00fcrgen Giesl","orcid":"https://orcid.org/0000-0003-0283-8520"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J\u00fcrgen Giesl","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13383972,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 21, Issue 4","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9984999895095825,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9984999895095825,"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/T11567","display_name":"semigroups and automata theory","score":0.9769999980926514,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9506000280380249,"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/rewriting","display_name":"Rewriting","score":0.8521000146865845},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8427000045776367},{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.8240000009536743},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.7950999736785889},{"id":"https://openalex.org/keywords/confluence","display_name":"Confluence","score":0.6589999794960022},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6050999760627747},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.5842000246047974},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4375},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.4336000084877014}],"concepts":[{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.8521000146865845},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8427000045776367},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.8240000009536743},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.7950999736785889},{"id":"https://openalex.org/C77906462","wikidata":"https://www.wikidata.org/wiki/Q1140902","display_name":"Confluence","level":2,"score":0.6589999794960022},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6050999760627747},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5842000246047974},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4966000020503998},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.460099995136261},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4447000026702881},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4375},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4336000084877014},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.3700000047683716},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.36039999127388},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.35199999809265137},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3517000079154968},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.3452000021934509},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.33820000290870667},{"id":"https://openalex.org/C2780432614","wikidata":"https://www.wikidata.org/wiki/Q864213","display_name":"Conservative extension","level":2,"score":0.3167000114917755},{"id":"https://openalex.org/C159333733","wikidata":"https://www.wikidata.org/wiki/Q7051809","display_name":"Normalization property","level":2,"score":0.3142000138759613},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.30649998784065247},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2962000072002411},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.27880001068115234},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.2705000042915344},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.26969999074935913},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.2583000063896179}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.46298/lmcs-21(4:8)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:8)2025","pdf_url":"https://lmcs.episciences.org/16714/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-21(4:8)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:8)2025","pdf_url":"https://lmcs.episciences.org/16714/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3032849772","display_name":null,"funder_award_id":"TRR 248","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G7668369193","display_name":null,"funder_award_id":"SCADS22B","funder_id":"https://openalex.org/F4320321114","funder_display_name":"Bundesministerium f\u00fcr Bildung und Forschung"},{"id":"https://openalex.org/G8768715795","display_name":"Automatische Terminierungs und Komplexit\u00e4tsanalyse imperativer Programme","funder_award_id":"235950644","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G890954746","display_name":"TRR 248: Grundlagen verst\u00e4ndlicher SoftwareSysteme  f\u00fcr eine nachvollziehbare cyberphysische Welt","funder_award_id":"389792660","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320321114","display_name":"Bundesministerium f\u00fcr Bildung und Forschung","ror":"https://ror.org/04pz7b180"},{"id":"https://openalex.org/F4320323644","display_name":"S\u00e4chsisches Staatsministerium f\u00fcr Wissenschaft und Kunst","ror":"https://ror.org/05wnef833"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4415207047.pdf","grobid_xml":"https://content.openalex.org/works/W4415207047.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Motivated":[0],"by":[1,15],"an":[2],"application":[3],"where":[4,162],"we":[5,17,24,150,163],"try":[6],"to":[7,97,110,130],"make":[8],"proofs":[9],"for":[10,89,112,132,215],"Description":[11],"Logic":[12],"inferences":[13],"smaller":[14],"rewriting,":[16],"consider":[18,151],"the":[19,26,60,66,83,128,133,141,145,152,160,187,190,199,216,219],"following":[20],"decision":[21],"problem,":[22,156,191],"which":[23,192],"call":[25],"small":[27,220],"term":[28,33,38,50,91,154,170,221],"reachability":[29,155,167,222],"problem:":[30],"given":[31],"a":[32,37,41,49,105,120,157,169],"rewriting":[34,92],"system":[35],"$R$,":[36],"$s$,":[39],"and":[40,109],"natural":[42],"number":[43,200],"$n$,":[44],"decide":[45],"whether":[46,198],"there":[47],"is":[48,85,102,202,203],"$t$":[51],"of":[52,62,68,75,123,159,168,171,189,218],"size":[53,172],"$\\leq":[54],"n$":[55],"reachable":[56],"from":[57],"$s$":[58],"using":[59,104,119],"rules":[61],"$R$.":[63],"We":[64,80],"investigate":[65],"complexity":[67,95,129,143,188,217],"this":[69,179,211],"problem":[70,84,161],"depending":[71],"on":[72,140,197],"how":[73],"termination":[74,101,115],"$R$":[76],"can":[77,116],"be":[78,117],"established.":[79],"show":[81],"that":[82,178],"in":[86,144,166,183,205],"general":[87],"NP-complete":[88],"length-reducing":[90,134],"systems.":[93],"Its":[94],"increases":[96],"N2ExpTime-complete":[98],"(NExpTime-complete)":[99],"if":[100],"proved":[103],"(linear)":[106],"polynomial":[107],"order":[108],"PSpace-complete":[111],"systems":[113],"whose":[114],"shown":[118],"restricted":[121],"class":[122],"Knuth-Bendix":[124],"orders.":[125],"Confluence":[126],"reduces":[127],"P":[131],"case,":[135],"but":[136],"has":[137],"no":[138,213],"effect":[139],"worst-case":[142],"other":[146],"two":[147],"cases.":[148],"Finally,":[149],"large":[153],"variant":[158],"are":[164],"interested":[165],"$\\geq":[173],"n$.":[174],"It":[175],"turns":[176],"out":[177],"seemingly":[180],"innocuous":[181],"modification":[182],"some":[184],"cases":[185],"changes":[186],"may":[193],"also":[194],"become":[195],"dependent":[196],"$n$":[201],"represented":[204],"unary":[206],"or":[207],"binary":[208],"encoding,":[209],"whereas":[210],"makes":[212],"difference":[214],"problem.":[223]},"counts_by_year":[],"updated_date":"2026-06-22T08:00:12.763002","created_date":"2025-10-16T00:00:00"}