{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:08Z","timestamp":1725664028104},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578802"},{"type":"electronic","value":"9783540483762"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57880-3_5","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:37:10Z","timestamp":1330263430000},"page":"74-88","source":"Crossref","is-referenced-by-count":0,"title":["Foundational issues in implementing constraint logic programming systems"],"prefix":"10.1007","author":[{"given":"James H.","family":"Andrews","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"5_CR1","series-title":"volume 379 of Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/3-540-51486-4_62","volume-title":"Mathematical Foundations of Computer Science","author":"J. H. Andrews","year":"1989","unstructured":"James H. Andrews. Proof-theoretic characterisations of logic programming. In Mathematical Foundations of Computer Science, volume 379 of Lecture Notes in Computer Science, pages 145\u2013154, Porabka-Kozubnik, Poland, 1989. Springer."},{"key":"5_CR2","unstructured":"Alain Colmerauer. Prolog and infinite trees. In K. L. Clark and S.-A. T\u00e4rnlund, editors, Logic Programming, pages 231\u2013251. Academic Press, 1983."},{"key":"5_CR3","volume-title":"Technical Report 92-18","author":"T. Fr\u00fchwirth","year":"1992","unstructured":"Thom Fr\u00fchwirth. Constraint simplification rules. Technical Report 92-18, ECRC, Munich, Germany, July 1992."},{"key":"5_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J. Girard","year":"1987","unstructured":"Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1\u2013102, 1987.","journal-title":"Theoretical Computer Science"},{"key":"5_CR5","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF03037052","volume":"2","author":"M. Hagiya","year":"1984","unstructured":"Masami Hagiya and Takafumi Sakurai. Foundation of logic programming based on inductive definition. New Generation Computing, 2:59\u201377, 1984.","journal-title":"New Generation Computing"},{"key":"5_CR6","volume-title":"Technical Report 53","author":"M. H\u00f6hfeld","year":"1988","unstructured":"Markus H\u00f6hfeld and Gert Smolka. Definite relations over constraint languages. Technical Report 53, LILOG, IBM Deutschland, Stuttgart, Germany, October 1988. To appear in Journal of Logic Programming."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Lars Halln\u00e4s and Peter Schroeder-Heister. A proof-theoretic approach to logic programming I: Clauses as rules. Journal of Logic and Computation, 1(2), 1990.","DOI":"10.1093\/logcom\/1.2.261"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Joxan Jaffar and Jean-Louis Lassez. Constraint logic programming. In Proceedings of the Conference on Principles of Programming Languages, Munich, 1987.","DOI":"10.1145\/41625.41635"},{"issue":"3","key":"5_CR9","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1145\/129393.129398","volume":"14","author":"J. Jaffar","year":"1992","unstructured":"Joxan Jaffar, Spiro Michaylov, Peter J. Stuckey, and Roland H. C. Yap. The CLP(R) language and system. ACM Transactions on Programming Languages and Systems, 14(3):339\u2013395, July 1992.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"5_CR10","volume-title":"volume 1 of Bibliotheca Mathematica","author":"S. C. Kleene","year":"1952","unstructured":"Stephen Cole Kleene. Introduction to Metamathematics, volume 1 of Bibliotheca Mathematica. North-Holland, Amsterdam, 1952."},{"key":"5_CR11","unstructured":"Alan Mackworth. Constraint satisfaction. Technical Report 85-15, Department of Computer Science, University of British Columbia, September 1985."},{"key":"5_CR12","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1109\/LICS.1988.5132","volume-title":"Proceedings of the Third Annual Symposium on Logic In Computer Science","author":"M. J. Maher","year":"1988","unstructured":"Michael J. Maher. Complete axiomatizations of the algebras of finite, rational and infinite trees. In Proceedings of the Third Annual Symposium on Logic In Computer Science, pages 348\u2013357, Edinburgh, July 1988. Computer Society Press."},{"key":"5_CR13","first-page":"737","volume-title":"Proceedings of the Tenth International Conference on Logic Programming","author":"M. J. Maher","year":"1993","unstructured":"Michael J. Maher. A logic programming view of CLP. In Proceedings of the Tenth International Conference on Logic Programming, pages 737\u2013753, Budapest, July 1993. MIT Press."},{"key":"5_CR14","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","volume":"51","author":"D. Miller","year":"1991","unstructured":"Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125\u2013157, 1991.","journal-title":"Annals of Pure and Applied Logic"},{"key":"5_CR15","volume-title":"volume 37 of Graduate texts in mathematics","author":"J. D. Monk","year":"1976","unstructured":"James Donald Monk. Mathematical Logic, volume 37 of Graduate texts in mathematics. Springer-Verlag, New York, 1976."},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Dana Scott. Domains for denotational semantics. In International Colloquium on Automata, Languages, and Programming, 1982.","DOI":"10.1007\/BFb0012801"},{"key":"5_CR17","volume-title":"Mathematical Logic","author":"J. Shoenfield","year":"1967","unstructured":"Joseph Shoenfield. Mathematical Logic. Addison-Wesley, Reading, Mass., 1967."},{"key":"5_CR18","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0743-1066(84)90001-3","volume":"2","author":"M. H. Emden van","year":"1984","unstructured":"Maarten H. van Emden and John W. Lloyd. A logical reconstruction of Prolog II. Journal of Logic Programming, 2:143\u2013149, 1984.","journal-title":"Journal of Logic Programming"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems \u2014 ESOP '94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57880-3_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:15:22Z","timestamp":1605647722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57880-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578802","9783540483762"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-57880-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}