Skip to main content
SpringerLink
Log in

Efficient Algorithms for Functional Constraints

  • Conference paper
Logic Programming (ICLP 2008)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5366))

Included in the following conference series:

Abstract

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 CSP-based solvers which use local consistency, e.g. 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 non-functional 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 show that variable elimination can significantly improve the efficiency of solving problems with functional constraints.

Part of this work was supported by National Univ. of Singapore, grant 252-000- 303-112.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Affane, M.S., Bennaceur, H.: A Labelling Arc Consistency Method for Functional Constraints. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol. 1118, pp. 16–30. Springer, Heidelberg (1996)

    Google Scholar 

  2. Bessiere, C., Regin, J.C., Yap, R.H.C., Zhang, Y.: An Optimal Coarse-grained Arc Consistency Algorithm. Artificial Intelligence 165(2), 165–185 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  3. David, P.: Using Pivot Consistency to Decompose and Solve Functional CSPs. J. of Artificial Intelligence Research 2, 447–474 (1995)

    MATH  Google Scholar 

  4. Dechter, R.: Bucket elimination: A Unifying Framework for Reasoning. Artificial Intelligence 113, 41–85 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  5. Jaffar, J., Michaylov, S., Stuckey, P.J., Yap, R.H.C.: The CLP(\(\cal R\)) Language and System. ACM Trans. on Programming Languages and Systems 14(3), 339–395 (1992)

    Article  Google Scholar 

  6. Jaffar, J., Maher, M.J.: Constraint Logic Programming. J. of Logic Programming 19/20, 503–581 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kirousis, L.M.: Fast Parallel Constraint Satisfaction. Artificial Intelligence 64, 147–160 (1993)

    Article  MATH  Google Scholar 

  8. Liu, B.: Increasing Functional Constraints Need to be Checked Only Once. In: IJCAI 1995, pp. 119–125. Morgan Kaufmann, San Francisco (1995)

    Google Scholar 

  9. Schulte, C., Tack, G.: Views and Iterators for Generic Constraint Implementations. In: Hnich, B., Carlsson, M., Fages, F., Rossi, F. (eds.) CSCLP 2005. LNCS, vol. 3978, pp. 118–132. Springer, Heidelberg (2006); In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 817–821. Springer, Heidelberg (2005)

    Google Scholar 

  10. Stallman, R.M., Sussman, G.J.: Forward Reasoning and Dependency-directed Backtracking in a System for Computer-aided Circuit Analysis. Artificial Intelligence 9(2), 135–196 (1977)

    Article  MATH  Google Scholar 

  11. Van Hentenryck, P., Deville, Y., Teng, C.M.: A Generic Arc-consistency Algorithm and its Specializations. Artificial Intelligence 58, 291–321 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  12. Zhang, Y., Yap, R.H.C., Jaffar, J.: Functional Elimination and 0/1/All Constraints. In: AAAI 1999, pp. 275–281. AAAI Press, Menlo Park (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Texas Tech University, USA

    Yuanlin Zhang, Chendong Li & Satyanarayana Marisetti

  2. National University of Singapore, Singapore

    Roland H. C. Yap

Authors
  1. Yuanlin Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roland H. C. Yap
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chendong Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Satyanarayana Marisetti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Clayton School of Information Technology, Monash University, Australia

    Maria Garcia de la Banda

  2. Department of Computer Science, New Mexico State University, NM 88003, Las Cruces, USA

    Enrico Pontelli

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, Y., Yap, R.H.C., Li, C., Marisetti, S. (2008). Efficient Algorithms for Functional Constraints. In: Garcia de la Banda, M., Pontelli, E. (eds) Logic Programming. ICLP 2008. Lecture Notes in Computer Science, vol 5366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89982-2_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89982-2_50

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89981-5

  • Online ISBN: 978-3-540-89982-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation