Skip to main content
Article thumbnail
Location of Repository

Translation-based Constraint Answer Set Solving

By Christian Drescher and Toby Walsh

Abstract

We solve constraint satisfaction problems through translation to answer set programming (ASP). Our reformulations have the property that unit-propagation in the ASP solver achieves well defined local consistency properties like arc, bound and range consistency. Experiments demonstrate the computational value of this approach.Comment: Self-archived version for IJCAI'11 Best Paper Track submissio

Topics: Computer Science - Artificial Intelligence
Year: 2011
OAI identifier: oai:arXiv.org:1104.3927
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/abs/1104.3927 (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.