{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:43:51Z","timestamp":1767339831978},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602996"},{"type":"electronic","value":"9783540447887"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60299-2_1","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:13:58Z","timestamp":1330280038000},"page":"1-17","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Complete solving of linear Diophantine equations and inequations without adding variables"],"prefix":"10.1007","author":[{"given":"Farid","family":"Ajili","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evelyne","family":"Contejean","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"F. Ajili and B. Contejean. Complete solving of linear and diophantine equational and inequational systems without adding variables. Technical Report 0175, INRIA, June 1995.","DOI":"10.1007\/3-540-60299-2_1"},{"key":"1_CR2","unstructured":"F. Ajili, E. Contejean, E. Domenjoud, M. Filgueiras, C. Kirchner, and A.-P. Tom\u00e1s. Solving Linear Diophantine Equations: The State of the Art. in preparation, 1995."},{"key":"1_CR3","volume-title":"Rapport de dea","author":"F. Ajili","year":"1994","unstructured":"Farid Ajili. Etude de la r\u00e9solution de contraintes diophantiennes lin\u00e9aires sur les entiers naturels. Rapport de dea, Universit\u00e9 Henri Poincar\u00e9 \u2014 Nancy 1, September 1994."},{"key":"1_CR4","first-page":"289","volume-title":"A new AC-unification algorithm with a new algorithm for solving diophantine equations","author":"A. Boudet","year":"1990","unstructured":"Alexandre Boudet, Evelyne Contejean, and Herv\u00e9 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\u2013299. IEEE Computer Society Press, June 1990."},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1137\/0211057","volume":"11","author":"T. J. Chou","year":"1982","unstructured":"T. J. Chou and G. E. Collins. Algorithms for the solution of systems of linear diophantine equations. SIAM Journal on computing, 11:687\u2013708, 1982.","journal-title":"SIAM Journal on computing"},{"issue":"1&2","key":"1_CR6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0747-7171(89)80025-2","volume":"8","author":"M. Clausen","year":"1989","unstructured":"M. Clausen and A. Fortenbacher. Efficient solution of linear diophantine equations. Journal of Symbolic Computation, 8(1&2):201\u2013216, 1989.","journal-title":"Journal of Symbolic Computation"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"A. H. Clifford and G. B. Preston. The algebraic theory of semigroups. Number 7 in Mathematical surveys. American Mathematical Society, 1961. There's two volumes. The second was published in 1967.","DOI":"10.1090\/surv\/007.2\/02"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1006\/jsco.1993.1060","volume":"16","author":"E. Contejean","year":"1993","unstructured":"Evelyne Contejean. Solving *-problems modulo distributivity by a reduction to AC1-unification. Journal of Symbolic Computation, 16:493\u2013521, 1993.","journal-title":"Journal of Symbolic Computation"},{"issue":"1","key":"1_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1006\/inco.1994.1067","volume":"113","author":"E. Contejean","year":"1994","unstructured":"Evelyne Contejean and Herv\u00e9 Devie. An efficient algorithm for solving systems of diophantine equations. Information and Computation, 113(1):143\u2013172, August 1994.","journal-title":"Information and Computation"},{"key":"1_CR10","unstructured":"Eric Domenjoud. Outils pour la d\u00e9duction automatique dans les th\u00e9ories associatives-commutatives. Th\u00e8se de doctorat de l'universit\u00e9 de Nancy I, 1991."},{"key":"1_CR11","volume-title":"LNCS 520","author":"E. Domenjoud","year":"1991","unstructured":"Eric Domenjoud. Solving systems of linear diophantine equations: An algebraic approach. In Proc. 16th Mathematical Foundations of Computer Science, Warsaw, LNCS 520. Springer-Verlag, 1991."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"M. Filgueiras and A. P. Tom\u00e1s. Fast methods for solving linear diophantine equations. In M. Filgueiras and Damas L., editors, Proceedings of the 6th Portuguese Conference on Artificial Intelligence, 727, pages 297\u2013306. Lecture Notes in Artificial Intelligence, Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57287-2_55"},{"key":"1_CR13","unstructured":"T. Guckenbiehl and A. Herold. Solving linear diophantine equations. Technical Report SEKI-85-IV-KL, 1985."},{"issue":"3","key":"1_CR14","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF00243791","volume":"3","author":"A. Herold","year":"1987","unstructured":"Alexander Herold and Jorg H. Siekmann. Unification in abelian semi-groups. Journal of Automated Reasoning, 3(3):247\u2013283, 1987.","journal-title":"Journal of Automated Reasoning"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"G\u00e9rard Huet. An algorithm to generate the basis of solutions to homogeneous linear diophantine equations. Information Processing Letters, 7(3), April 1978.","DOI":"10.1016\/0020-0190(78)90078-9"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"E. Joxan, M. J. Maher, P. J. Stuckey, and R. H. C. Yap. Beyond finite domains. In A. Borning, editor, Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming, volume 874 of Lecture Notes in Computer Science, pages 86\u201394. Springer-Verlag, may 1994.","DOI":"10.1007\/3-540-58601-6_92"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"N. Karmarkar. A new polynomial algorithm for linear programming. In Proceedings of the 16th Annual ACM Symposium on Theory of Computing, pages 302\u2013311, New York, 1984. Revised version: Combinatorica 4 (1984),373\u2013395.","DOI":"10.1007\/BF02579150"},{"key":"1_CR18","unstructured":"L. G. Khachiyan. Polynomial algorithms in linear programming. Zhurnal Vychisditel'noi Matematiki i Matematicheskoi Fiziki, pages 51\u201368, 1980."},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Claude Kirchner. From unification in combination of equational theories to a new AC unification algorithm. In H. Ait-Kaci and M. Nivat, editors, Proc. Colloquium on Resolution of Equations in Algebraic Structures, pages 171\u2013210. Academic Press, 1987.","DOI":"10.1016\/B978-0-12-046371-8.50012-2"},{"key":"1_CR20","first-page":"39","volume":"305","author":"J. L. Lambert","year":"1987","unstructured":"J. L. Lambert. Une borne pour les g\u00e9n\u00e9rateurs des solutions enti\u00e8res positives d'une \u00e9quation diophantienne lin\u00e9aire. Comptes Rendus de l'Acad\u00e9mie des Sciences de Paris, 305:39,40, 1987. S\u00e9rie I.","journal-title":"Comptes Rendus de l'Acad\u00e9mie des Sciences de Paris"},{"key":"1_CR21","first-page":"243","volume":"243","author":"G. S. Makanin","year":"1978","unstructured":"G. S. Makanin. Algorithmic decidability of the rank of constant free equations in a free semigroup. Dokl. Akad. Nauk. SSSR 243, 243, 1978.","journal-title":"Dokl. Akad. Nauk. SSSR"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"L. Pottier. Minimal solutions of linear diophantine systems: bounds and algorithms. In Proceedings of the Fourth International Conference on Rewriting Techniques and Applications, pages 162\u2013173, Como, Italy, April 1991.","DOI":"10.1007\/3-540-53904-2_94"},{"key":"1_CR23","volume-title":"Technical report","author":"J. F. Romeuf","year":"1989","unstructured":"J. F. Romeuf. A polynomial algorithm for solving systems of two linear diophantine equations. Technical report, Laboratoire d'Informatique de Rouen et LITP, France, 1989."},{"key":"1_CR24","unstructured":"A. Schrijver. Theory of Linear and Integer Programming. Wiley, 1986."},{"key":"1_CR25","unstructured":"J. C. Sogno. Analysis of standard and new algorithms for the integer and linear constraint satisfaction problem. Technical report, INRIA, 1992."},{"issue":"3","key":"1_CR26","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1145\/322261.322262","volume":"28","author":"M. Stickel","year":"1981","unstructured":"M. Stickel. A unification algorithm for associative-commutative functions. Journal of the ACM, 28(3):423\u2013434, 1981.","journal-title":"Journal of the ACM"},{"key":"1_CR27","unstructured":"P Van Hentenryck, Constraint Satisfaction in Logic Programming. MIT Press, 1989."},{"issue":"1\u20133","key":"1_CR28","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0004-3702(92)90006-J","volume":"58","author":"P. Hentenryck Van","year":"1992","unstructured":"P. Van Hentenryck, H. Simonis, and M. Dincbas. Constraint satisfaction using constraint logic programming. Artificial Intelligence, 58(1\u20133):113\u2013159, December 1992.","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP '95"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60299-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T18:58:40Z","timestamp":1687287520000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60299-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602996","9783540447887"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-60299-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}