Co-Logic Programming: Extending Logic Programming with Coinduction

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.

• Type: Conference
• Year: 2007
• Where: ICALP
• Authors: Luke Simon, Ajay Bansal, Ajay Mallya, Gopal Gupta
• Keywords: Coinductive Logic Programming, Concurrent Communicating Predicates, ICALP 2007, Logic Programming, Theoretical Computer Science