Skip to main content
SpringerLink
Log in

Coinductive Logic Programming with Negation

  • Conference paper
Logic-Based Program Synthesis and Transformation (LOPSTR 2009)

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

Abstract

We introduce negation into coinductive logic programming (co-LP) via what we term Coinductive SLDNF (co-SLDNF) resolution. We present declarative and operational semantics of co-SLDNF resolution and present their equivalence under the restriction of rationality. Co-LP with co-SLDNF resolution provides a powerful, practical and efficient operational semantics for Fitting’s Kripke-Kleene three-valued logic with restriction of rationality. Further, applications of co-SLDNF resolution are also discussed and illustrated where Co-SLDNF resolution allows one to develop elegant implementations of modal logics. Moreover it provides the capability of non-monotonic inference (e.g., predicate Answer Set Programming) that can be used to develop novel and effective first-order modal non-monotonic inference engines.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Apt, K., Blair, H., Walker, A.: Towards a Theory of Declarative Knowledge. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 89–148. Morgan Kaufmann Publishers, San Francisco (1988)

    Google Scholar 

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

    Google Scholar 

  3. Clark, K.L.: Negation as Failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293–322. Prenum Press, New York (1978)

    Google Scholar 

  4. Colmerauer, A.: Prolog and Infinite Trees. In: Clark, K.L., Tarnlund, S.-A. (eds.) Logic Programming, pp. 293–322. Prenum Press, New York (1978)

    Google Scholar 

  5. Fages, F.: Consistency of Clark’s Completion and Existence of Stable Models. Journal of Methods of Logic in Computer Science 1, 51–60 (1994)

    Google Scholar 

  6. Fitting, M.: A Kripke-Kleene Semantics for Logic Programs. Journal of Logic Programming 2, 295–312 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  7. Gupta, G., Bansal, A., Min, R., Simon, L., Mallya, A.: Coinductive Logic Programming and Its Applications (Tutorial Paper). In: Dahl, V., Niemelä, I. (eds.) ICLP 2007. LNCS, vol. 4670, pp. 27–44. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  8. Jaffar, J., Lassez, J.-L.: Maher, M. J.: Prolog-II as an Instance of the Logic Programming Language Scheme. In: Wirsing, M. (ed.) Formal Descriptions of Programming Concepts III, pp. 275–299. North-Holland, Amsterdam (1986)

    Google Scholar 

  9. Jaffar, J., Stuckey, P.: Semantics of Infinite Tree Logic Programming. Theoretical Computer Science 46(2-3), 141–158 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  10. Lloyd, J.W.: Foundations of Logic Programming. Springer, Heidelberg (1987)

    MATH  Google Scholar 

  11. Maher, M.J.: Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees. In: Proc. 3rd Logic in Computer Science Conf., Edinburgh, UK, pp. 348–357 (1988)

    Google Scholar 

  12. Min, R.: Predicate Answer Set Programming with Coinduction. Ph.D. Dissertation, Department of Computer Science. The University of Texas at Dallas (2009), http://www.utdallas.edu/~rkm010300/research/Min2009Thesis.pdf

  13. Min, R., Bansal, A., Gupta, G.: Towards Predicate Answer Set Programming Via Coinductive Logic Programming. In: AIAI 2009 (2009)

    Google Scholar 

  14. Min, R., Gupta, G.: Coinductive Logic Programming and Its Application to Boolean Sat. In: Flairs 2009 (2009)

    Google Scholar 

  15. Shepherdson, J.: Negation in Logic Programming. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 19–88. Morgan Kaufmann Pub., San Francisco (1988)

    Google Scholar 

  16. Simon, L., Bansal, A., Mallya, A., Gupta, G.: Co-Logic Programming. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 472–483. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  17. 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 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Texas, Dallas, Richardson, TX, 75080, USA

    Richard Min & Gopal Gupta

Authors
  1. Richard Min
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gopal Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, K.U.Leuven, Celestijnenlaan 200A, B-3001, Heverlee, Belgium

    Danny De Schreye

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Min, R., Gupta, G. (2010). Coinductive Logic Programming with Negation. In: De Schreye, D. (eds) Logic-Based Program Synthesis and Transformation. LOPSTR 2009. Lecture Notes in Computer Science, vol 6037. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12592-8_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12592-8_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12591-1

  • Online ISBN: 978-3-642-12592-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation