{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:19Z","timestamp":1761611299502},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616290"},{"type":"electronic","value":"9783540706427"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61629-2_44","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:07:39Z","timestamp":1330294059000},"page":"200-221","source":"Crossref","is-referenced-by-count":5,"title":["A category-based equational logic semantics to constraint programming"],"prefix":"10.1007","author":[{"given":"R\u0103zvan","family":"Diaconescu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"13_CR1","unstructured":"Franz Baader and Klaus U. Schultz. On the Combination of Symbolic Constraints, Solution Domains, and Constraint Solvers. Technical Report 94-82, CIS-Universitat Muenchen, 1994."},{"issue":"2","key":"13_CR2","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1006\/inco.1995.1131","volume":"121","author":"L. Bachmair","year":"1995","unstructured":"L. Bachmair, H. Ganzinger, C. Lynch, and W. Snyder. Basic paramodulation. Information and Computation, 121(2):172\u2013192, 1995.","journal-title":"Information and Computation"},{"key":"13_CR3","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1017\/S0305004100013463","volume":"31","author":"G. Birkhoff","year":"1935","unstructured":"Garrett Birkhoff. On the structure of abstract algebras. Proceedings of the Cambridge Philosophical Society, 31:433\u2013454, 1935.","journal-title":"Proceedings of the Cambridge Philosophical Society"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"H.-J. B\u00fcrckert. A Resolution Principle for a Logic with Restricted Quantifiers, volume 568 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 1991.","DOI":"10.1007\/3-540-55034-8"},{"key":"13_CR5","unstructured":"Alain Colmerauer. An introduction to PrologIII. Technical report, Groupe Intelligence Artificielle, Faculte de Sciences de Luminy."},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Virgil C\u0103z\u0103nescu. Local equational logic. In Zoltan Esik, editor, Proceedings, 9th International Conference on Fundamentals of Computation Theory FCT'93, pages 162\u2013170. Springer-Verlag, 1993. Lecture Notes in Computer Science, Volume 710.","DOI":"10.1007\/3-540-57163-9_12"},{"key":"13_CR7","unstructured":"Nachum Dershowitz. Computing with rewrite rules. Technical Report ATR-83(8478)-1, The Aerospace Corp., 1983."},{"key":"13_CR8","unstructured":"R\u0103zvan Diaconescu. The logic of Horn clauses is equational. Technical Report PRG-TR-3-93, Programming Research Group, University of Oxford, 1990."},{"key":"13_CR9","unstructured":"R\u0103zvan Diaconescu. Category-based Semantics for Equational and Constraint Logic Programming. PhD thesis, University of Oxford, 1994."},{"issue":"1","key":"13_CR10","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1017\/S0960129500000621","volume":"5","author":"R. Diaconescu","year":"1995","unstructured":"R\u0103zvan Diaconescu. Completeness of category-based equational deduction. Mathematical Structures in Computer Science, 5(1):9\u201341, 1995.","journal-title":"Mathematical Structures in Computer Science"},{"key":"13_CR11","unstructured":"R\u0103zvan Diaconescu. Constraint institutions for combining solution and constraint domains, 1995. draft."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"R\u0103zvan Diaconescu. Category-based modularisation for equational logic programming. Acta Informatica, 33, 1996. To appear.","DOI":"10.1007\/s002360050054"},{"key":"13_CR13","unstructured":"R\u0103zvan Diaconescu. Completeness of semantic paramodulation: a category-based approach. Technical Report IS-RR-96-0006S, Japan Advanced Institute for Science and Technology, 1996."},{"key":"13_CR14","unstructured":"Joseph Goguen. Theorem, Proving and Algebra. MIT, to appear 1996."},{"issue":"1","key":"13_CR15","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1145\/147508.147524","volume":"39","author":"J. Goguen","year":"1992","unstructured":"Joseph Goguen and Rod Burstall. Institutions: Abstract model theory for specification and programming. Journal of the Association for Computing Machinery, 39(1):95\u2013146, January 1992.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"4","key":"13_CR16","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1017\/S0960129500000517","volume":"4","author":"J. Goguen","year":"1994","unstructured":"Joseph Goguen and R\u0103zvan Diaconescu. An Oxford survey of order sorted algebra. Mathematical Structures in Computer Science, 4(4):363\u2013392, 1994.","journal-title":"Mathematical Structures in Computer Science"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Joseph Goguen and R\u0103zvan Diaconescu. An introduction to category-based equational logic. In V.S. Alagar and Maurice Nivat, editors, Algebraic Methodology and Software Technology, volume 936 of Lecture Notes in Computer Science, pages 91\u2013126. Springer, 1995.","DOI":"10.1007\/3-540-60043-4_48"},{"issue":"3","key":"13_CR18","first-page":"307","volume":"11","author":"J. Goguen","year":"1985","unstructured":"Joseph Goguen and Jos\u00e9 Meseguer. Completeness of many-sorted equational logic. Houston Journal of Mathematics, 11(3):307\u2013334, 1985.","journal-title":"Houston Journal of Mathematics"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Joseph Goguen and Jos\u00e9 Meseguer. Models and equality for logical programming. In Hartmut Ehrig, Giorgio Levi, Robert Kowalski, and Ugo Montanari, editors, Proceedings, 1987 TAPSOFT, pages 1\u201322. Springer, 1987. Lecture Notes in Computer Science, Volume 250.","DOI":"10.1007\/BFb0014969"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Joxan Jaffar and Jean-Louis Lassez. Constraint logic programming. In 14th ACM Symposium on the Principles of Programming languages, pages 111\u2013119. 1987.","DOI":"10.1145\/41625.41635"},{"issue":"3","key":"13_CR21","first-page":"9","volume":"4","author":"C. Kirchner","year":"1990","unstructured":"Claude Kirchner, H\u00e9l\u00e8ne Kirchner, and M. Rusinowitch. Deduction with symbolic constraints. Revue d'Intelligence Artificielle, 4(3):9\u201352, 1990. Special issue on Automatic Deduction.","journal-title":"Revue d'Intelligence Artificielle"},{"key":"13_CR22","unstructured":"Claude Kirchner, H\u00e9l\u00e8ne Kirchner, and M. Vittek. Designing constraint logic programming languages using computational systems. In P. Van Hentenryck and V. Saraswat, editors, Principles and Practice of Constraint Programming. The Newport Papers., pages 131\u2013158. 1995."},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Saunders Mac Lane. Categories for the Working Mathematician. Springer, 1971.","DOI":"10.1007\/978-1-4612-9839-7"},{"key":"13_CR24","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"93","author":"J. Meseguer","year":"1992","unstructured":"Jos\u00e9 Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, (93):73\u2013155, 1992.","journal-title":"Theoretical Computer Science"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Peter Mosses. Unified algebras and institutions. In Proceedings, Fourth Annual Conference on Logic in Computer Science, pages 304\u2013312. IEEE, 1989.","DOI":"10.1109\/LICS.1989.39185"},{"issue":"4","key":"13_CR26","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF00244275","volume":"1","author":"M. Stickel","year":"1985","unstructured":"M. Stickel. Automated deduction by theory resolution. Journal of Automated Reasoning, 1(4):333\u2013355, 1985.","journal-title":"Journal of Automated Reasoning"},{"key":"13_CR27","doi-asserted-by":"crossref","first-page":"13","DOI":"10.2307\/2102968","volume":"4","author":"A. Tarski","year":"1944","unstructured":"Alfred Tarski. The semantic conception of truth. Philos. Phenomenological Research, 4:13\u201347, 1944.","journal-title":"Philos. Phenomenological Research"}],"container-title":["Lecture Notes in Computer Science","Recent Trends in Data Type Specification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61629-2_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:08:45Z","timestamp":1605647325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61629-2_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616290","9783540706427"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-61629-2_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}