AAAI Publications, Twenty-Second International FLAIRS Conference

Font Size: 
Coinductive Logic Programming and its Application to Boolean SAT
Richard Min, Gopal Gupta

Last modified: 2009-03-16

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

Full Text: PDF