Translation-based Constraint Answer Set Solving

04/20/2011
by   Christian Drescher, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/12/2017

Clingcon: The Next Generation

We present the third generation of the constraint answer set system clin...
research
08/23/2018

Transpiling Programmable Computable Functions to Answer Set Programs

Programming Computable Functions (PCF) is a simplified programming langu...
research
10/11/2012

Multi-threaded ASP Solving with clasp

We present the new multi-threaded version of the state-of-the-art answer...
research
04/26/2023

Conjunctive Query Based Constraint Solving For Feature Model Configuration

Feature model configuration can be supported on the basis of various typ...
research
08/18/2011

Solving puzzles described in English by automated translation to answer set programming and learning how to do that translation

We present a system capable of automatically solving combinatorial logic...
research
08/16/2011

Finding Similar/Diverse Solutions in Answer Set Programming

For some computational problems (e.g., product configuration, planning, ...
research
06/18/2014

The Propagation Depth of Local Consistency

We establish optimal bounds on the number of nested propagation steps in...

Please sign up or login with your details

Forgot password? Click here to reset