{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:12Z","timestamp":1725663612198},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540194262"},{"type":"electronic","value":"9783540392675"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-19426-6_2","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:10:27Z","timestamp":1330182627000},"page":"19-39","source":"Crossref","is-referenced-by-count":3,"title":["CS-Prolog: A generalized unification based constraint solver"],"prefix":"10.1007","author":[{"given":"Toshio","family":"Kawamura","sequence":"first","affiliation":[]},{"given":"Hayato","family":"Ohwada","sequence":"additional","affiliation":[]},{"given":"Fumio","family":"Mizoguchi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"2_CR1","unstructured":"A.Bundy, The Computer Modelling of Mathematical Reasoning, Academic Press, 1983."},{"key":"2_CR2","unstructured":"T.Chikayama, ESP Reference Manual, ICOT TR-044, 1984."},{"key":"2_CR3","unstructured":"A.Colmerauer, EQUATIONS AND INEQUATIONS ON FINITE AND INFINITE TREES, Proc. of FGCS '84, 1984."},{"key":"2_CR4","unstructured":"M.Dincbas, CONSTRAINTS, LOGIC PROGRAMMING and DEDUCTIVE DATABASE, France-Japan AI and Computer Science Symposium '86, 1986."},{"key":"2_CR5","unstructured":"N.Heintze et al, The CLP Programmer's Manual, Dept. of Computer Science, Monash Univ., 1986."},{"key":"2_CR6","unstructured":"J.Jaffar and J. Lassez, A Logic Programming Language Schema, In D. DeGroot and G.Lindstrom, Eds., LOGIC PROGRAMMING: Functions, Relations, and Equations, Prentice Hall, 1986."},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"J.Jaffar and P.J.Stuckey, Logic Program Semantics for Programming with Equations, 3rd ICLP, Springer-Verlag, 1986.","DOI":"10.1016\/0743-1066(86)90020-8"},{"key":"2_CR8","unstructured":"K.Mukai, Unification over Complex Indeterminates in Prolog, Proc. of LPC '85, 1985."},{"key":"2_CR9","unstructured":"H.Nakashima, Term Description:A Simple Powerful Extension to Prolog Data Structures, IJCAI '85, 1985."},{"key":"2_CR10","unstructured":"H.Seki and K.Furukawa, Notes on Transformation Technics for Generate and Test Logic Programs, ICOT TM-0240, 1986."},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Robert E. Shostak, On the SUP-INF Method for Proving Presburger Formulas, JACM '77, 1977.","DOI":"10.1145\/322033.322034"},{"key":"2_CR12","unstructured":"R.Simmons COMMONSENCE ARITHMETIC REASONING, AAAI-86, 1986."},{"key":"2_CR13","unstructured":"G.L.Steele Jr., The Definition and Implementation of A Computer Programming Language based on CONSTRAINTS, MIT Ph.D Dissertation, 1980."}],"container-title":["Lecture Notes in Computer Science","Logic Programming '87"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-19426-6_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:17:13Z","timestamp":1605626233000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-19426-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540194262","9783540392675"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-19426-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}