Coinductive logic programming and its applications

  • Authors:
  • Gopal Gupta;Ajay Bansal;Richard Min;Luke Simon;Ajay Mallya

  • Affiliations:
  • Department of Computer Science, University of Texas at Dallas, Richardson, TX;Department of Computer Science, University of Texas at Dallas, Richardson, TX;Department of Computer Science, University of Texas at Dallas, Richardson, TX;Department of Computer Science, University of Texas at Dallas, Richardson, TX;Department of Computer Science, University of Texas at Dallas, Richardson, TX

  • Venue:
  • ICLP'07 Proceedings of the 23rd international conference on Logic programming
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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.