{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T02:19:38Z","timestamp":1791253178304,"version":"4.1.0"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2014,4,4]],"date-time":"2014-04-04T00:00:00Z","timestamp":1396569600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"funder":[{"DOI":"10.13039\/501100001665","name":"French National Research Agency","doi-asserted-by":"crossref","award":["ANR-13-BS02-0005"],"award-info":[{"award-number":["ANR-13-BS02-0005"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>String rewriting systems have proved very useful to study monoids. In good\ncases, they give finite presentations of monoids, allowing computations on\nthose and their manipulation by a computer. Even better, when the presentation\nis confluent and terminating, they provide one with a notion of canonical\nrepresentative of the elements of the presented monoid. Polygraphs are a\nhigher-dimensional generalization of this notion of presentation, from the\nsetting of monoids to the much more general setting of n-categories. One of the\nmain purposes of this article is to give a progressive introduction to the\nnotion of higher-dimensional rewriting system provided by polygraphs, and\ndescribe its links with classical rewriting theory, string and term rewriting\nsystems in particular. After introducing the general setting, we will be\ninterested in proving local confluence for polygraphs presenting 2-categories\nand introduce a framework in which a finite 3-dimensional rewriting system\nadmits a finite number of critical pairs.<\/jats:p>","DOI":"10.2168\/lmcs-10(2:1)2014","type":"journal-article","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T04:40:42Z","timestamp":1415940042000},"source":"Crossref","is-referenced-by-count":12,"title":["Towards 3-Dimensional Rewriting Theory"],"prefix":"10.46298","volume":"Volume 10, Issue 2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0767-2569","authenticated-orcid":false,"given":"Samuel","family":"Mimram","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"25203","published-online":{"date-parts":[[2014,4,4]]},"reference":[{"key":"529:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/750\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/750\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T15:55:20Z","timestamp":1681228520000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/750"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,4]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-10(2:1)2014","relation":{"is-same-as":[{"id-type":"arxiv","id":"1403.4094","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1403.4094","asserted-by":"subject"}],"is-referenced-by":[{"id-type":"arxiv","id":"1505.07161","asserted-by":"subject"},{"id-type":"doi","id":"10.4204\/eptcs.183.1","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arxiv.1505.07161","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,4]]},"article-number":"750"}}