Co-logic programming: Extending logic programming with coinduction

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

Volumn 4596 LNCS, Issue , 2007, Pages 472-483

  Simon, Luke ^a   Bansal, Ajay ^a   Mallya, 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 SCIENCE; MODEL CHECKING; TREES (MATHEMATICS);

BISIMILARITY PROOFS; LAZY EVALUATION;

LOGIC PROGRAMMING;

EID: 38149118049     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73420-8_42     Document Type: Conference Paper

References (10)

1. Krzysztof, R.: Apt. Logic programming. In: Handbook of Theoretical Computer Science, pp. 493-574. MIT Press, Cambridge (1990)
2. Barwise, J., Moss, L.: Vicious Circles: On the Mathematics of Non-Wellfounded Phenomena. CSLI Pub. (1996)
3. Colmerauer, A.: Equations and inequations on finite and infinite trees. In: FGCS'84
4. Courcelle, B.: Fundamental properties of infinite trees. TCS, pp. 95-212 (1983)
5. Hanus, M.: Integration of functions into LP. J. Logic Prog. 19, 20, 583-628 (1994)
6. Jaffar, J., Stuckey, P.J.: Semantics of infinite tree LP. TCS 46(2-3), 141-158 (1986)
7. Lloyd, J.W.: Foundations of LP, 2nd edn. Springer, Heidelberg (1987)
8. Rocha, R., et al.: Theory and Practice of Logic Programming 5(1-2), 161-205, (2005)Tabling Engine That Can Exploit Or-Parallelism. In: ICLP 2001, pp. 43-58 (2001)
9. Simon, L., Mallya, A., Bansal, A., Gupta, G.: Coinductive Logic Programming. In: Etalle, S., Truszczyński, M. (eds.) ICLP 2006. LNCS, vol. 4079, pp. 330-345. Springer, Heidelberg (2006)
10. Simon, L., Mallya, A., Bansal, A., Gupta, G.: Co-Logic Programming: Extending Logic Programming with Coinduction. TR #UTDCS-21-06, UT Dallas (2006)