Solving functional constraints by variable substitution

  • Authors:

  • Yuanlin Zhang;Roland h. c. Yap

  • Affiliations:

  • Department of computer science, texas tech university, lubbock, tx 79409-3104, usa (e-mail: yzhang@cs.ttu.edu);School of computing, national university of singapore, 13 computing drive, 117417, singapore (e-mail: ryap@comp.nus.edu.sg)

  • Venue:
  • Theory and Practice of Logic Programming
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Functional constraints and bi-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 Constraint Satisfaction Problem(s)-based solvers which use local consistency, for example, 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 nonfunctional 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 on random problems show that variable elimination can significantly improve the efficiency of solving problems with functional constraints.