Abstract
Coinduction has recently been introduced as a powerful technique for reasoning about unfounded sets, unbounded structures, and interactive computations. Where induction corresponds to least fixed point semantics, coinduction corresponds to greatest fixed point semantics. In this paper we discuss the introduction of coinduction into logic programming. We discuss applications of coinductive logic programming to verification and model checking, lazy evaluation, concurrent logic programming and non-monotonic reasoning.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alur, R., Dill, D.L.: A theory of timed automata. TCS 126, 183–235 (1994)
Bansal, A.: Towards next generation logic programming systems. Ph.D. thesis forthcoming
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)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) Logic Programming: Proc. of the Fifth International Conference and Symposium, pp. 1070–1080 (1988)
Goldin, D., Keil, D.: Interaction, Evolution and Intelligence. In: Proc. Congress on Evolutionary Computing (2001)
Goguen, J., Lin, K.: Behavioral Verification of Distributed Concurrent Systems with BOBJ. In: Proc. Conference on Quality Software, pp. 216–235. IEEE Press, Los Alamitos (2003)
Gordon, A.: A Tutorial on Co-induction and Functional Programming. In: Springer Workshops in Computing (Functional Programming), pp. 78–95. Springer, Heidelberg (1995)
Gupta, G., Pontelli, E.: Constraint-based Specification and Verification of Real-time Systems. In: Proc. IEEE Real-time Symposium 1997, pp. 230–239
Jacobs, B.: Introduction to Coalgebra: Towards Mathematics of States and Observation. Draft manuscript
Liu, X., Ramakrishnan, C.R., Smolka, S.A.: Fully local and efficient evaluation of alternating fixed-points. In: Steffen, B. (ed.) ETAPS 1998 and TACAS 1998. LNCS, vol. 1384, Springer, Heidelberg (1998)
Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)
Mallya, A.: Multivalued Deductive Multi-valued Model Checking. Ph.d. thesis. UT Dallas (2006)
Marek, W., Truszczynski, M.: Stable models and an alternative logic programming paradigm. In: the Logic Programming Paradigm: a 25-Year Perspective, pp. 375–398. Springer, Heidelberg (1999)
Min, R.: Coinduction in monotonic and non-monotonic reasoning. Ph.D. thesis forthcoming
Pierce, B.: Types and Programming Languages. MIT Press, Cambridge, MA (2002)
Podelski, A., Rybalchenko, A.: Transition Predicate Abstraction and Fair Termination. In: POPL 2005, pp. 132–144. ACM Press, New York (2005)
Ramakrishna, Y.S., et al.: Efficient Model Checking Using Tabled Resolution. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 143–154. Springer, Heidelberg (1997)
Costa, V.S., Rocha, R.: The YAP Prolog System
Schuppan, V., Biere, A.: Liveness Checking as Safety Checking for Infinite State Spaces. ENTCS 149(1), 79–96 (2006)
Simon, L.: Extending Logic Programming with Coinduction. Ph.D. Thesis (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–344. Springer, Heidelberg (2006)
Simon, L., Bansal, A., Mallya, A., Gupta, G.: Co-Logic Programming (to appear). In: Arge, Cachin, Jurdzinski, Tarlecki (eds.) ICALP 2007, vol. 4596, Springer, Heidelberg (to appear, 2007)
Vardi, M.: Verification of Concurrent Programs: The Automata-Theoretic Framework. In: LICS 1987, pp. 167–176. IEEE, Los Alamitos (1987)
Wegner, P., Goldin, D.: Mathematical models of interactive computing. Brown University Technical Report CS 99-13 (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gupta, G., Bansal, A., Min, R., Simon, L., Mallya, A. (2007). Coinductive Logic Programming and Its Applications. In: Dahl, V., Niemelä, I. (eds) Logic Programming. ICLP 2007. Lecture Notes in Computer Science, vol 4670. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74610-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-74610-2_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74608-9
Online ISBN: 978-3-540-74610-2
eBook Packages: Computer ScienceComputer Science (R0)