{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:06:52Z","timestamp":1725602812032},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229435"},{"type":"electronic","value":"9783642229442"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22944-2_4","type":"book-chapter","created":{"date-parts":[[2011,8,25]],"date-time":"2011-08-25T01:45:59Z","timestamp":1314236759000},"page":"40-54","source":"Crossref","is-referenced-by-count":9,"title":["Infinite Computation, Co-induction and Computational Logic"],"prefix":"10.1007","author":[{"given":"Gopal","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neda","family":"Saeedloei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brian","family":"DeVries","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Min","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyle","family":"Marple","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feliks","family":"Klu\u017aniak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357","volume-title":"Knowledge Representation, Reasoning and Declarative Problem Solving","author":"C. Baral","year":"2003","unstructured":"Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)"},{"key":"4_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":"4_CR3","volume-title":"Model Checking","author":"E.M. Clarke Jr.","year":"1999","unstructured":"Clarke Jr., E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (1999)"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/3-540-44585-4_48","volume-title":"Computer Aided Verification","author":"Z. Dang","year":"2001","unstructured":"Dang, Z.: Binary reachability analysis of pushdown timed automata with dense clocks. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 506\u2013518. Springer, Heidelberg (2001)"},{"key":"4_CR5","first-page":"296","volume-title":"LOMAPS","author":"P. Degano","year":"1996","unstructured":"Degano, P., Loddo, J., Priami, C.: Mobile processes with local clocks. In: LOMAPS, pp. 296\u2013319. Springer, Heidelberg (1996)"},{"key":"4_CR6","unstructured":"DeVries, B., et al.: Semantics and Implementation of Co-Logic Programming (forthcoming)"},{"key":"4_CR7","unstructured":"DeVries, B., et al.: A Co-LP Execution Strategy Derived from Rabin Tree Automata (in preparation)"},{"key":"4_CR8","first-page":"51","volume":"1","author":"F. Fages","year":"1994","unstructured":"Fages, F.: Consistency of Clark\u2019s completion and existence of stable models. Journal of Methods of Logic in Computer Science\u00a01, 51\u201360 (1994)","journal-title":"Journal of Methods of Logic in Computer Science"},{"key":"4_CR9","first-page":"78","volume-title":"Glasgow Functional Programming Workshop","author":"A. Gordon","year":"1994","unstructured":"Gordon, A.: A Tutorial on Co-induction and Functional Programming. In: Glasgow Functional Programming Workshop, pp. 78\u201395. Springer, Heidelberg (1994)"},{"key":"4_CR10","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.\u00a04670, pp. 27\u201344. Springer, Heidelberg (2007)"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Heitmeyer, C.L., Lynch, N.A.: The generalized railroad crossing: A case study in formal verification of real-time systems. In: IEEE RTSS, pp. 120\u2013131 (1994)","DOI":"10.1109\/REAL.1994.342724"},{"key":"4_CR12","unstructured":"Jacobs, B.: Introduction to Coalgebra: Towards Mathematics of States and Observation. Draft manuscript"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19\/20","author":"J. Jaffar","year":"1994","unstructured":"Jaffar, J., Maher, M.J.: Constraint logic programming: A survey. J. Log. Program.\u00a019\/20, 503\u2013581 (1994)","journal-title":"J. Log. Program."},{"key":"4_CR14","unstructured":"Klu\u017aniak, F.: A logic programming meta-interpreter that combines tabling and coinduction, http:\/\/www.utdallas.edu\/~gupta\/meta.tar.gz"},{"key":"4_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)","edition":"2"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Mallya, A.: Deductive Multi-valued Model Checking. Ph.D. thesis. University of Texas at Dallas (2006)","DOI":"10.1007\/11562931_23"},{"issue":"1","key":"4_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, parts i and ii. Inf. Comput.\u00a0100(1), 1\u201377 (1992)","journal-title":"Inf. Comput."},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Min, R., Bansal, A., Gupta, G.: Towards Predicate Answer Set Programming via Coinductive Logic Programming. In: AIAI 2009 (2009)","DOI":"10.1007\/978-1-4419-0221-4_58"},{"key":"4_CR19","unstructured":"Min, R.: Predicate Answer Set Programming with Coinduction. Ph.D. Thesis. University of Texas at Dallas (2009)"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-12592-8_8","volume-title":"Logic-Based Program Synthesis and Transformation","author":"R. Min","year":"2010","unstructured":"Min, R., Gupta, G.: Coinductive Logic Programming with Negation. In: De Schreye, D. (ed.) LOPSTR 2009. LNCS, vol.\u00a06037, pp. 97\u2013112. Springer, Heidelberg (2010)"},{"key":"4_CR21","volume-title":"Types and Programming Languages","author":"B. Pierce","year":"2002","unstructured":"Pierce, B.: Types and Programming Languages. The MIT Press, Cambridge (2002)"},{"key":"4_CR22","unstructured":"Puchol, C.: A solution to the generalized railroad crossing problem in Esterel. Technical report, Dep. of Comp. Science, The University of Texas at Austin (1995)"},{"key":"4_CR23","first-page":"1","volume":"141","author":"M.O. Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of Second-Order Theories and Automata on Infinite Trees. Transactions of the American Mathematical Society\u00a0141, 1 (1969)","journal-title":"Transactions of the American Mathematical Society"},{"key":"4_CR24","first-page":"143","volume-title":"Proc. CAV 1997","author":"Y.S. Ramakrishna","year":"1997","unstructured":"Ramakrishna, Y.S., Ramakrishnan, C.R., Ramakrishnan, I.V., Smolka, S.A., Swift, T., Warren, D.: Efficient Model Checking Using Tabled Resolution. In: Proc. CAV 1997, pp. 143\u2013154. Springer, Heidelberg (1997)"},{"key":"4_CR25","unstructured":"Saeedloei, N.: Extending Infinite Systems with Real-time. Ph.D. Thesis. University of Texas at Dallas (forthcoming)"},{"key":"4_CR26","unstructured":"Saeedloei, N., Gupta, G.: Timed pi-calculus. University of Texas at Dallas technical report"},{"key":"4_CR27","unstructured":"Saeedloei, N., Gupta, G.: Timed definite clause omega-grammars. In: ICLP (Technical Communications), pp. 212\u2013221 (2010)"},{"key":"4_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/978-3-642-13089-2_45","volume-title":"Language and Automata Theory and Applications","author":"N. Saeedloei","year":"2010","unstructured":"Saeedloei, N., Gupta, G.: Verifying complex continuous real-time systems with coinductive CLP(R). In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol.\u00a06031, pp. 536\u2013548. Springer, Heidelberg (2010)"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Simon, L.: Coinductive Logic Programming. Ph,D thesis, University of Texas at Dallas (2006)","DOI":"10.1007\/11799573_25"},{"key":"4_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/11799573_25","volume-title":"Logic Programming","author":"L. Simon","year":"2006","unstructured":"Simon, L., Mallya, A., Bansal, A., Gupta, G.: Coinductive Logic Programming. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol.\u00a04079, pp. 330\u2013345. Springer, Heidelberg (2006)"},{"key":"4_CR31","volume-title":"The Art of Prolog: Advanced Programming Techniques","author":"L. Sterling","year":"1994","unstructured":"Sterling, L., Shapiro, E.: The Art of Prolog: Advanced Programming Techniques, 2nd edn. The MIT Press, Cambridge (1994)","edition":"2"},{"key":"4_CR32","unstructured":"Wielemaker, J.: SWI-Prolog, http:\/\/www.swi-prolog.org"},{"key":"4_CR33","unstructured":"Wegner, P., Goldin, D.: Mathematical models of interactive computing. Brown University Technical Report CS 99-13 (1999)"},{"key":"4_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/3-540-36384-X_12","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"P. Yang","year":"2002","unstructured":"Yang, P., Ramakrishnan, C.R., Smolka, S.A.: A logical encoding of the \u03c0-calculus: Model checking mobile processes using tabled resolution. In: Zuck, L.D., Attie, P.C., Cortesi, A., Mukhopadhyay, S. (eds.) VMCAI 2003. LNCS, vol.\u00a02575, pp. 116\u2013131. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Algebra and Coalgebra in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22944-2_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:09:55Z","timestamp":1606169395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22944-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229435","9783642229442"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22944-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}