Learning Centre

Answer Set Programming

 |  Login

Show simple item record

dc.contributor Aalto-yliopisto fi
dc.contributor Aalto University en
dc.contributor.author Janhunen, Tomi
dc.date.accessioned 2018-12-10T10:16:14Z
dc.date.available 2018-12-10T10:16:14Z
dc.date.issued 2018-06-09
dc.identifier.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 en
dc.identifier.issn 0933-1875
dc.identifier.other PURE UUID: 47c9c3ac-2a8f-4b9d-badc-8c05e30079eb
dc.identifier.other PURE ITEMURL: https://research.aalto.fi/en/publications/47c9c3ac-2a8f-4b9d-badc-8c05e30079eb
dc.identifier.other PURE FILEURL: https://research.aalto.fi/files/30223826/SCI_Janhunen_Answer_Set_Programming_KI_final18a.pdf
dc.identifier.uri https://aaltodoc.aalto.fi/handle/123456789/35027
dc.description.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. en
dc.format.extent 7
dc.format.extent 125-131
dc.format.mimetype application/pdf
dc.language.iso en en
dc.relation.ispartofseries KUENSTLICHE INTELLIGENZ en
dc.relation.ispartofseries Volume 32, issue 2-3 en
dc.rights openAccess en
dc.title Answer Set Programming en
dc.type A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä fi
dc.description.version Peer reviewed en
dc.contributor.department Centre of Excellence in Computational Inference, COIN
dc.contributor.department Department of Computer Science en
dc.subject.keyword Declarative programming
dc.subject.keyword Satisfiability Checking
dc.subject.keyword Constraint satisfiaction
dc.subject.keyword Theory reasoning
dc.identifier.urn URN:NBN:fi:aalto-201812106042
dc.identifier.doi 10.1007/s13218-018-0543-y
dc.date.embargo info:eu-repo/date/embargoEnd/2019-06-09

Files in this item

Files Size Format View

There are no open access files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search archive

Advanced Search

article-iconSubmit a publication