Advertisement

Criteria of Satisfiability for Homogeneous Systems of Linear Diophantine Constraints

  • Sergey Krivoi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2328)

Abstract

This paper describes an incremental algorithm for computing a minimal supported set of solutions for homogeneous systems of linear Diophantine equations (HSLDE) over the set of natural numbers N, which can also be applied to the homogeneous systems of linear Diophantine inequations (HSLDI) and mixed systems.

Keywords

Homogeneous System Mixed System Minimal Solution Automate Reasoning Incremental Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Contenjean E., Devie H.: Solving systems of linear diophantine equations. In Proc. 3rd Workshop on Unification. Lambrecht (Germany, University of Kaiserslautern) June (1989)Google Scholar
  2. 2.
    Pottier L.: Minimal solutions of linear diophantine systems: bounds and algorithms. In Proc. of the Fourth Intern. Conf. on Rewriting Techniques and Applications. Como (Italy) (1991) 162–173Google Scholar
  3. 3.
    Domenjoud E.: Outils pour la deduction automatique dans les theories associatives-commutatives. Thesis de Doctorat d’Universite: Universite de Nancy I. (1991)Google Scholar
  4. 4.
    Clausen M., Fortenbacher A.: Efficient solution of linear diophantine equations. Journ. Symbolic Computation. Vol. 8. N 1,2 (1989) 201–216MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Romeuf J. F.: A polinomial Algorithm for Solving systems of two linear Diophantine equations. TCS Vol. 74. N3 (1990) 329–340MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Filgueiras M., Tomas A.P.: A Fast Method for Finding the Basis of Non-negative Solutions to a Linear Diophantine Equation. Journ. Symbolic Computation Vol. 19,2 (1995) 507–526MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Allen R., Kennedy K.: Automatic translation of FORTRAN program to vector form. ACM Transactions on Programming Languages and systems, Vol. 9, N4 (1987) 491–542zbMATHCrossRefGoogle Scholar
  8. 8.
    Krivoi S.L.: On some methods of solving and criteria of satisfiability for systems of linear Diophantine equations over set of natural numbers. Cybermetics and System Analysis. N 4 (1999) 12–36Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Sergey Krivoi
    • 1
  1. 1.Institute of Mathematics and Computer ScienceTechnical University of CzęstochowaCzęstochowaPoland

Personalised recommendations