Quantifying solutions in answer set programming
Halit Erdoğan · Sabanci University · 2010
Answer Set Programming (ASP) is a declarative programming paradigm oriented towards solving NP-hard problems. Due to the expressive rep-resentation language and efficient solvers, ASP can be useful for a wide-range of knowledge-intensive applications from different fields. In ASP, the idea is to provide a declarative rep-resentation of the problem as an ASP program whose models (called answer sets) correspond to solutions. Since many problems have numerous solutions, instead of computing all solutions, it is sometimes desirable to compute a subset of preferred solutions. With this motivation, we present novel methods to quantify answer sets in ASP for extracting preferred solutions only. We show the effectiveness of these methods on real world applications. 1.