Answer Set Programming: Related with Other Solving Paradigms

Research output: Contribution to journalArticleScientificpeer-review

Researchers

Research units

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.

Details

Original languageEnglish
Pages (from-to)125-131
Number of pages7
JournalKUENSTLICHE INTELLIGENZ
Volume32
Issue number2-3
Publication statusPublished - 9 Jun 2018
MoE publication typeA1 Journal article-refereed

    Research areas

  • Declarative programming, Satisfiability Checking, Constraint satisfiaction, Theory reasoning

ID: 29615071