Complete solving of linear Diophantine equations and inequations without adding variables-Reference-Cited by-同舟云学术

Complete solving of linear Diophantine equations and inequations without adding variables

Published:1995 Issue: Volume: Page:1-17
ISSN:0302-9743
Container-title:Principles and Practice of Constraint Programming — CP '95
language:
Short-container-title:

Author:

Ajili Farid,Contejean Evelyne

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-60299-2_1

Reference28 articles.

1. F. Ajili and B. Contejean. Complete solving of linear and diophantine equational and inequational systems without adding variables. Technical Report 0175, INRIA, June 1995.

2. F. Ajili, E. Contejean, E. Domenjoud, M. Filgueiras, C. Kirchner, and A.-P. Tomás. Solving Linear Diophantine Equations: The State of the Art. in preparation, 1995.

3. Farid Ajili. Etude de la résolution de contraintes diophantiennes linéaires sur les entiers naturels. Rapport de dea, Université Henri Poincaré — Nancy 1, September 1994.

4. Alexandre Boudet, Evelyne Contejean, and Hervé Devie. A new AC-unification algorithm with a new algorithm for solving diophantine equations. In Proc. 5th IEEE Symp. Logic in Computer Science, Philadelphia, pages 289–299. IEEE Computer Society Press, June 1990.

5. T. J. Chou and G. E. Collins. Algorithms for the solution of systems of linear diophantine equations. SIAM Journal on computing, 11:687–708, 1982.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Pattern Unification with Sequence Variables and Flexible Arity Symbols;Electronic Notes in Theoretical Computer Science;2002-12

2. LP Deadlock Checking Using Partial Order Dependencies;CONCUR 2000 — Concurrency Theory;2000

3. Complete solving of linear Diophantine equations and inequations without adding variables;Principles and Practice of Constraint Programming — CP '95;1995