{"id":"https://openalex.org/W2070304550","doi":"https://doi.org/10.1016/s1571-0661(04)00296-8","title":"Knuth-Bendix Completion for Non-Symmetric Transitive Relations","display_name":"Knuth-Bendix Completion for Non-Symmetric Transitive Relations","publication_year":2001,"publication_date":"2001-11-01","ids":{"openalex":"https://openalex.org/W2070304550","doi":"https://doi.org/10.1016/s1571-0661(04)00296-8","mag":"2070304550"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(04)00296-8","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)00296-8","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)00296-8","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004734550","display_name":"Georg Struth","orcid":"https://orcid.org/0000-0001-9466-7815"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Georg Struth","raw_affiliation_strings":["Institut f\u00fcr Informatik, Albert-Ludwigs-Universit\u00e4t Freiburg, Georges-K\u00f6hler-Allee 52, D-79110 Freiburg i. Br., Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Albert-Ludwigs-Universit\u00e4t Freiburg, Georges-K\u00f6hler-Allee 52, D-79110 Freiburg i. Br., Germany","institution_ids":["https://openalex.org/I161046081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5004734550"],"corresponding_institution_ids":["https://openalex.org/I161046081"],"apc_list":null,"apc_paid":null,"fwci":1.6354,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.87357477,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"59","issue":"4","first_page":"341","last_page":"357"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":1.0,"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":1.0,"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.9991000294685364,"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.998199999332428,"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.8745549917221069},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.752861738204956},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6320530772209167},{"id":"https://openalex.org/keywords/chaining","display_name":"Chaining","score":0.6310468912124634},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6253268122673035},{"id":"https://openalex.org/keywords/confluence","display_name":"Confluence","score":0.546879231929779},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.459676057100296},{"id":"https://openalex.org/keywords/binary-relation","display_name":"Binary relation","score":0.4486185312271118},{"id":"https://openalex.org/keywords/equational-logic","display_name":"Equational logic","score":0.4227329194545746},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3247097134590149},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3243008255958557},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2932538688182831},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27147233486175537},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.19673335552215576},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.18106332421302795},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.15300926566123962}],"concepts":[{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.8745549917221069},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.752861738204956},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6320530772209167},{"id":"https://openalex.org/C49020025","wikidata":"https://www.wikidata.org/wiki/Q1059099","display_name":"Chaining","level":2,"score":0.6310468912124634},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6253268122673035},{"id":"https://openalex.org/C77906462","wikidata":"https://www.wikidata.org/wiki/Q1140902","display_name":"Confluence","level":2,"score":0.546879231929779},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.459676057100296},{"id":"https://openalex.org/C65180967","wikidata":"https://www.wikidata.org/wiki/Q130901","display_name":"Binary relation","level":2,"score":0.4486185312271118},{"id":"https://openalex.org/C154564781","wikidata":"https://www.wikidata.org/wiki/Q5384236","display_name":"Equational logic","level":3,"score":0.4227329194545746},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3247097134590149},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3243008255958557},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2932538688182831},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27147233486175537},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.19673335552215576},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.18106332421302795},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.15300926566123962},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s1571-0661(04)00296-8","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)00296-8","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:CiteSeerX.psu:10.1.1.20.8590","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.8590","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.informatik.uni-freiburg.de/~struth/papers/nscompletion.ps.gz","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(04)00296-8","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)00296-8","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":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.5799999833106995}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W38354667","https://openalex.org/W147971832","https://openalex.org/W1491955365","https://openalex.org/W1495098237","https://openalex.org/W1510057365","https://openalex.org/W1526639761","https://openalex.org/W1527996124","https://openalex.org/W1581520202","https://openalex.org/W1583295953","https://openalex.org/W1974817955","https://openalex.org/W1988935908","https://openalex.org/W2001146053","https://openalex.org/W2080111120","https://openalex.org/W2083977009","https://openalex.org/W2127595607","https://openalex.org/W2161578433","https://openalex.org/W2498029671","https://openalex.org/W2912818154","https://openalex.org/W4213359168","https://openalex.org/W4239054357","https://openalex.org/W6759055872"],"related_works":["https://openalex.org/W3149147109","https://openalex.org/W2350400650","https://openalex.org/W2090659419","https://openalex.org/W158305784","https://openalex.org/W2491573813","https://openalex.org/W2927789344","https://openalex.org/W1975977228","https://openalex.org/W1592756229","https://openalex.org/W2049894505","https://openalex.org/W2733058695"],"abstract_inverted_index":{"We":[0],"extend":[1],"the":[2,21,25,56],"Knuth-Bendix":[3],"completion":[4],"procedure":[5,46],"from":[6],"equational":[7],"rewriting":[8,10,88],"to":[9],"with":[11],"non-symmetric":[12],"transitive":[13],"relations":[14],"and":[15,50,72,81,84,90],"quasi-orderings.":[16],"The":[17,45],"main":[18],"differences":[19],"are":[20,40],"following:":[22],"Specification":[23],"of":[24,77,92],"general":[26],"non-ground":[27],"case":[28],"seems":[29],"beyond":[30],"first-order":[31],"logic.":[32],"It":[33],"is":[34,60],"within":[35],"that":[36],"realm":[37],"when":[38],"terms":[39],"linear":[41],"or":[42],"functions":[43],"non-monotonic.":[44],"requires":[47],"critical-pair":[48],"computations":[49],"need":[51],"not":[52,61],"terminate":[53],"even":[54],"in":[55],"ground":[57],"case.":[58],"Simplification":[59],"don't":[62],"care":[63],"non-deterministic,":[64],"but":[65],"search":[66],"based.":[67],"Applications":[68],"include":[69],"ordered":[70,73],"resolution":[71],"chaining":[74],"calculi,":[75],"development":[76],"rule-based":[78],"declarative":[79],"procedures":[80],"algorithms,":[82],"program":[83],"reachability":[85],"analysis":[86],"(in":[87],"logic)":[89],"propagation":[91],"inequality":[93],"constraints.":[94]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}