Answer Set Programming: Related with Other Solving Paradigms

No Thumbnail Available

Access rights

openAccess
acceptedVersion

URL

Journal Title

Journal ISSN

Volume Title

A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)

Authors

Date

2018-06-09

Department

Department of Computer Science

Major/Subject

Mcode

Degree programme

Language

en

Pages

7

Series

Kuenstliche Intelligenz, Volume 32, issue 2-3, pp. 125-131

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.

Description

Keywords

Declarative programming, Satisfiability Checking, Constraint satisfiaction, Theory reasoning

Other note

DOI

10.1007/s13218-018-0543-y

Citation

Janhunen, T 2018, ' Answer Set Programming : Related with Other Solving Paradigms ', Kuenstliche Intelligenz, vol. 32, no. 2-3, pp. 125-131 . https://doi.org/10.1007/s13218-018-0543-y

Permanent link to this item

https://urn.fi/URN:NBN:fi:aalto-201812106042

Collections

[article-cris] Perustieteiden korkeakoulu / SCI