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