An Elimination Algorithm 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:
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Year:
2008

Citing 5
Cited 0

A generic arc-consistency algorithm and its specializations

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
Using pivot consistency to decompose and solve functional CSPS

Journal of Artificial Intelligence Research
When functional and bijective constraints make a CSP polynomial

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Functional constraints are studied in Constraint Satisfaction Problems (CSP) using consistency concepts (e.g., [1,4]). In this paper, we propose a new method --- variable substitution --- to process functional constraints. The idea is that if a constraint is functional on a variable, this variable in another constraint can be substituted using the functional constraint without losing any solution. We design an efficient algorithm to reduce, in $\mathcal{O}(ed^2)$, a general binary CSP containing functional constraints into a canonical form which simplifies the problem and makes the functional portion trivially solvable. When the functional constraints are also bi-functional, then the algorithm is linear in the size of the CSP.