HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Complete Solving of Linear Diophantine Equational and Inequational Systems without Adding Variables

Farid Ajili 1 Evelyne Contejean
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this report, we present an algorithm for solving {\em directly} linear Diophantine systems of both equations and inequations. Here directly means without adding slack variables for encoding inequalities as equalities. This algorithm is an extension of the algorithm due to Contejean and Devie \cite{contejean94ic} for solving linear Diophantine systems of equa­tions, which is itself a generalization of the algorithm of Fortenbacher \cite{clausen89} for solving a single linear Diophantine equation. All the nice properties of the algorithm of Contejean and Devie are still satisfied by the new algorithm: it is complete, {\em i.e.} provides a (finite) description of the set of solutions, it can be implemented with a {\em bounded} stack, and it admits an incremental version. All of these characteristics enable its easy integration in the CLP paradigm.
Document type :
Complete list of metadata

Cited literature [2 references]  Display  Hide  Download

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Friday, May 19, 2006 - 6:46:46 PM
Last modification on : Friday, February 4, 2022 - 3:15:18 AM
Long-term archiving on: : Sunday, April 4, 2010 - 8:11:26 PM


  • HAL Id : inria-00069996, version 1


Farid Ajili, Evelyne Contejean. Complete Solving of Linear Diophantine Equational and Inequational Systems without Adding Variables. [Technical Report] RT-0175, INRIA. 1995, pp.23. ⟨inria-00069996⟩



Record views


Files downloads