Coinductive logic programming

Luke Simon, Ajay Mallya, Ajay Bansal, Gopal Gupta

Research output: Chapter in Book/Report/Conference proceedingConference contribution

65 Scopus citations


We extend logic programming's semantics with the semantic dual of traditional Herbrand semantics by using greatest fixed-points in place of least fixed-points. Executing a logic program then involves using coinduction to check inclusion in the greatest fixed-point. The resulting coinductive logic programming language is syntactically identical to, yet semantically subsumes logic programming with rational terms and lazy evaluation. We present a novel formal operational semantics that is based on synthesizing a coinductive hypothesis for this coinductive logic programming language. We prove that this new operational semantics is equivalent to the declarative semantics. Our operational semantics lends itself to an elegant and efficient goal directed proof search in the presence of rational terms and proofs. We describe a prototype implementation of this operational semantics along with applications of coinductive logic programming.

Original languageEnglish (US)
Title of host publicationLogic Programming - 22nd International Conference, ICLP 2006, Proceedings
PublisherSpringer Verlag
Number of pages16
ISBN (Print)9783540366355
StatePublished - 2006
Externally publishedYes
Event22nd International Conference on Logic Programming, ICLP 2006 - Seattle, WA, United States
Duration: Aug 17 2006Aug 20 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4079 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other22nd International Conference on Logic Programming, ICLP 2006
Country/TerritoryUnited States
CitySeattle, WA

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Coinductive logic programming'. Together they form a unique fingerprint.

Cite this