Skip to main content
SpringerLink
Log in

Integrating constraint propagation in complete solving of linear diophantine systems

  • Conference paper
  • First Online:
Principles of Declarative Programming (ALP 1998, PLILP 1998)

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

  • 103 Accesses

Abstract

Several complete methods for solving linear Diophantine constraints have been proposed. They can handle infinite domains, but their pruning during search is relatively weak. In contrast to those, consistency techniques based constraint propagation provides stronger pruning and have been applied successfully to many combinatorial problems, but are limited to finite domains. This paper studies the combination of (1) a complete solver which is based on a geometric interpretation and (2) propagation techniques. We study the pruning potential created through such a combination, both conceptually and experimentally. In addition, it turns out that dynamic variables orderings can be easily embedded in the method. Our result is an extended solver, which is implemented in Java, based on which we present some interesting features and a few experimental results.

This work was done while the first author was in LORIA/INRIA-Lorraine. Nancy, France.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Ajili and E. Contejean. Complete solving of linear diophantine equations and inequations without adding variables. In Montanari and Rossi [14], pages 1–17.

    Google Scholar 

  2. F. Ajili and E. Contejean. Avoiding slack variables in the solving of linear diophantine equations and inequations. Theoretical Computer Science, 173(1):183–208, February 1997.

    Article  MATH  MathSciNet  Google Scholar 

  3. Farid Ajili. Contraintes Diophantiennes Linéaires: résolution et coopération interrésolveurs. PhD thesis, Université Henri Poincaré-Nancy I, May 1998.

    Google Scholar 

  4. F. Bacchus and P. Van Run. Dynamic variable ordering in CSPs. In Montanari and Rossi [14], pages 258–275.

    Google Scholar 

  5. A. Boudet and H. Comon. Diophantine equations, Presburger arithmetic and finite automata. In H. Kirchner, editor, Proc. Coll. on Trees in Algebra and Programming (CAAP'96), Lecture Notes in Computer Science, 1996.

    Google Scholar 

  6. M. Clausen and A. Fortenbacher. Efficient solution of linear diophantine equations. Journal of Symbolic Computation, 8(1 & 2):201–216, 1989. Special issue on unification. Part two.

    Article  MATH  MathSciNet  Google Scholar 

  7. E. Contejean. Solving linear diophantine constraints incrementally. In D. S. Warren, editor, Proceedings of the Tenth International Conference on Logic Programming, pages 532–549, Budapest, Hungary, 1993. The MIT Press.

    Google Scholar 

  8. E. Contejean and H. Devie. An efficient algorithm for solving systems of diophantine equations. Information and Computation, 113(1):143–172, August 1994.

    Article  MATH  MathSciNet  Google Scholar 

  9. D. Diaz and P. Codognet. A minimal extension of the WAM for clp(FD). In D. S. Warren, editor, Proceedings of the Tenth International Conference on Logic Programming, pages 774–790, Budapest, Hungary, 1993. The MIT Press.

    Google Scholar 

  10. E. Domenjoud. Solving systems of linear diophantine equations: An algebraic approach. In A. Tarlecki, editor, Proc. 16th Inter. Symp. on Mathem. Foundations of Computer Science, Kazimierz Dolny (Poland), volume 520 of Lecture Notes in Computer Science, pages 141–150. Springer-Verlag, 1991.

    Google Scholar 

  11. E. Domenjoud and A. P. Tomás. From Elliott-MacMahon to an algorithm for general linear constraints on naturals. In Montanari and Rossi [14], pages 18–35.

    Google Scholar 

  12. P. Van Hentenryck. Constraint Satisfaction in Logic Programming. The MIT press, 1989.

    Google Scholar 

  13. J. Jaffar and M. J. Maher. Constraint logic programming: A survey. Journal of Logic Programming, 19 & 20:503–582, May 1994.

    Article  MathSciNet  Google Scholar 

  14. U. Montanari and F. Rossi, editors. Proceedings 1st International Conference on Principles and Practice of Constraint Programming, Cassis (France), volume 976 of Lecture Notes in Computer Science. Springer Verlag, September 1995.

    Google Scholar 

  15. J.-F. Romeuf. A polynomial algorithm for solving systems of two linear diophantine equations. Technical report, Laboratoire d'Informatique de Rouen (France) and LITP, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IC-Parc, William Penny Laboratory, Imperial College, SW7 2AZ, London, UK

    Farid Ajili

  2. Logistics Development and Planning, SAP AG, POB 14 61, D-69190, Walldorf, Germany

    Hendrik C. R. Lock

Authors
  1. Farid Ajili
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hendrik C. R. Lock
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Catuscia Palamidessi Hugh Glaser Karl Meinke

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ajili, F., Lock, H.C.R. (1998). Integrating constraint propagation in complete solving of linear diophantine systems. In: Palamidessi, C., Glaser, H., Meinke, K. (eds) Principles of Declarative Programming. ALP PLILP 1998 1998. Lecture Notes in Computer Science, vol 1490. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056633

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65012-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation