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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Simon, L., Bansal, A., Mallya, A., & Gupta, G. (2007). Co-logic programming: Extending logic programming with coinduction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4596 LNCS, pp. 472–483). Springer Verlag. https://doi.org/10.1007/978-3-540-73420-8_42
Mendeley helps you to discover research relevant for your work.