A translational approach to constraint answer set solving

We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ASP. We show how constraints on finite domains can be decomposed into logic programs such that unit-propagation achieves...

Full description

Saved in:
Bibliographic Details
Published in:Theory and practice of logic programming Vol. 10; no. 4-6; pp. 465 - 480
Main Authors: DRESCHER, CHRISTIAN, WALSH, TOBY
Format: Journal Article
Language:English
Published: Cambridge, UK Cambridge University Press 01.07.2010
Subjects:
Regular Papers
constraint processing
decomposition
answer set programming
ISSN:1471-0684, 1475-3081
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ASP. We show how constraints on finite domains can be decomposed into logic programs such that unit-propagation achieves arc, bound or range consistency. Experiments with our encodings demonstrate their computational impact.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1471-0684
1475-3081
DOI:10.1017/S1471068410000220