Answer Set Programming: Related with Other Solving Paradigms

Research output: Contribution to journalArticleScientificpeer-review

Standard

Answer Set Programming : Related with Other Solving Paradigms. / Janhunen, Tomi.

In: KUENSTLICHE INTELLIGENZ, Vol. 32, No. 2-3, 09.06.2018, p. 125-131.

Research output: Contribution to journalArticleScientificpeer-review

Harvard

APA

Vancouver

Author

Bibtex - Download

@article{47c9c3ac2a8f4b9dbadc8c05e30079eb,
title = "Answer Set Programming: Related with Other Solving Paradigms",
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.",
keywords = "Declarative programming, Satisfiability Checking, Constraint satisfiaction, Theory reasoning",
author = "Tomi Janhunen",
year = "2018",
month = "6",
day = "9",
doi = "10.1007/s13218-018-0543-y",
language = "English",
volume = "32",
pages = "125--131",
journal = "KUENSTLICHE INTELLIGENZ",
issn = "0933-1875",
number = "2-3",

}

RIS - Download

TY - JOUR

T1 - Answer Set Programming

T2 - Related with Other Solving Paradigms

AU - Janhunen, Tomi

PY - 2018/6/9

Y1 - 2018/6/9

N2 - 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.

AB - 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.

KW - Declarative programming

KW - Satisfiability Checking

KW - Constraint satisfiaction

KW - Theory reasoning

U2 - 10.1007/s13218-018-0543-y

DO - 10.1007/s13218-018-0543-y

M3 - Article

VL - 32

SP - 125

EP - 131

JO - KUENSTLICHE INTELLIGENZ

JF - KUENSTLICHE INTELLIGENZ

SN - 0933-1875

IS - 2-3

ER -

ID: 29615071