{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:27:05Z","timestamp":1725488825919},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438656"},{"type":"electronic","value":"9783540454700"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45470-5_8","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T02:38:36Z","timestamp":1186886316000},"page":"51-63","source":"Crossref","is-referenced-by-count":1,"title":["On a Generalised Logicality Theorem"],"prefix":"10.1007","author":[{"given":"Marc","family":"Aiguier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diane","family":"Bahrami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Catherine","family":"Dubois","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"8_CR1","unstructured":"M. Aiguier, D. Bahrami and C. Dubois, On the General Structure of Rewrite Proofs. Technical report, University of Evry, 2001. ftp:\/\/ftp.lami.univ-evry.fr\/pub\/publi-cations\/reports\/2001\/index.html\/lami_58.ps.gz ."},{"key":"8_CR2","first-page":"91","volume-title":"TCS","author":"E. Astesiano","year":"1995","unstructured":"E. Astesiano and M. Cerioli, Free Objects and Equational Deduction for Partial Conditional Specifications. TCS, 152(1):91\u2013138. Amsterdam: Elsevier, 1995."},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"F. Baader and T. Nipkow, Term Rewriting and All That. Cambridge University Press, 1998.","DOI":"10.1017\/CBO9781139172752"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"L. Bachmair and H. Ganzinger, Rewrite techniques for transitive relations. 9th IEEE Symposium on Logic in Computer Science, pp. 384\u2013393, 1994.","DOI":"10.1109\/LICS.1994.316051"},{"key":"8_CR5","unstructured":"F. Barbier, M\u00e9ta-r\u00e9\u00e9criture: application \u00e1 la logique des relations sp\u00e9ciales. Master thesis, University of Evry, 2001. Supervised by M. Aiguier and D. Bahrami (In french), avalaible at http:\/\/www.lami.univ-evry.fr\/~fbarbier\/recherche-fr.html"},{"key":"8_CR6","first-page":"295","volume-title":"Journal of Symbolic Computation","author":"S. Kaplan","year":"1987","unstructured":"S. Kaplan, Simplifying Conditional Term Rewriting Systems: Unification, Simplification and Confluence. Journal of Symbolic Computation, 4(3):295\u2013334. Amsterdam: Academic Press, 1987."},{"key":"8_CR7","first-page":"279","volume-title":"Journal of Symbolic Computation","author":"J. Levy","year":"1996","unstructured":"J. Levy and J. Agusti, Bi-rewriting systems. Journal of Symbolic Computation, 22(3):279\u2013314. Amsterdam: Academic Press, 1996."},{"key":"8_CR8","first-page":"73","volume-title":"TCS","author":"J. Meseguer","year":"1992","unstructured":"J. Meseguer, Conditional rewriting logic as a unified model of concurrency. TCS, 96(1):73\u2013155. Amsterdam: Elsevier, 1992."},{"key":"8_CR9","unstructured":"V. van Oostrom, Sub-Birkhoff. Draft, 13 pages, 18 December 2000, available at http:\/\/www.phil.uu.nl\/~oostrom\/publication\/rewriting.html ."},{"key":"8_CR10","unstructured":"M. Schorlemmer, On Specifying and Reasoning with Special Relations. PhD thesis, Institut d\u2019Investigaci\u00f2 en Intel.lig\u00e8ncia Artificial, University of Catalunya, 1999."},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"G. Struth, Knuth-Bendix Completion for Non-Symmetric Transitive Relations. Proceedings of the Second International Workshop on Rule-Based Programming (RULE2001), Electronic Notes in TCS, 59(4). Elsevier 2001.","DOI":"10.1016\/S1571-0661(04)00296-8"},{"key":"8_CR12","unstructured":"G. Struth, Canonical Transformations in Algebra, Universal Algebra and Logic. PhD thesis, Institut f\u00fcr Informatik, University of Saarland, 1998."},{"key":"8_CR13","first-page":"209","volume-title":"TCS","author":"T. Yamada","year":"2000","unstructured":"T. Yamada, J. Avenhaus, C. Lor\u00eda-S\u00e1enz, and A. Middeldorp, Logicality of Conditional Rewrite Systems. TCS, 236(1,2):209\u2013232. Amsterdam: Elsevier, 2000."}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence, Automated Reasoning, and Symbolic Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45470-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:53:27Z","timestamp":1556740407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45470-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438656","9783540454700"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45470-5_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}