Abstrakti
Answer set programming languages have been extended to support linear constraints and objective functions. However, the variables allowed in the constraints and functions are restricted to integer and Boolean domains, respectively. In this paper, we generalize the domain of linear constraints to real numbers and that of objective functions to integers. Since these extensions are based on a translation from logic programs to mixed integer programs, we compare the translation-based answer set programming approach with the native mixed integer programming approach using a number of benchmark problems.
Alkuperäiskieli | Englanti |
---|---|
Otsikko | International Conference on Applications of Declarative Programming and Knowledge Management, INAP 2013, Kiel, 11-13 September, 2013 |
Toimittajat | Michael Hanus, Ricardo Rocha |
Kustantaja | Springer |
Sivut | 118-135 |
Sivumäärä | 18 |
ISBN (elektroninen) | 978-3-319-08909-6 |
ISBN (painettu) | 978-3-319-08908-9 |
DOI - pysyväislinkit | |
Tila | Julkaistu - 2014 |
OKM-julkaisutyyppi | A4 Artikkeli konferenssijulkaisuussa |
Tapahtuma | International Conference on Applications of Declarative Programming and Knowledge Management - Kiel, Saksa Kesto: 11 syysk. 2013 → 13 syysk. 2013 Konferenssinumero: 20 |
Julkaisusarja
Nimi | Lecture Notes in Computer Science |
---|---|
Vuosikerta | 8439 LNAI |
ISSN (painettu) | 0302-9743 |
ISSN (elektroninen) | 1611-3349 |
Conference
Conference | International Conference on Applications of Declarative Programming and Knowledge Management |
---|---|
Lyhennettä | INAP |
Maa/Alue | Saksa |
Kaupunki | Kiel |
Ajanjakso | 11/09/2013 → 13/09/2013 |