Jean-Claude Sogno. Analysis of standard and new algorithms for the integer and linear constraint satisfaction problem. Rapport de recherche, INRIA, 1992. to appear.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....Domaine de Voluceau Rocquencourt B.P. 105 78153 Le Chesnay Cedex France T el. 1)39 63 55 11 Rapports de Recherche N ffi 1699 Programme 2 Calcul symbolique, Programmation et G enie logiciel A GENERAL ALGORITHM FOR DATA DEPENDENCE ANALYSIS Christine EISENBEIS Jean Claude SOGNO Mai 1992 A GENERAL ALGORITHM FOR DATA DEPENDENCE ANALYSIS y UN ALGORITHME GEN ERAL POUR L ANALYSE DES D EPENDANCES DE DONN EES Christine Eisenbeis z Jean Claude Sogno x INRIA Rocquencourt Domaine de Voluceau, BP 105 78153 Le Chesnay Cedex FRANCE This work was partially ....

....2 inequalities (coefficients remain integer by reducing both sides of the inequalities to the same denominator) hence the growing complexity of the system. The uncertainty of the method lies in the fact that one interval may be non empty and yet contain no integer. However, it is easy to prove [Sog92] that: Theorem 3.1 The transformed system is equivalent to the previous one when one of the following criteria is verified: Criterion 1 The value of every negative coefficient of x 1 is 1 Criterion 2 The value of every positive coefficient of x 1 is 1 Therefore, we will apply this reduction ....

[Article contains additional citation context not shown here]

Jean-Claude Sogno. Analysis of standard and new algorithms for the integer and linear constraint satisfaction problem. Rapport de recherche, INRIA, 1992. to appear.

....equational constraints, or systems of them, has been widely investigated starting from the ancient Greeks. Such constraints arise in various areas of computer science and eOEcient algorithms are well known for solving systems of linear constraints over reals, rational numbers [20, 19] and integers [6, 27]. Unfortunately, restricting the domain to the natural numbers makes the problem much more diOEcult and the algorithms in the previous class are no longer suitable. In the recent past, several works, related to the automatic deduction framework, have shown the key role of solving systems of linear ....

J. C. Sogno. Analysis of standard and new algorithms for the integer and linear constraint satisfaction problem. Technical report, INRIA, 1992.

....equational constraints, or systems of them, has been widely investigated starting from the ancient Greeks. Such constraints arise in various areas of computer science and efficient algorithms are well known for solving systems of linear constraints over reals, rational numbers [19,18] and integers [6,26]. Unfortunately, restricting the domain to the natural numbers makes the problem much more difficult and the algorithms in the previous class are no longer suitable. 1 This work was partly supported by the European Contract SOL HCM No CHRX CT92 0053 Preprint submitted to Elsevier Preprint 4 ....

J. C. Sogno. Analysis of standard and new algorithms for the integer and linear constraint satisfaction problem. Technical report, INRIA, 1992.

....constraints, or systems of them, has been widely investigated starting from the ancient Greeks. Such constraints arise in various areas of computer science and efficient algorithms are well known for solving systems of linear constraints over reals, rational numbers [18, 17] and integers [5, 25]. Unfortunately, restricting the domain to the natural numbers makes the problem much more difficult and the algorithms in the previous class are no longer suitable. In the recent past, several works, related to the automatic deduction framework, have shown the key role of solving systems of ....

J. C. Sogno. Analysis of standard and new algorithms for the integer and linear constraint satisfaction problem. Technical report, INRIA, 1992.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC