Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICLP.2011.28
URN: urn:nbn:de:0030-drops-31723
URL: https://drops.dagstuhl.de/opus/volltexte/2011/3172/
Drescher, Christian ; Walsh, Toby
Modelling Grammar Constraints with Answer Set Programming
| pdf-format: |
|
Abstract
Representing and solving constraint satisfaction problems is one of the challenges of artificial intelligence. In this paper, we present answer set programming (ASP) models for an important and very general class of constraints, including all constraints specified via grammars or automata that recognise some formal language. We argue that our techniques are effective and efficient, e.g., unit-propagation of an ASP solver can achieve domain consistency on the original constraint. Experiments demonstrate computational impact.
BibTeX - Entry
@InProceedings{drescher_et_al:LIPIcs:2011:3172,
author = {Christian Drescher and Toby Walsh},
title = {{Modelling Grammar Constraints with Answer Set Programming}},
booktitle = {Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) },
pages = {28--39},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-31-6},
ISSN = {1868-8969},
year = {2011},
volume = {11},
editor = {John P. Gallagher and Michael Gelfond},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3172},
URN = {urn:nbn:de:0030-drops-31723},
doi = {10.4230/LIPIcs.ICLP.2011.28},
annote = {Keywords: answer set programming, grammar-, regular-, precedence constraint}
}
| Keywords: | answer set programming, grammar-, regular-, precedence constraint | |
| Seminar: | Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) | |
| Issue date: | 2011 | |
| Date of publication: | 27.06.2011 |
