Coinductive logic programming

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

Volumn 4079 LNCS, Issue , 2006, Pages 330-345

  Simon, Luke ^a   Mallya, Ajay ^a   Bansal, Ajay ^a   Gupta, Gopal ^a  

^a The University of Texas at Dallas   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING LANGUAGES; FORMAL LOGIC; SEMANTICS; SYNTACTICS;

LOGIC PROGRAMS; OPERATIONAL SEMANTICS;

LOGIC PROGRAMMING;

EID: 33749319976     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11799573_25     Document Type: Conference Paper

References (21)

1. K. R. Apt. Logic programming. Ch. 15. Handbook of Theoretical Computer Science, 493-574. MIT Press, 1990.
2. J. Barwise, L. Moss. Vicious Circles: On the Mathematics of Non-Wellfounded Phenomena. CSLI Publications, 1996.
3. A. Colmerauer. Equations and inequations on finite and infinite trees. In Proc. FGCS-84: pages 85-99, Tokyo, 1984.
4. B. Courcelle. Fundamental properties of infinite trees. TCS, pp:95-212, 1983.
5. G. Gupta. Verifying Properties of Cyclic Data-structures with Tabled Unification. Internal Memo. New Mexico State University. February 2000.
6. G. Gupta, E. Pontelli. Constraint-based Specification and Verification of Real-time Systems. In Proc. IEEE Real-time Symposium '97. pp. 230-239.
7. G. Gupta. Next Generation of Logic Programming Systems. Technical Report UTD-42-03, University of Texas, Dallas. 2003.
8. M. Hanus. Integration of functions into LP. J. Logic Prog., 19 & 20:583-628, 1994.
9. J. Jaffar, A. E. Santosa, R. Voicu. A CLP proof method for timed automata. In RTSS, pages 175-186, 2004.
10. J. Jaffar, P. J. Stuckey. Semantics of infinite tree LP. TCS, 46(2-3):141-158, 1986.
11. M. Jaume. Logic Programming and Co-inductive Definitions CSL, 2000.
12. J.W. Lloyd. Foundations of LP. Springer, 2nd. edition, 1987.
13. A. Mallya. Deductive Multi-valued Model Checking, ICLP'05, Springer LNCS 3368. pp. 297-310.
14. M. A. Nait-Abdallah. On the Interpretation of Infinite Computations in Logic Programming Proc. ICALP 1984. pp. 358-370.
15. B. Pierce. Types and Programming Languages. MIT Press, Cambridge, MA, 2002.
16. Y. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, D. S. Warren, et al. Efficient Model Checking Using Tabled Resolution. CAV 1997. pp. 143-154.
17. R. Rocha, F. Silva, V. S. Costa Theory and Practice of Logic Programming 5(1-2). 161-205 (2005)
18. Tabling Engine That Can Exploit Or-Parallelism. ICLP 2001: 43-58
19. L. Simon. Coinductive LP. Internal memo, UT Dallas, March 2004.
20. L. Simon, A. Mallya, A. Bansal, and G. Gupta. Co-Logic Programming: Extending Logic Programming with Coinduction. Tech. Report, UT Dallas, UTDCS-21-06.
21. L. Simon, A. Mallya, A. Bansal, and G. Gupta. Coinductive Logic Programming. Technical Report, UT Dallas, UTDCS-11-06, Mar 2006.