Modelling Grammar Constraints with Answer Set Programming

Authors Christian Drescher, Toby Walsh

Thumbnail PDF


  • Filesize: 473 kB
  • 12 pages

Document Identifiers

Author Details

Christian Drescher
Toby Walsh

Cite AsGet BibTex

Christian Drescher and Toby Walsh. Modelling Grammar Constraints with Answer Set Programming. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 28-39, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (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.
  • answer set programming
  • grammar-
  • regular-
  • precedence constraint


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail