Modelling Grammar Constraints with Answer Set Programming
Christian Drescher, Toby Walsh · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2011
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.