Details:
Title  Using Gröbner Basis Theory to Compute Constraint Networks in Globally Solved
Form  Author(s)  Marc R. C. van Dongen  Type  Technical Report, Misc  Abstract  In this paper a new technique is presented which allows for the transformation of any extensional constraint network to an equivalent network which is in globally solved form with respect to a certain given variable ordering. This guarantees that all solutions can be found with backtracking without encountering "deadends." The resulting network corresponds to a reduced Gröbner basis with respect to a lexicographical term order. The number of solutions of the constraint network can be computed by inspecting the reduced Gröbner basis.  Length  7 
Language  English  Year  1999  Month  August  Edition  0  Translation 
No  Refereed 
No 
