Answer set programs with one incremental variable

Abstract

In the past decade, Answer Set Programming (ASP) has emerged as a popular paradigm for declarative problem solving, as such a number of ASP solvers have been developed. However, most existing solvers require variables occurring in a logic program to be bounded by some finite domains, which limits their applications in one way or another. In this thesis, we introduce answer set programs with one incremental variable to overcome this limitation. Based on existing ASP solving techniques, an approach to solve answer set programs with one incremental variable is proposed, and a prototype solver is then developed based on this approach. By conducting sufficient experiments, our approach is showed to be comparable to iClingo's modular domain description approach under the incremental problem solving setting.

Date of Award	2014
Original language	English