Co-Logic Programming: Extending Logic Programming with Coinduction

作者: Luke Simon , Ajay Bansal , Ajay Mallya , Gopal Gupta

DOI: 10.1007/978-3-540-73420-8_42

关键词:

摘要: In this paper we present the theory and practice of co-logic programming (co-LP for brevity), a paradigm that combines both inductive coinductive logic programming. Co-LP is natural generalization programming, which in turn generalizes other extensions such as infinite trees, lazy predicates, concurrent communicating predicates. has applications to rational verifying infinitary properties, evaluation, LP, model checking, bisimilarity proofs, etc.

参考文章(12)
Alain Colmerauer, Equations and Inequations on Finite and Infinite Trees. Future Generation Computer Systems. pp. 85- 99 ,(1984)
Luke Simon, Ajay Mallya, Ajay Bansal, Gopal Gupta, Coinductive logic programming international conference on logic programming. pp. 330- 345 ,(2006) , 10.1007/11799573_25
Ricardo Rocha, Fernando Silva, Vítor Santos Costa, On a Tabling Engine That Can Exploit Or-Parallelism international conference on logic programming. pp. 43- 58 ,(2001) , 10.1007/3-540-45635-X_11
Bruno Courcelle, Fundamental properties of infinite trees Theoretical Computer Science. ,vol. 25, pp. 95- 169 ,(1983) , 10.1007/978-94-009-7893-5_13
Elio Giovannetti, Giorgio Levi, Corrado Moiso, Catuscia Palamidessi, Kernel-LEAF: a logic plus functional language Journal of Computer and System Sciences. ,vol. 42, pp. 139- 185 ,(1991) , 10.1016/0022-0000(91)90009-T
Joxan Jaffar, Peter J. Stuckey, Semantics of infinite tree logic programming Theoretical Computer Science. ,vol. 46, pp. 141- 158 ,(1986) , 10.1016/0304-3975(86)90027-7
RICARDO ROCHA, FERNANDO SILVA, VÍTOR SANTOS COSTA, On applying or-parallelism and tabling to logic programs Theory and Practice of Logic Programming. ,vol. 5, pp. 161- 205 ,(2005) , 10.1017/S1471068404002030