Skip to main content

Co-Logic Programming: Extending Logic Programming with Coinduction

  • Conference paper
Automata, Languages and Programming (ICALP 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4596))

Included in the following conference series:

Abstract

In this paper we present the theory and practice of co-logic programming (co-LP for brevity), a paradigm that combines both inductive and coinductive logic programming. Co-LP is a natural generalization of logic programming and coinductive logic programming, which in turn generalizes other extensions of logic programming, such as infinite trees, lazy predicates, and concurrent communicating predicates. Co-LP has applications to rational trees, verifying infinitary properties, lazy evaluation, concurrent LP, model checking, bisimilarity proofs, etc.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Krzysztof, R.: Apt. Logic programming. In: Handbook of Theoretical Computer Science, pp. 493–574. MIT Press, Cambridge (1990)

    Google Scholar 

  2. Barwise, J., Moss, L.: Vicious Circles: On the Mathematics of Non-Wellfounded Phenomena. CSLI Pub. (1996)

    Google Scholar 

  3. Colmerauer, A.: Equations and inequations on finite and infinite trees. In: FGCS 1984

    Google Scholar 

  4. Courcelle, B.: Fundamental properties of infinite trees. TCS, pp. 95–212 (1983)

    Google Scholar 

  5. Hanus, M.: Integration of functions into LP. J. Logic Prog. 19, 20, 583–628 (1994)

    Article  MathSciNet  Google Scholar 

  6. Jaffar, J., Stuckey, P.J.: Semantics of infinite tree LP. TCS 46(2–3), 141–158 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  7. Lloyd, J.W.: Foundations of LP, 2nd edn. Springer, Heidelberg (1987)

    Google Scholar 

  8. Rocha, R., et al.: Theory and Practice of Logic Programming 5(1-2), 161–205, (2005)Tabling Engine That Can Exploit Or-Parallelism. In: ICLP 2001, pp. 43–58 (2001)

    Google Scholar 

  9. 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)

    Chapter  Google Scholar 

  10. Simon, L., Mallya, A., Bansal, A., Gupta, G.: Co-Logic Programming: Extending Logic Programming with Coinduction. TR #UTDCS-21-06, UT Dallas (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Lars Arge Christian Cachin Tomasz Jurdziński Andrzej Tarlecki

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Simon, L., Bansal, A., Mallya, A., Gupta, G. (2007). Co-Logic Programming: Extending Logic Programming with Coinduction. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds) Automata, Languages and Programming. ICALP 2007. Lecture Notes in Computer Science, vol 4596. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73420-8_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73420-8_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73419-2

  • Online ISBN: 978-3-540-73420-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics