2026-07-20T05:42:46Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3172 2024-03-06T10:33:53Z ddc:004 open_access

Modelling Grammar Constraints with Answer Set Programming Drescher, Christian Walsh, Toby answer set programming grammar- regular- precedence constraint 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Christian Drescher and Toby Walsh 2011 Is Part Of LIPIcs, Volume 11, Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) (2011) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICLP.2011.28 urn:nbn:de:0030-drops-31723 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.28 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode