Modeling and Language Extensions

  • Martin Gebser University of Potsdam
  • Torsten Schaub University of Potsdam

Abstract

Answer set programming (ASP) has emerged as an approach to declarative problem solving based on the stable model semantics for logic programs. The basic idea is to represent a computational problem by a logic program, formulating constraints in terms of rules, such that its answer sets correspond to problem solutions. To this end, ASP combines an expressive language for high-level modeling with powerful low-level reasoning capacities, provided by off-the-shelf tools. Compact problem representations take advantage of genuine modeling features of ASP, including (first-order) variables, negation by default, and recursion. In this article, we demonstrate the ASP methodology on two example scenarios, illustrating basic as well as advanced modeling and solving concepts. We also discuss mechanisms to represent and implement extended kinds of preferences and optimization. An overview of further available extensions concludes the article.
Published
2016-10-07
How to Cite
Gebser, M., & Schaub, T. (2016). Modeling and Language Extensions. AI Magazine, 37(3), 33-44. https://doi.org/10.1609/aimag.v37i3.2673
Section
Articles