A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Infinite Computation, Co-induction and Computational Logic
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
We give an overview of the coinductive logic programming paradigm. We discuss its applications to modeling ω-automata, model checking, verification, non-monotonic reasoning, developing SAT solvers, etc. We also discuss future research directions.
doi:10.1007/978-3-642-22944-2_4
fatcat:v2klxrhr6vfpfagwncfzpg56v4