Modelling Grammar Constraints with Answer Set Programming

Christian Drescher & Toby Walsh
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.
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.