Answer Set Programming: A Declarative Approach to Solving Challenging Search Problems

Ilkka Niemelä

doi:10.1109/ISMVL.2011.61

Answer Set Programming: A Declarative Approach to Solving Challenging Search Problems

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussa › Conference contribution › Scientific › vertaisarvioitu

Abstrakti

Answer Set Programming (ASP) is a declarative programming paradigm targeted to solving search problems. The basic idea of ASP is similar to, for example, SAT-based planning or constraint satisfaction problems but ASP provides a more powerful knowledge representation language for effective problem encoding. A number of successful ASP systems have already been developed and applied in a large range of areas. The talk explains the theoretical underpinnings of ASP, introduces the answer set programming paradigm, outlines computational techniques used in current ASP solvers, and discusses some interesting applications of the approach.

Alkuperäiskieli	Englanti
Otsikko	Proceedings - 41st IEEE International Symposium on Multiple-Valued Logic (ISMVL 2011), Tuusula, Finland, 23-25 May 2011
Kustantaja	IEEE
Sivut	139-141
Sivumäärä	3
ISBN (painettu)	9780769544052
DOI - pysyväislinkit	https://doi.org/10.1109/ISMVL.2011.61
Tila	Julkaistu - 2011
OKM-julkaisutyyppi	A4 Artikkeli konferenssijulkaisuussa
Tapahtuma	International Symposium on Multiple-Valued Logic - Tuusula, Suomi Kesto: 23 toukok. 2011 → 25 toukok. 2011 Konferenssinumero: 41

Julkaisusarja

Nimi	International Symposium on Multiple-Valued Logic
Kustantaja	IEEE COMPUTER SOC
ISSN (painettu)	0195-623X

Conference

Conference	International Symposium on Multiple-Valued Logic
Lyhennettä	ISMVL
Maa/Alue	Suomi
Kaupunki	Tuusula
Ajanjakso	23/05/2011 → 25/05/2011

Pääsy asiakirjaan

10.1109/ISMVL.2011.61

OpenUrl-saatavuus

Koko teksti

Siteeraa tätä

@inproceedings{28014dcb122d48adb3f0c4f232c2a179,

title = "Answer Set Programming: A Declarative Approach to Solving Challenging Search Problems",

abstract = "Answer Set Programming (ASP) is a declarative programming paradigm targeted to solving search problems. The basic idea of ASP is similar to, for example, SAT-based planning or constraint satisfaction problems but ASP provides a more powerful knowledge representation language for effective problem encoding. A number of successful ASP systems have already been developed and applied in a large range of areas. The talk explains the theoretical underpinnings of ASP, introduces the answer set programming paradigm, outlines computational techniques used in current ASP solvers, and discusses some interesting applications of the approach.",

keywords = "STABLE MODEL SEMANTICS",

author = "Ilkka Niemel{\"a}",

year = "2011",

doi = "10.1109/ISMVL.2011.61",

language = "English",

isbn = "9780769544052",

series = "International Symposium on Multiple-Valued Logic",

publisher = "IEEE",

pages = "139--141",

booktitle = "Proceedings - 41st IEEE International Symposium on Multiple-Valued Logic (ISMVL 2011), Tuusula, Finland, 23-25 May 2011",

address = "United States",

note = "International Symposium on Multiple-Valued Logic, ISMVL ; Conference date: 23-05-2011 Through 25-05-2011",

}

Niemelä, I 2011, Answer Set Programming: A Declarative Approach to Solving Challenging Search Problems. julkaisussa Proceedings - 41st IEEE International Symposium on Multiple-Valued Logic (ISMVL 2011), Tuusula, Finland, 23-25 May 2011., 5954222, International Symposium on Multiple-Valued Logic, IEEE, Sivut 139-141, International Symposium on Multiple-Valued Logic, Tuusula, Suomi, 23/05/2011. https://doi.org/10.1109/ISMVL.2011.61

Answer Set Programming: A Declarative Approach to Solving Challenging Search Problems. / Niemelä, Ilkka.
Proceedings - 41st IEEE International Symposium on Multiple-Valued Logic (ISMVL 2011), Tuusula, Finland, 23-25 May 2011. IEEE, 2011. s. 139-141 5954222 (International Symposium on Multiple-Valued Logic).

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussa › Conference contribution › Scientific › vertaisarvioitu

TY - GEN

T1 - Answer Set Programming

T2 - International Symposium on Multiple-Valued Logic

AU - Niemelä, Ilkka

N1 - Conference code: 41

PY - 2011

Y1 - 2011

N2 - Answer Set Programming (ASP) is a declarative programming paradigm targeted to solving search problems. The basic idea of ASP is similar to, for example, SAT-based planning or constraint satisfaction problems but ASP provides a more powerful knowledge representation language for effective problem encoding. A number of successful ASP systems have already been developed and applied in a large range of areas. The talk explains the theoretical underpinnings of ASP, introduces the answer set programming paradigm, outlines computational techniques used in current ASP solvers, and discusses some interesting applications of the approach.

AB - Answer Set Programming (ASP) is a declarative programming paradigm targeted to solving search problems. The basic idea of ASP is similar to, for example, SAT-based planning or constraint satisfaction problems but ASP provides a more powerful knowledge representation language for effective problem encoding. A number of successful ASP systems have already been developed and applied in a large range of areas. The talk explains the theoretical underpinnings of ASP, introduces the answer set programming paradigm, outlines computational techniques used in current ASP solvers, and discusses some interesting applications of the approach.

KW - STABLE MODEL SEMANTICS

U2 - 10.1109/ISMVL.2011.61

DO - 10.1109/ISMVL.2011.61

M3 - Conference contribution

SN - 9780769544052

T3 - International Symposium on Multiple-Valued Logic

SP - 139

EP - 141

BT - Proceedings - 41st IEEE International Symposium on Multiple-Valued Logic (ISMVL 2011), Tuusula, Finland, 23-25 May 2011

PB - IEEE

Y2 - 23 May 2011 through 25 May 2011

ER -

Answer Set Programming: A Declarative Approach to Solving Challenging Search Problems

Abstrakti

Julkaisusarja

Conference

Pääsy asiakirjaan

OpenUrl-saatavuus

Sormenjälki

Siteeraa tätä