{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T12:01:33Z","timestamp":1759147293381},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540542339"},{"type":"electronic","value":"9783540475163"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54233-7_122","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:37:49Z","timestamp":1330209469000},"page":"20-34","source":"Crossref","is-referenced-by-count":8,"title":["Logic programming with recurrence domains"],"prefix":"10.1007","author":[{"given":"Hong","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jieh","family":"Hsiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"2_CR1","unstructured":"M. Bruynooghe and G. Janssens. An Instance of Abstract Interpretation Integrating Type and Mode Inference. In Proc. 5 th Int. Conf. on Logic Programming, pages 669\u2013683, K.A. Bowen and R.A. Kowalski(eds), MIT Press, Aug. 1988."},{"issue":"1","key":"2_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(85)90002-0","volume":"2","author":"A. Chandra","year":"1985","unstructured":"A. Chandra and D. Harel. Horn Clause Queries and Generalizations. J. Logic Programming, 2(1):1\u201316, April 1985.","journal-title":"J. Logic Programming"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Hong Chen and Jieh Hsiang. Logic Programming with Recurrence Domains. Technical Report 49, Department of Computer Science, SUNY at Stony Brook, Oct 1990.","DOI":"10.1007\/3-540-54233-7_122"},{"issue":"2","key":"2_CR4","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1145\/67544.66942","volume":"18","author":"J. Chomicki","year":"1989","unstructured":"J. Chomicki and T. Imielinski. Relational Specification of Infinite Query Answers. In Proc. of the 1989 ACM SIGMOD Int. Conf. on the Management of Data, pages 174\u2013183, Portland, Oregon, June 1989. Vol. 18, No. 2.","journal-title":"Proc. of the 1989 ACM SIGMOD Int. Conf. on the Management of Data"},{"key":"2_CR5","unstructured":"A. Colmerauer. Prolog and Infinite Trees. In Logic Programming, Academic Press, 1982."},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Hubert Comon. Inductive Proofs by Specifications Transformation. In Proc. Rewriting Techniques and Applications, pages 76\u201391, Springer Verlag, 4 1989. LNCS 355.","DOI":"10.1007\/3-540-51081-8_101"},{"key":"2_CR7","first-page":"674","volume":"90","author":"H. Comon","year":"1990","unstructured":"Hubert Comon. Equational Formulas in Order-Sorted Algebras. In ICALP 90, pages 674\u2013688, July 1990.","journal-title":"ICALP"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"J.A. Goguen and J. Meseguer. Equalities, Types Modules and Generics for Logic Programming. Journal of Logic Programming, 1, 1984.","DOI":"10.1016\/0743-1066(84)90004-9"},{"key":"2_CR9","unstructured":"J.A. Goguen and J. Meseguer. Order-Sorted Algebra I, Partial and Overloaded Operators, Error and Inheritance. Technical Report 000, SRI, 1985."},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"N. Heintze and J. Jaffar. A Finite Presentation Theorem for Approximating Logic Programs. In POPL-90, pages 197\u2013209, Feb. 1990.","DOI":"10.1145\/96709.96729"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"J. Jaffar and J.L. Lassez. Constraint Logic Programming. In Proceedings of 14th ACM Symposium on Principles of Programming languages, pages 111\u2013119, 1987.","DOI":"10.1145\/41625.41635"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"P. Mishra and U. Reddy. Declaration-Free Type Checking. In ACM Sym. on Principles of Programming Languages, pages 7\u201321, ACM, 1985.","DOI":"10.1145\/318593.318603"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"C. G. Nelson and D.C. Oppen. Fast Decision Algorithms based on Congruence Closure. Journal of the ACM, 27(2), 1980.","DOI":"10.1145\/322186.322198"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"M. Schmidt-Schaub. Computational Aspects of an Order-Sorted Logic with Term Declarations. Springer-Verlag, 1989. Lecture Notes in Artificial Intelligence, 395.","DOI":"10.1007\/BFb0024065"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54233-7_122.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:53:04Z","timestamp":1605646384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54233-7_122"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540542339","9783540475163"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-54233-7_122","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}