Solving systems of linear diophantine equations: An algebraic approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 520 LNCS, Issue , 1991, Pages 141-150

  Domenjoud, Eric ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC;

ALGEBRAIC APPROACHES; GEOMETRICAL INTERPRETATION; HOMOGENEOUS SYSTEM; INHOMOGENEOUS SYSTEM; LINEAR DIOPHANTINE EQUATIONS; MINIMAL SOLUTIONS; SATISFIABILITY; UPPER BOUND;

ALGEBRA;

EID: 85012911905     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-54345-7_57     Document Type: Conference Paper

References (14)

1. I. Borosh and L. B. Treybig. Bounds on positive integral solutions of linear diophantine equations. Proceedings of the American Mathematical Society, 55:299-304, 1976.
2. A. Boudet, E. Contejean, and H. Devie. A new AC unification algorithm with a new algorithm for solving diophantine equations. In Proceedings 5th IEEE Symposium on Logic in Computer Science, Philadelphia (Pennsylvania, USA), pages 289-299, 1990.
3. A. Brøndsted. An Introduction to Convex Polytopes, volume 90 of Graduate Texts in Mathematics. Springer-Verlag, 1983.
4. M. Clausen and A. Fortenbacher. Efficient solution of linear diophantine equations. Journal of Symbolic Computation, 8:201-216, 1989. Special issue on unification. Part two.
5. E. Contejean and H. Devie. Solving systems of linear diophantine equations. In H.-J. Bürckert and W. Nutt, editors, Proceedings 3rd International Workshop on Unification, Lambrecht (Germany), 1989.
6. A Fortenbacher. Algebraische unifikation. Diplomarbeit, Institut für Informatik, Universität Karlsruhe, 1983.
7. J. von zur Gathen and M. Sieveking. A bound on solutions of linear integer equalities and inequalities. Proceedings of the American Mathematical Society, 72:155-158, 1978.
8. T. Guckenbiehl and A. Herold. Solving linear diophantine equations. Technical Report SEKI-85-IV-KL, Universität Kaiserslautern, 1985.
9. G. Huet. An algorithm to generate the basis of solutions to homogenous linear diophantine equations. Information Processing Letters, 7:144-147, 1978.
10. J.-L. Lambert. Le problème de l’accessibilité dans les réseaux de Petri. PhD thesis, Université de Paris-sud, Centre d’Orsay, 1987.
11. L. Pottier. Bornes et algorithme de calcul des générateurs des solutions de systèmes diophantiens linéaires. Technical report, INRIA Sophia Antipolis, 1990.
12. L. Pottier. Minimal solutions of linear diophantine systems: Bounds and algorithms. In R.V. Book, editor, Proceedings 4th Conference on Rewriting Techniques and Applications, Como, (Italy), volume 488 of Lecture Notes in Computer Science, pages 162-173. Springer-Verlag, 1991.
13. J.-F. Romeuf. Solutions of a linear diophantine system, 1988. LIR & Université de Rouen.
14. 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.