Infinite computation, co-induction and computational logic

  • Authors:
  • Gopal Gupta;Neda Saeedloei;Brian DeVries;Richard Min;Kyle Marple;Feliks Kluźniak

  • Affiliations:
  • Department of Computer Science, University of Texas at Dallas, Richardson, TX;Department of Computer Science, University of Texas at Dallas, Richardson, TX;Department of Computer Science, University of Texas at Dallas, Richardson, TX;Department of Computer Science, University of Texas at Dallas, Richardson, TX;Department of Computer Science, University of Texas at Dallas, Richardson, TX;Department of Computer Science, University of Texas at Dallas, Richardson, TX

  • Venue:
  • CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We give an overview of the coinductive logic programming paradigm. We discuss its applications to modeling ω-automata, model checking, verification, non-monotonic reasoning, developing SAT solvers, etc. We also discuss future research directions.