Abstract
Answer set programming (ASP) is a declarative programming paradigm based on an interpretation of logical rules as constraints. In this article, we relate answer set programming with other constraint-based solving paradigms: Boolean satisfiability checking, satisfiability modulo theories, mixed integer programming, and constraint programming. We illustrate the relationship of ASP with these alternative paradigms in terms of simple examples, and identify the main primitives and characteristics of the constraint-based languages under consideration.
| Original language | English |
|---|---|
| Pages (from-to) | 125-131 |
| Number of pages | 7 |
| Journal | KUENSTLICHE INTELLIGENZ |
| Volume | 32 |
| Issue number | 2-3 |
| DOIs | |
| Publication status | Published - 9 Jun 2018 |
| MoE publication type | A1 Journal article-refereed |
Keywords
- Declarative programming
- Satisfiability Checking
- Constraint satisfiaction
- Theory reasoning