{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T20:07:48Z","timestamp":1794341268030,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540366355","type":"print"},{"value":"9783540366362","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11799573_25","type":"book-chapter","created":{"date-parts":[[2006,8,7]],"date-time":"2006-08-07T08:25:42Z","timestamp":1154939142000},"page":"330-345","source":"Crossref","is-referenced-by-count":49,"title":["Coinductive Logic Programming"],"prefix":"10.1007","author":[{"given":"Luke","family":"Simon","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ajay","family":"Mallya","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ajay","family":"Bansal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gopal","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"25_CR1","first-page":"493","volume-title":"Handbook of Theoretical Computer Science","author":"K.R. Apt","year":"1990","unstructured":"Apt, K.R.: Logic programming. In: Handbook of Theoretical Computer Science, ch.\u00a015, pp. 493\u2013574. MIT Press, Cambridge (1990)"},{"key":"25_CR2","volume-title":"Vicious Circles: On the Mathematics of Non-Wellfounded Phenomena","author":"J. Barwise","year":"1996","unstructured":"Barwise, J., Moss, L.: Vicious Circles: On the Mathematics of Non-Wellfounded Phenomena. CSLI Publications, Stanford (1996)"},{"key":"25_CR3","unstructured":"Colmerauer, A.: Equations and inequations on finite and infinite trees. In: Proc. FGCS 1984, Tokyo, pp. 85\u201399 (1984)"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: Fundamental properties of infinite trees. TCS, 95\u2013212 (1983)","DOI":"10.1016\/0304-3975(83)90059-2"},{"key":"25_CR5","unstructured":"Gupta, G.: Verifying Properties of Cyclic Data-structures with Tabled Unification. Internal Memo. New Mexico State University (February 2000)"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Gupta, G., Pontelli, E.: Constraint-based Specification and Verification of Real-time Systems. In: Proc. IEEE Real-time Symposium 1997, pp. 230\u2013239 (1997)","DOI":"10.1109\/REAL.1997.641285"},{"key":"25_CR7","unstructured":"Gupta, G.: Next Generation of Logic Programming Systems. Technical Report UTD-42-03, University of Texas, Dallas (2003)"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","volume":"19 & 20","author":"M. Hanus","year":"1994","unstructured":"Hanus, M.: Integration of functions into LP. J. Logic Prog.\u00a019&20, 583\u2013628 (1994)","journal-title":"J. Logic Prog."},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Jaffar, J., Santosa, A.E., Voicu, R.: A CLP proof method for timed automata. In: RTSS, pp. 175\u2013186 (2004)","DOI":"10.1109\/REAL.2004.5"},{"issue":"2\u20133","key":"25_CR10","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0304-3975(86)90027-7","volume":"46","author":"J. Jaffar","year":"1986","unstructured":"Jaffar, J., Stuckey, P.J.: Semantics of infinite tree LP. TCS\u00a046(2\u20133), 141\u2013158 (1986)","journal-title":"TCS"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/3-540-44622-2_23","volume-title":"Computer Science Logic","author":"M. Jaume","year":"2000","unstructured":"Jaume, M.: Logic programming and co-inductive definitions. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol.\u00a01862, p. 343. Springer, Heidelberg (2000)"},{"key":"25_CR12","volume-title":"Foundations of LP","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of LP, 2nd edn. Springer, Heidelberg (1987)","edition":"2"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/11562931_23","volume-title":"Logic Programming","author":"A. Mallya","year":"2005","unstructured":"Mallya, A.: Deductive Multi-valued Model Checking. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol.\u00a03668, pp. 297\u2013310. Springer, Heidelberg (2005)"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Nait-Abdallah, M.A.: On the Interpretation of Infinite Computations in Logic Programming. In: ICALP 1984, pp. 358\u2013370 (1984)","DOI":"10.1007\/3-540-13345-3_32"},{"key":"25_CR15","volume-title":"Types and Programming Languages","author":"B. Pierce","year":"2002","unstructured":"Pierce, B.: Types and Programming Languages. MIT Press, Cambridge (2002)"},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-63166-6_16","volume-title":"Computer Aided Verification","author":"Y. Ramakrishna","year":"1997","unstructured":"Ramakrishna, Y., Ramakrishnan, C.R., Ramakrishnan, I.V., Warren, D.S., et al.: Efficient Model Checking Using Tabled Resolution. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 143\u2013154. Springer, Heidelberg (1997)"},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/3-540-45635-X_11","volume-title":"Logic Programming","author":"R. Rocha","year":"2001","unstructured":"Rocha, R., Silva, F., Costa, V.S.: Theory and Practice of Logic Programming 5(1-2). 161-205 Tabling Engine That Can Exploit Or-Parallelism. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol.\u00a02237, pp. 43\u201358. Springer, Heidelberg (2001)"},{"key":"25_CR18","unstructured":"Simon, L.: Coinductive LP. Internal memo, UT Dallas (March 2004)"},{"key":"25_CR19","unstructured":"Simon, L., Mallya, A., Bansal, A., Gupta, G.: Co-Logic Programming: Extending Logic Programming with Coinduction. Tech. Report, UT Dallas, UTDCS-21-06"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Simon, L., Mallya, A., Bansal, A., Gupta, G.: Coinductive Logic Programming. Technical Report, UT Dallas, UTDCS-11-06 (March 2006)","DOI":"10.1007\/11799573_25"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11799573_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:11:14Z","timestamp":1605625874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11799573_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540366355","9783540366362"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11799573_25","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11799573","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}