Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-73420-8_42 | ICALP |
Keywords | Field | DocType |
infinitary property,model checking,logic programming,lazy predicate,coinductive logic programming,co-logic programming,bisimilarity proof,lazy evaluation,infinite tree,concurrent lp | Functional logic programming,Computational logic,Discrete mathematics,Programming language,Horn clause,Computer science,Inductive programming,Prolog,Concurrent constraint logic programming,Declarative programming,Logic programming | Conference |
Volume | ISSN | ISBN |
4596 | 0302-9743 | 3-540-73419-8 |
Citations | PageRank | References |
42 | 2.03 | 8 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luke Simon | 1 | 142 | 8.46 |
| Ajay Bansal | 2 | 320 | 27.21 |
| Ajay Mallya | 3 | 150 | 8.77 |
| Gopal Gupta | 4 | 1404 | 143.46 |