Skip to main content
SpringerLink
Log in

On the arc consistency problem

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

In this paper, we propose a new arc consistency algorithm, AC-8, which requires less computation time and space than AC-6 and AC-7. The main idea of the optimization is the divide-and-conquer strategy, thereby decomposing an arc consistency problem into a series of smaller ones and trying to solve them in sequence. In this way, not only the space complexity but also the time complexity can be reduced. The reason for this is that due to the ahead of time performed inconsistency propagation (in the sense that some of them are executed before the entire inconsistency checking has been finished), each constraint subnetwork will be searched with a gradually shrunk domain. In addition, the technique of AC-6 can be integrated into our algorithm, leading to a further decrease in computational complexity.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Haralick R M, Davis L S, Rosenfeld A. Reduction operations for constraint satisfaction.Information Sci., 1978, 14: 199–219.

    Article  MATH  MathSciNet  Google Scholar 

  2. Haralick R M, Shapiro L G. The consistent labeling problem: Part 1.IEEE Trans. Pattern Anal. Machine Intelligence, 1979, 1(2): 173–184.

    MATH  Google Scholar 

  3. Haralick R M, Elliott G L. Increasing tree search efficiency for constraint satisfaction problems.Artificial Intelligence, 1989, 14: 263–313.

    Article  Google Scholar 

  4. Haralick R M, Shapiro L G. The consistent labeling problem: Part II.IEEE Trans. Pattern Anal. Machine Intelligence, 1980, 2(3): 193–203.

    Article  MATH  Google Scholar 

  5. Gaschnig J. Performance measurement and analysis of certain search algorithms. Ph.D. Thesis, Dept. Computer Science, Carnegie-Mellon University, 1979.

  6. Fikes R E. REF-ARF: A system for solving problems stated as procedures.Artificial Intelligence, 1970, 1: 27–120.

    Article  MATH  Google Scholar 

  7. Nudel B A. Consistent-labeling problems and their algorithms: Expected-complexities and theory-based heuristics,Artificial Intelligence, 1983, 21: 135–178.

    Article  Google Scholar 

  8. Mackworth A K. Consistency in networks of relations.Artificial Intelligence, 1977, 8: 99–118.

    Article  MATH  Google Scholar 

  9. Van Hentenryck P. Constraint Satisfaction in Logic Programming. Logic Programming Series (MIT Press, Cambrige, MA, 1989).

    Google Scholar 

  10. Mackworth A K. Interpreting pictures of polyhedral scenes.Artificial Intelligence, 1973, 4: 121–137.

    Article  Google Scholar 

  11. Montanari U. Optimization methods in image processing. InProc. IFIP Congress, North-Holland, 1974, pp.727–732.

  12. Rosenfeld A, Hummel A, Zucker S W. Scene labelling by relaxation operations. Computer Science TR-379, University of Maryland, 1975.

  13. Bessiere C. Arc-consistency and arc-consistency again.Artificial Intelligence, 1994, 65: 179–190.

    Article  Google Scholar 

  14. Van Hentenryck P, Deville Y, Teng C-M. A generic arc-consistency algorithm and its specialization.Artificial Intelligence, 1992, 57: 291–321.

    Article  MATH  MathSciNet  Google Scholar 

  15. Waltz D L. Generating semantic descriptions from drawings of scenes with shadows, MAC AI-TR-271, MIT, 1972.

  16. Freunder E C. Synthesizing constraint expressions.Comm. ACM, 1978, 29: 24–32.

    Google Scholar 

  17. Han C-C, Lee C-H. Comments on Mohr and Henderson's path consistency algorithm.Artificial Intelligence, 1988, 36: 125–130.

    Article  MATH  Google Scholar 

  18. Mohr R, henderson T C. Arc and path consistency revisited.Artificial Intelligence, 1986, 28: 225–233.

    Article  Google Scholar 

  19. Montanari U. Networks of constraints: Fundamental properties and applications to pictureprocessing.Inform. Sci., 1974, 7: 95–132.

    Article  MathSciNet  Google Scholar 

  20. Bessiere C, Freuder E C, Regin J-C. Using inference to reduce arc consistency computation. InProc. 14th Int. Conf. Artificial Intelligence, Montreal, Canada, August 1995, pp.592–598.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Technical University of Chemnitz-Zwickau, 09107, Chemnitz, Germany

    Chen Yangjun

Authors
  1. Chen Yangjun
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

CHEN Yangjun received his BS degree in information system engineering from the Technical Institute of Changsha, China, in 1982, and his Diploma and PhD degrees in computer science from the University of Kaiserslautern, Germany, in 1990 and 1995, respectively. From 1995 to 1997, he worked as an assistant professor at the Technical University of Chemnitz-Zwickau, Germany. Dr. Chen is currently a senior engineer at German National Research Center of Information Technology. His research interests include deductive databases, federative databases, multimedia databases, constraint satisfaction problem, graph theory and combinatorics. He has more than 50 publications in these areas.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, Y. On the arc consistency problem. J. Comput. Sci. & Technol. 14, 298–308 (1999). https://doi.org/10.1007/BF02948731

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02948731

Keywords

Search

Navigation