Translation-based Constraint Answer Set Solving
classification
💻 cs.AI
keywords
answerconsistencyconstraintachievesapproachboundcomputationaldefined
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.