Skip to main content
SpringerLink
Log in
Book cover

International Conference on Foundations of Software Technology and Theoretical Computer Science

FSTTCS 1996: Foundations of Software Technology and Theoretical Computer Science pp 168–179Cite as

Constraint retraction in FD

  • Conference paper
  • First Online:

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

Abstract

The possibility of deleting a piece of information is very convenient in many programming frameworks. However, this feature is not available in constraint languages such as Constraint Logic Programming or Concurrent Constraint Programming, which allow only for a monotonic accumulation of constraints. This is mainly due to its high complexity and also to its non-monotonic nature, which would make such a system much more complex to reason with. In this paper we consider the CLP framework over FD (finite domain) constraints, and we propose an incremental algorithm which deletes a constraint from a set of FD constraints, while maintaining partial arc-consistency. The algorithm follows the chain of dependencies among variables which are set by the nature of the FD constraints, and by doing so it updates only the part of the constraint set which is affected by the deletion. This makes constraint deletion in FD a feasible task that can be efficiently implemented.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Aggoun and N. Beldiceanu. Overview of the CHIP Compiler System. In Constraint Logic Programming: Selected Research, A. Colmerauer and F. Benhamou (Eds.). MIT Press, 1993.

    Google Scholar 

  2. B. Carlson, M. Carlsson and S. Janson. Finite Domain Constraints in AKL(FD). In Proceedings of ILPS 94, MIT Press, 1994.

    Google Scholar 

  3. C. Codognet and P. Codognet. Non-deterministic Stream AND-Parallelism based on Intelligent Backtracking. In Proceedings of 6th ICLP, Lisbon, 1989. The MIT Press.

    Google Scholar 

  4. P. Codognet and D. Diaz. Compiling Constraints in clp(FD). Journal of Logic Programming, vol. 27(3), 1996.

    Google Scholar 

  5. P. Codognet, F. Fages and T. Sola. A meta-level compiler for CLP(FD) and its combination with intelligent backtracking. In Constraint Logic Programming: Selected Research, A. Colmerauer, F. Benhamou (Eds.), MIT Press, 1993.

    Google Scholar 

  6. D. Diaz and P. Codognet. A minimal extension of the WAM for CLP(FD). In proceedings of the 10th International Conference on Logic Programming, D. S. Warren (Ed.), Budapest, Hungary, MIT Press 1993.

    Google Scholar 

  7. W. S. Havens. Intelligent Backtracking in the Echidna Constraint Logic Programming System. Research Rep. CSS-IS TR 92-12, Simon Fraser University, Vancouver, Canada, 1992.

    Google Scholar 

  8. T. Huynh and K. Marriott. Incremental Constraint Deletion in Systems of Linear Constraints. Draft Report, IBM T. J. Watson Research Center, 1992.

    Google Scholar 

  9. J. Jaffar and J.L. Lassez. Constraint Logic Programming. In Proceedings of POPL '87, ACM Press, 1987.

    Google Scholar 

  10. A.K. Mackworth. Consistency in networks of relations. Artificial Intelligence, vol.8, n.1, 1977.

    Google Scholar 

  11. B. A. Nadel. Constraint Satisfaction Algorithms. Computational Intelligence 5 (1989).

    Google Scholar 

  12. B. Neveu and P. Berlandier. Maintaining Arc Consistency through Constraint Retraction. Proc. TAI94, IEEE Press.

    Google Scholar 

  13. V.A. Saraswat. Concurrent Constraint Programming. MIT Press, 1993.

    Google Scholar 

  14. T. Sola. Deduction Maintenance in Constraint Logic Programs. Ph.D. thesis, University of Paris XI, December 1995.

    Google Scholar 

  15. P. Van Hentenryck. Constraint Satisfaction in Logic Programming, Logic Programming Series, The MIT Press, Cambridge, MA, 1989.

    Google Scholar 

  16. P. Van Hentenryck, V. Saraswat and Y. Deville. Constraint processing in cc(FD). In Constraint Programming: Basics and Trends, A. Podelski (Ed.), LNCS 910, Springer Verlag 1995. First version: Research Report, Brown University, Jan. 1992.

    Google Scholar 

  17. P. Van Hentenryck, Y. Deville and C-M. Teng. A generic arc-consistency algorithm and its specializations. Artificial Intelligence 57 (1992), pp 291–321.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA-Rocquencourt, B.P. 105, 78153, Le Chesnay Cedex, France

    Philippe Codognet & Daniel Diaz

  2. Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56100, Pisa, Italy

    Francesca Rossi

Authors
  1. Philippe Codognet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daniel Diaz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Francesca Rossi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

V. Chandru V. Vinay

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Codognet, P., Diaz, D., Rossi, F. (1996). Constraint retraction in FD. In: Chandru, V., Vinay, V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1996. Lecture Notes in Computer Science, vol 1180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62034-6_47

Download citation

  • DOI: https://doi.org/10.1007/3-540-62034-6_47

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62034-1

  • Online ISBN: 978-3-540-49631-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation