Skip to main content
SpringerLink
Log in

Non-viability Deductions in Arc-Consistency Computation

  • Conference paper
Book cover Logic Programming (ICLP 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3132))

Included in the following conference series:

  • 387 Accesses

Abstract

Arc-Consistency (AC) techniques have been used extensively in the study of Constraint Satisfaction Problems (CSP). These techniques are used to simplify the CSP before or during the search for its solutions. Some of the most efficient algorithms for AC computation are AC6++ and AC-7. The novelty of these algorithms is that they satisfy the so-called four desirable properties for AC computation. The main purpose of these interesting properties is to reduce as far as possible the number of constraint checks during AC computation while keeping a reasonable space complexity. In this paper we prove that, despite providing a remarkable reduction in the number of constraint checks, the four desirable properties do not guarantee a minimal number of constraint checks. We therefore refute the minimality claim in the paper introducing these properties. Furthermore, we propose a new desirable property for AC computation and extend AC6++ and AC-7 to consider such a property. We show theoretically and experimentally that the new property provides a further substantial reduction in the number of constraint checks.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agon, C., Assayag, G., Delerue, O., Rueda, C.: Objects, time and constraints in openmusic. In: ICMC 1998. ICMA, pp. 1–12 (1998)

    Google Scholar 

  2. Bella, G., Bistarelli, S.: Soft constraints for security protocol analysis: Confidentiality. In: Ramakrishnan, I.V. (ed.) PADL 2001. LNCS, vol. 1990, pp. 108–122. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  3. Bessiére, C.: Arc-consistency and arc-consistency again. Artificial Intelligence 65(1), 179–190 (1994)

    Article  Google Scholar 

  4. Bessière, C., Freuder, E.C., Régin, J.C.: Using inference to reduce arc consistency computation. In: ICAI 1995, pp. 592–599 (1995)

    Google Scholar 

  5. Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-Based Scheduling. Applying Constraint programming to Scheduling Problems. Kluwer, Dordrecht (2001)

    MATH  Google Scholar 

  6. Bessière, C., Régin, J.C.: Using Bidirectionality to Speed Up Arc-Consistency Processing. In: Meyer, M. (ed.) Constraint Processing. LNCS, vol. 923, pp. 157–169. Springer, Heidelberg (1995)

    Google Scholar 

  7. Bessiére, C., Freuder, E.C., Régin, J.C.: Using constraint metaknowledge to reduce arc consistency computation. Artificial Intelligence 107(1), 125–148 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  8. Esparza, J., Melzer, S.: Model checking LTL using constraint programming. In: Azéma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol. 1248, Springer, Heidelberg (1997)

    Google Scholar 

  9. Garey, R., Johnson, D.S.: Computers and Intractability. In: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, New York (1979)

    Google Scholar 

  10. Gaspin, C., Westhof, E.: The determination of secondary structures of RNA as a constraint satisfaction problem. In: Advances in molecular bioinformatics, IOS Press, Amsterdam (1994)

    Google Scholar 

  11. Mackworth, A.K.: Consistency in Networks of Relations. Artificial Intelligence 8, 99–118 (1977)

    Article  MATH  Google Scholar 

  12. Mohr, R., Henderson, T.C.: Arc and path consistency revisited. Artificial Intelligence 28(2), 225–233 (1986)

    Article  Google Scholar 

  13. Van Hentenryck, P.: Constraint Satisfaction in Logic Programming. MIT Press, Cambridge (1989)

    Google Scholar 

  14. van Dongen, M.R.C.: AC-3d an efficient arc-consistency algorithm with a low space-complexity. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 755–760. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Universidad Javeriana Cali, Cali, Colombia

    Camilo Rueda

  2. Dept. of Information Technology, Uppsala University, Uppsala, Sweden

    Frank D. Valencia

Authors
  1. Camilo Rueda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frank D. Valencia
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Katholieke Universiteit Leuven, Belgium

    Bart Demoen

  2. Department of Computer Sciences, University of Texas at Austin, USA

    Vladimir Lifschitz

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rueda, C., Valencia, F.D. (2004). Non-viability Deductions in Arc-Consistency Computation. In: Demoen, B., Lifschitz, V. (eds) Logic Programming. ICLP 2004. Lecture Notes in Computer Science, vol 3132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27775-0_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27775-0_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22671-0

  • Online ISBN: 978-3-540-27775-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation