TY - GEN

T1 - Co-logic programming

T2 - 34th International Colloquium on Automata, Languages and Programming, ICALP 2007

AU - Simon, Luke

AU - Bansal, Ajay

AU - Mallya, Ajay

AU - Gupta, Gopal

PY - 2007/1/1

Y1 - 2007/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=38149118049&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38149118049&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-73420-8_42

DO - 10.1007/978-3-540-73420-8_42

M3 - Conference contribution

AN - SCOPUS:38149118049

SN - 3540734198

SN - 9783540734192

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 472

EP - 483

BT - Automata, Languages and Programming - 34th International Colloquium, ICALP 2007, Proceedings

PB - Springer Verlag

Y2 - 9 July 2007 through 13 July 2007

ER -