An improved generic arc consistency algorithm and its specializations

  • Bing Liu
Constraint Satisfaction and Optimization
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1114)


Many general and specific arc consistency algorithms have been produced in the past for solving Constraint Satisfaction Problems (CSP). The important general algorithms are AC-3, AC-4, AC-5 and AC-6. AC-5 is also a generic algorithm. It can be reduced to AC-3, AC-4 and AC-6. Specific algorithms are efficient specializations of the general ones for specific constraints. Functional, anti-functional and monotonic constraints are three important classes of specific constraints. AC-5 has been specialized to produce an O(ed) algorithm (in time) for these classes of constraints. However, this specialization does not reduce the space requirement. In practical applications, both time and space requirements are important. This paper makes two contributions. First, it proposes an improved generic arc consistency algorithm, called AC-5*, which can be specialized to reduce both time and space complexities. Second, it presents a more efficient technique for handling an important subclass of functional constraints, namely increasing functional constraints (IFC).


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    C. Bessiere and M. Cordier, “Arc-consistency and arc-consistency again,” Artificial Intelligence, 65:179–190, 1994.Google Scholar
  2. [2]
    C. Bessiere, E. Freuder and J-C. Regin, “Using inference to reduce arc consistency computation,” IJCAI-95, 592–598, 1995.Google Scholar
  3. [3]
    Ilog Solver Reference Manual, ILOG, 1993.Google Scholar
  4. [4]
    B. Liu, AC-5 *: an improved AC-5 and its specializations, 1996. DISCS Technical Report. 1996.Google Scholar
  5. [5]
    B. Liu, “Increasing functional constraints need to be checked only once,” IJCAI-95, Montreal, Canada, August 19–25, 1995.Google Scholar
  6. [6]
    A. K. Mackworth, “Consistency in networks of relations,” Artificial Intelligence, 8:99–118, 1977.Google Scholar
  7. [7]
    A. K. Mackworth, and E. C. Freuder, “The complexity of some polynomial network consistency algorithms for constraint satisfaction problems,” Artificial Intelligence, 25:65–74, 1985.Google Scholar
  8. [8]
    R. Mohr and T.C. Henderson, “Arc and path consistency revisited,” Artificial Intelligence, 28:225–233, 1986.Google Scholar
  9. [9]
    P. van Hentenryck, Constraint satisfaction in logic programming, 1989.Google Scholar
  10. [10]
    P. van Hentenryck, Y. Deville and C-M. Teng, “A generic arc-consistency algorithm and its specifications,” Artificial Intelligence, 27:291–322, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Bing Liu
    • 1
  1. 1.Department of Information Systems and Computer ScienceNational University of SingaporeSingapore

Personalised recommendations