{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:49:41Z","timestamp":1725475781548},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677789"},{"type":"electronic","value":"9783540449805"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10721975_7","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T15:43:04Z","timestamp":1167406984000},"page":"95-109","source":"Crossref","is-referenced-by-count":5,"title":["Normal Forms and Reduction for Theories of Binary Relations"],"prefix":"10.1007","author":[{"given":"Dan","family":"Dougherty","sequence":"first","affiliation":[]},{"given":"Claudio","family":"Guti\u00e9rrez","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/BF01225472","volume":"33","author":"H. Andr\u00e9ka","year":"1995","unstructured":"Andr\u00e9ka, H., Bredikhin, D.A.: The equational theory of union-free algebras of relations. Algebra Universalis\u00a033, 516\u2013532 (1995)","journal-title":"Algebra Universalis"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/3-540-57499-9_15","volume-title":"Formal Program Development","author":"R.C. Backhouse","year":"1993","unstructured":"Backhouse, R.C., Hoogendijk, P.F.: Elements of a relational theory of datatypes. In: M\u00f6ller, B., Schuman, S., Partsch, H. (eds.) Formal Program Development. LNCS, vol.\u00a0755, pp. 7\u201342. Springer, Heidelberg (1993)"},{"volume-title":"Logical Reasoning with Diagrams","year":"1996","key":"7_CR3","unstructured":"Barwise, J., Allwein, G. (eds.): Logical Reasoning with Diagrams. Oxford University Press, Oxford (1996)"},{"key":"7_CR4","volume-title":"Algebra of Programming","author":"R. Bird","year":"1997","unstructured":"Bird, R., de Moor, O.: Algebra of Programming. Prentice Hall, Englewood Cliffs (1997)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Brink, C., Kahl, W., Schmidt, G. (eds.): Relational Methods in Computer Science. Advances in Computing. Springer, Wien, New York (1997) ISBN 3-211-82971-7","DOI":"10.1007\/978-3-7091-6510-2"},{"key":"7_CR6","volume-title":"Logic Programming","author":"P. Broome","year":"1994","unstructured":"Broome, P., Lipton, J.: Combinatory logic programming: computing in relation calculi. In: Bruynooghe, M. (ed.) Logic Programming, MIT Press, Cambridge (1994)"},{"key":"7_CR7","first-page":"372","volume-title":"Logic in Computer Science","author":"C. Brown","year":"1994","unstructured":"Brown, C., Hutton, G.: Categories, allegories and circuit design. In: Logic in Computer Science, pp. 372\u2013381. IEEE Computer Society Press, Los Alamitos (1994)"},{"issue":"10","key":"7_CR8","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C.A.R. Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. CACM\u00a012(10), 576\u2013583 (1969)","journal-title":"CACM"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0167-6423(95)00025-9","volume":"26","author":"S. Curtis","year":"1996","unstructured":"Curtis, S., Lowe, G.: Proofs with graphs. Science of Computer Programming\u00a026, 197\u2013216 (1996)","journal-title":"Science of Computer Programming"},{"key":"7_CR10","first-page":"167","volume-title":"Automata, Languages and Programming","author":"J.W. Bakker De","year":"1973","unstructured":"De Bakker, J.W., De Roever, W.P.: A calculus for recursive program schemes. In: Nivat, M. (ed.) Automata, Languages and Programming, pp. 167\u2013196. North-Holland, Amsterdam (1973)"},{"key":"7_CR11","first-page":"331","volume":"10","author":"A. Morgan De","year":"1860","unstructured":"De Morgan, A.: On the syllogism, no. IV, and on the logic of relations. Transactions of the Cambridge Philosophical Society\u00a010, 331\u2013358 (1860)","journal-title":"Transactions of the Cambridge Philosophical Society"},{"key":"7_CR12","volume-title":"Categories and Allegories. North-Holland Mathematical Library","author":"P. Freyd","year":"1990","unstructured":"Freyd, P., Scedrov, A.: Categories and Allegories. North-Holland Mathematical Library, vol.\u00a039. North-Holland, Amsterdam (1990)"},{"key":"7_CR13","unstructured":"Guti\u00e9rrez, C.: Normal forms for connectedness in categories. Annals of pure and applied logic. Special issue devoted to the XI Simposio Latinoamericano de Logica Matematica, Venezuela (July 1998) (to appear)"},{"key":"7_CR14","unstructured":"Guti\u00e9rrez, C.: The Arithmetic and Geometry of Allegories: normal forms and complexity of a fragment of the theory of relations. PhD thesis, Wesleyan University (1999)"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1090\/S0273-0979-1987-15483-8","volume":"16","author":"M. Haiman","year":"1987","unstructured":"Haiman, M.: Arguesian lattics which are not linear. Bull. Amer. Math. Soc.\u00a016, 121\u2013123 (1987)","journal-title":"Bull. Amer. Math. Soc."},{"key":"7_CR16","unstructured":"Hutton, G., Meijer, E., Voermans, E.: A tool for relational programmers. Distributed on the mathematics of programming electronic mailing list (January 1994), http:\/\/www.cs.nott.ac.uk\/gmh\/allegories.gs"},{"issue":"3-4","key":"7_CR17","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0020-0255(99)00018-3","volume":"119","author":"W. Kahl","year":"1999","unstructured":"Kahl, W.: Relational matching for graphical calculi of relations. Journal of Information Science\u00a0119(3-4), 253\u2013273 (1999)","journal-title":"Journal of Information Science"},{"key":"7_CR18","unstructured":"Lipton, J., Chapman, E.: Some notes on logic programming with a relational machine. In: Jaoua, A., Kempf, P., Schmidt, G. (eds.) Relational Methods in Computer Science, Technical Report Nr. 1998-03, pp. 1\u201334, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t der Bundeswehr M\u00fcnchen (July 1998)"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(95)00082-8","volume":"160","author":"R.D. Maddux","year":"1996","unstructured":"Maddux, R.D.: Relation-algebraic semantics. Theoretical Computer Science\u00a0160, 1\u201385 (1996)","journal-title":"Theoretical Computer Science"},{"key":"7_CR20","volume-title":"Collected Papers","author":"C.S. Peirce","year":"1933","unstructured":"Peirce, C.S.: Collected Papers. Harvard University Press, Cambridge (1933)"},{"key":"7_CR21","first-page":"248","volume-title":"Origins of the calculus of binary relations","author":"V.R. Pratt","year":"1992","unstructured":"Pratt, V.R.: Origins of the calculus of binary relations, pp. 248\u2013254. IEEE Computer Soc. Press, Los Alamitos (1992)"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-09987-5","volume-title":"A Relational Theory of Computing","author":"J.G. Sanderson","year":"1980","unstructured":"Sanderson, J.G.: A Relational Theory of Computing. LNCS, vol.\u00a082. Springer, Heidelberg (1980)"},{"key":"7_CR23","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-77968-8","volume-title":"Relations and Graphs: Discrete Mathematics for Computer Scientists","author":"G.W. Schmidt","year":"1993","unstructured":"Schmidt, G.W., Str\u00f6hlein, T.: Relations and Graphs: Discrete Mathematics for Computer Scientists. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1993)"},{"key":"7_CR24","unstructured":"Schr\u00f6der, E.: Vorlesungen \u00fcber der Algebra der Logik. Algebra und Logik der Relative, vol.\u00a03 (1895)"},{"issue":"3","key":"7_CR25","doi-asserted-by":"publisher","first-page":"73","DOI":"10.2307\/2268577","volume":"6","author":"A. Tarski","year":"1941","unstructured":"Tarski, A.: On the calculus of relations. Journal of Symbolic Logic\u00a06(3), 73\u201389 (1941)","journal-title":"Journal of Symbolic Logic"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Tarski, A., Givant, S.: A formalization of set theory without variables, AMS Colloquium Publications. American Mathematical Society, vol.\u00a041 (1988)","DOI":"10.1090\/coll\/041"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10721975_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T07:42:01Z","timestamp":1556005321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10721975_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677789","9783540449805"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/10721975_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}