Coinductive logic programming and its application to boolean SAT

Abstract

Coinduction has recently been introduced into logic programming by Simon et al. The resulting paradigm, termed coinductive logic programming (co-LP), allows one to model and reason about infinite processes and objects. Co-LP extended with negation has many interesting applications: for instance in developing top-down, goaldirected evaluation strategies for Answer Set Programming. In this paper we show yet another application of co-LP, namely, elegantly realizing Boolean SAT solvers