Criteria of Satisfiability for Homogeneous Systems of Linear Diophantine Constraints
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.
KeywordsHomogeneous System Mixed System Minimal Solution Automate Reasoning Incremental Algorithm
Unable to display preview. Download preview PDF.
- 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.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.Domenjoud E.: Outils pour la deduction automatique dans les theories associatives-commutatives. Thesis de Doctorat d’Universite: Universite de Nancy I. (1991)Google Scholar
- 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