Inasmuch as Horn constraints subsume difference constraints, and all known algorithms for the problem of checking feasibility in Difference Constraint Systems run in time Ω(mĚn), the running time of our algorithm is only a factor n worse than the best known running time for checking feasibility in Difference Constraint Systems. Horn programs arise in a number of application areas including econometrics and program verification; consequently, their study is well-motivated. An important feature of our algorithm is that it uses only one operator, viz., addition.
We also show that our algorithm can identify the linear and lattice point
feasibility of Extended Horn Systems in O(mĚn▓) time.
of Programming Seminars