{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:49Z","timestamp":1759638889166},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319631387"},{"type":"electronic","value":"9783319631394"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-63139-4_10","type":"book-chapter","created":{"date-parts":[[2017,7,24]],"date-time":"2017-07-24T03:22:55Z","timestamp":1500866575000},"page":"168-186","source":"Crossref","is-referenced-by-count":3,"title":["A Productivity Checker for Logic Programming"],"prefix":"10.1007","author":[{"given":"Ekaterina","family":"Komendantskaya","sequence":"first","affiliation":[]},{"given":"Patricia","family":"Johann","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Schmidt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,25]]},"reference":[{"issue":"12","key":"10_CR1","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0304-3975(99)00207-8","volume":"236","author":"T Arts","year":"2000","unstructured":"Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. TCS 236(12), 133\u2013178 (2000)","journal-title":"TCS"},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","volume":"25","author":"B Courcelle","year":"1983","unstructured":"Courcelle, B.: Fundamental properties of infinite trees. TCS 25, 95\u2013169 (1983)","journal-title":"TCS"},{"issue":"Supplement 1","key":"10_CR3","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0743-1066(94)90027-2","volume":"19\u201320","author":"D Schreye de","year":"1994","unstructured":"de Schreye, D., Decorte, S.: Termination of logic programs: the never-ending story. J. Logic Program. 19\u201320(Supplement 1), 199\u2013260 (1994)","journal-title":"J. Logic Program."},{"issue":"4\u20135","key":"10_CR4","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1016\/j.tcs.2009.10.014","volume":"411","author":"J Endrullis","year":"2010","unstructured":"Endrullis, J., et al.: Productivity of stream definitions. TCS 411(4\u20135), 765\u2013782 (2010)","journal-title":"TCS"},{"key":"10_CR5","unstructured":"Endrullis, J., et al.: A coinductive framework for infinitary rewriting and equational reasoning. In: RTA, pp. 143\u2013159 (2015)"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Fu, P., Komendantskaya, E.: Operational semantics of resolution and productivity in horn clause logic. Formal Aspects of Computing (2016)","DOI":"10.1007\/s00165-016-0403-1"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-74610-2_4","volume-title":"Logic Programming","author":"G Gupta","year":"2007","unstructured":"Gupta, G., Bansal, A., Min, R., Simon, L., Mallya, A.: Coinductive logic programming and its applications. In: Dahl, V., Niemel\u00e4, I. (eds.) ICLP 2007. LNCS, vol. 4670, pp. 27\u201344. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-74610-2_4"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-540-25979-4_18","volume-title":"Rewriting Techniques and Applications","author":"N Hirokawa","year":"2004","unstructured":"Hirokawa, N., Middeldorp, A.: Dependency pairs revisited. In: Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 249\u2013268. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-25979-4_18"},{"key":"10_CR9","unstructured":"Johann, P., et al.: Structural resolution for logic programming. In: Technical Communications of ICLP (2015)"},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.entcs.2014.02.007","volume":"33","author":"E Komendantskaya","year":"2014","unstructured":"Komendantskaya, E., et al.: Exploiting parallelism in coalgebraic logic programming. Electron. Notes Theor. Comput. Sci. 33, 121\u2013148 (2014)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"2","key":"10_CR11","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1093\/logcom\/exu026","volume":"26","author":"E Komendantskaya","year":"2016","unstructured":"Komendantskaya, E., et al.: Coalgebraic logic programming: from semantics to implementation. J. Logic Comput. 26(2), 745\u2013783 (2016)","journal-title":"J. Logic Comput."},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Komendantskaya, E., Li, Y.: Productive corecursion in logic programming. In: Proceedings of ICLP 2017 (2017). arXiv:1707.01541 . To appear in Journal of Theory and Practice of Logic Programming","DOI":"10.1017\/S147106841700028X"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-319-06410-9_27","volume-title":"FM 2014: Formal Methods","author":"KRM Leino","year":"2014","unstructured":"Leino, K.R.M., Moskal, M.: Co-induction simply. In: Jones, C., Pihlajasaari, P., Sun, J. (eds.) FM 2014. LNCS, vol. 8442, pp. 382\u2013398. Springer, Cham (2014). doi: 10.1007\/978-3-319-06410-9_27"},{"key":"10_CR14","volume-title":"Foundations of Logic Programming","author":"JW Lloyd","year":"1988","unstructured":"Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1988)","edition":"2"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Nguyen, M.T., et al.: Termination analysis of logic programs based on dependency graphs. In: LPOSTR, pp. 8\u201322 (2007)","DOI":"10.1007\/978-3-540-78769-3_2"},{"key":"10_CR16","volume-title":"Types in Logic Programming","author":"F Pfenning","year":"1992","unstructured":"Pfenning, F.: Types in Logic Programming. The MIT Press, Cambridge (1992)"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-319-21401-6_13","volume-title":"Automated Deduction \u2013 CADE-25","author":"A Reynolds","year":"2015","unstructured":"Reynolds, A., Blanchette, J.C.: A decision procedure for (co)datatypes in SMT solvers. In: Felty, A.P., Middeldorp, A. (eds.) CADE 2015. LNCS (LNAI), vol. 9195, pp. 197\u2013213. Springer, Cham (2015). doi: 10.1007\/978-3-319-21401-6_13"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Rohwedder, E., Pfenning, F.: Model and termination checking for higher-order logic programs. In: ESOP, pp. 296\u2013310 (1996)","DOI":"10.1007\/3-540-61055-3_44"},{"key":"10_CR19","unstructured":"Schmidt, M.: Productivity checker for LP (2016). www.macs.hw.ac.uk\/~ek19\/CoALP\/"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-540-71410-1_13","volume-title":"Logic-Based Program Synthesis and Transformation","author":"P Schneider-Kamp","year":"2007","unstructured":"Schneider-Kamp, P., Giesl, J., Serebrenik, A., Thiemann, R.: Automated termination analysis for logic programs by term rewriting. In: Puebla, G. (ed.) LOPSTR 2006. LNCS, vol. 4407, pp. 177\u2013193. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-71410-1_13"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/978-3-540-73420-8_42","volume-title":"Automata, Languages and Programming","author":"L Simon","year":"2007","unstructured":"Simon, L., Bansal, A., Mallya, A., Gupta, G.: Co-logic programming: extending logic programming with coinduction. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 472\u2013483. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-73420-8_42"},{"key":"10_CR22","volume-title":"Term Rewriting Systems","author":"Terese","year":"2003","unstructured":"Terese: Term Rewriting Systems. Cambridge University Press, New York (2003)"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63139-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T12:33:59Z","timestamp":1569933239000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63139-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319631387","9783319631394"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63139-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}