Abstract
We give an overview of the coinductive logic programming paradigm. We discuss its applications to modeling ω-automata, model checking, verification, non-monotonic reasoning, developing SAT solvers, etc. We also discuss future research directions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)
Barwise, J., Moss, L.: Vicious Circles: On the Mathematics of Non-Wellfounded Phenomena. CSLI Publications, Stanford (1996)
Clarke Jr., E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (1999)
Dang, Z.: Binary reachability analysis of pushdown timed automata with dense clocks. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 506–518. Springer, Heidelberg (2001)
Degano, P., Loddo, J., Priami, C.: Mobile processes with local clocks. In: LOMAPS, pp. 296–319. Springer, Heidelberg (1996)
DeVries, B., et al.: Semantics and Implementation of Co-Logic Programming (forthcoming)
DeVries, B., et al.: A Co-LP Execution Strategy Derived from Rabin Tree Automata (in preparation)
Fages, F.: Consistency of Clark’s completion and existence of stable models. Journal of Methods of Logic in Computer Science 1, 51–60 (1994)
Gordon, A.: A Tutorial on Co-induction and Functional Programming. In: Glasgow Functional Programming Workshop, pp. 78–95. Springer, Heidelberg (1994)
Gupta, G., Bansal, A., Min, R., Simon, L., Mallya, A.: Coinductive logic programming and its applications. In: Dahl, V., Niemelä, I. (eds.) ICLP 2007. LNCS, vol. 4670, pp. 27–44. Springer, Heidelberg (2007)
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–131 (1994)
Jacobs, B.: Introduction to Coalgebra: Towards Mathematics of States and Observation. Draft manuscript
Jaffar, J., Maher, M.J.: Constraint logic programming: A survey. J. Log. Program. 19/20, 503–581 (1994)
Kluźniak, F.: A logic programming meta-interpreter that combines tabling and coinduction, http://www.utdallas.edu/~gupta/meta.tar.gz
Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)
Mallya, A.: Deductive Multi-valued Model Checking. Ph.D. thesis. University of Texas at Dallas (2006)
Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, parts i and ii. Inf. Comput. 100(1), 1–77 (1992)
Min, R., Bansal, A., Gupta, G.: Towards Predicate Answer Set Programming via Coinductive Logic Programming. In: AIAI 2009 (2009)
Min, R.: Predicate Answer Set Programming with Coinduction. Ph.D. Thesis. University of Texas at Dallas (2009)
Min, R., Gupta, G.: Coinductive Logic Programming with Negation. In: De Schreye, D. (ed.) LOPSTR 2009. LNCS, vol. 6037, pp. 97–112. Springer, Heidelberg (2010)
Pierce, B.: Types and Programming Languages. The MIT Press, Cambridge (2002)
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)
Rabin, M.O.: Decidability of Second-Order Theories and Automata on Infinite Trees. Transactions of the American Mathematical Society 141, 1 (1969)
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–154. Springer, Heidelberg (1997)
Saeedloei, N.: Extending Infinite Systems with Real-time. Ph.D. Thesis. University of Texas at Dallas (forthcoming)
Saeedloei, N., Gupta, G.: Timed pi-calculus. University of Texas at Dallas technical report
Saeedloei, N., Gupta, G.: Timed definite clause omega-grammars. In: ICLP (Technical Communications), pp. 212–221 (2010)
Saeedloei, N., Gupta, G.: Verifying complex continuous real-time systems with coinductive CLP(R). In: Dediu, A.-H., Fernau, H., Martín-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 536–548. Springer, Heidelberg (2010)
Simon, L.: Coinductive Logic Programming. Ph,D thesis, University of Texas at Dallas (2006)
Simon, L., Mallya, A., Bansal, A., Gupta, G.: Coinductive Logic Programming. In: Etalle, S., Truszczyński, M. (eds.) ICLP 2006. LNCS, vol. 4079, pp. 330–345. Springer, Heidelberg (2006)
Sterling, L., Shapiro, E.: The Art of Prolog: Advanced Programming Techniques, 2nd edn. The MIT Press, Cambridge (1994)
Wielemaker, J.: SWI-Prolog, http://www.swi-prolog.org
Wegner, P., Goldin, D.: Mathematical models of interactive computing. Brown University Technical Report CS 99-13 (1999)
Yang, P., Ramakrishnan, C.R., Smolka, S.A.: A logical encoding of the π-calculus: Model checking mobile processes using tabled resolution. In: Zuck, L.D., Attie, P.C., Cortesi, A., Mukhopadhyay, S. (eds.) VMCAI 2003. LNCS, vol. 2575, pp. 116–131. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gupta, G., Saeedloei, N., DeVries, B., Min, R., Marple, K., Kluźniak, F. (2011). Infinite Computation, Co-induction and Computational Logic. In: Corradini, A., Klin, B., Cîrstea, C. (eds) Algebra and Coalgebra in Computer Science. CALCO 2011. Lecture Notes in Computer Science, vol 6859. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22944-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-22944-2_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22943-5
Online ISBN: 978-3-642-22944-2
eBook Packages: Computer ScienceComputer Science (R0)