Stable model semantics for founded bounds

Rehan Abdul Aziz, Geoffrey Chu, Peter J. Stuckey

Research output: Contribution to journalArticleResearchpeer-review

11 Citations (Scopus)


Answer Set Programming (ASP) is a powerful form of declarative programming used in areas such as planning or reasoning. ASP solvers enforce stable model semantics, which rule out solutions representing certain kinds of circular reasoning. Unfortunately, current ASP solvers are incapable of solving problems involving cyclic dependencies between multiple integer or continuous quantities effectively. In this paper, we generalize the notion of stable models to bound founded variables with arbitrary domains, where bounds on such variables need to be justified by some rule in the program in order for the model to be stable. We show how to handle significantly more general rule forms where bound founded variables can act as head or body variables, and where head and body variables can be related via complex constraints subject to certain monotonicity requirements. We describe a new unfounded set detection algorithm which allows us to enforce this generalization of the stable model semantics. We also show how these unfounded sets can be explained in order to allow effective conflict-directed clause learning. The new solver merges the best features of CP, SAT and ASP solvers and allows new types of problems to be solved very efficiently.

Original languageEnglish
Pages (from-to)517-532
Number of pages16
JournalTheory and Practice of Logic Programming
Issue number4-5
Publication statusPublished - 1 Jul 2013
Externally publishedYes


  • answer set programming
  • finite domain solving
  • stable model semantics

Cite this