Name
Abstract | ||
|---|---|---|
Coinduction has recently been introduced as a powerful technique for reasoning about unfounded sets, unbounded structures, and interactive computations. Where induction corresponds to least fixed point semantics, coinduction corresponds to greatest fixed point semantics. In this paper we discuss the introduction of coinduction into logic programming. We discuss applications of coinductive logic programming to verification and model checking, lazy evaluation, concurrent logic programming and non-monotonic reasoning. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-74610-2_4 | ICLP |
Keywords | Field | DocType |
induction corresponds,interactive computation,greatest fixed point semantics,non-monotonic reasoning,logic programming,coinduction corresponds,coinductive logic programming,lazy evaluation,fixed point semantics,concurrent logic programming,fixed point,model checking | Functional logic programming,Computational logic,Concurrent logic programming,Programming language,Horn clause,Computer science,Algorithm,Theoretical computer science,Coinduction,Logic programming,Higher-order logic,Well-founded semantics | Conference |
Volume | ISSN | ISBN |
4670 | 0302-9743 | 3-540-74608-0 |
Citations | PageRank | References |
42 | 1.72 | 15 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gopal Gupta | 1 | 1404 | 143.46 |
| Ajay Bansal | 2 | 320 | 27.21 |
| Richard Min | 3 | 69 | 3.82 |
| Luke Simon | 4 | 142 | 8.46 |
| Ajay Mallya | 5 | 150 | 8.77 |