Efficient Algorithms for Functional Constraints

Authors:
Yuanlin Zhang;Roland H. Yap;Chendong Li;Satyanarayana Marisetti
Affiliations:
Texas Tech University, USA;National University of Singapore, Singapore;Texas Tech University, USA;Texas Tech University, USA
Venue:
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Year:
2008

Citing 9
Cited 1

The CLP( R ) language and system

ACM Transactions on Programming Languages and Systems (TOPLAS)
A generic arc-consistency algorithm and its specializations

Artificial Intelligence
Fast parallel constraint satisfaction

Artificial Intelligence
Functional elimination and 0/1/All constraints

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Bucket elimination: a unifying framework for reasoning

Artificial Intelligence
Using pivot consistency to decompose and solve functional CSPS

Journal of Artificial Intelligence Research
Increasing functional constraints need to be checked only once

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
An optimal coarse-grained arc consistency algorithm

Artificial Intelligence
Views and iterators for generic constraint implementations

CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming

Solving functional constraints by variable substitution

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Functional constraints are an important constraint class in Constraint Programming (CP) systems, in particular for Constraint Logic Programming (CLP) systems. CP systems with finite domain constraints usually employ CSP-based solvers which use local consistency, e.g. arc consistency. We introduce a new approach which is based instead on variable substitution . We obtain efficient algorithms for reducing systems involving functional and bi-functional constraints together with other non-functional constraints. It also solves globally any CSP where there exists a variable such that any other variable is reachable from it through a sequence of functional constraints. Our experiments show that variable elimination can significantly improve the efficiency of solving problems with functional constraints.