Abstract
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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
APA
Gupta, G., Saeedloei, N., DeVries, B., Min, R., Marple, K., & Kluźniak, F. (2011). Infinite computation, co-induction and computational logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6859 LNCS, pp. 40–54). https://doi.org/10.1007/978-3-642-22944-2_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free