Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal

Details:

   
TitleUsing Gröbner Basis Theory to Compute Constraint Networks in Globally Solved Form
Author(s) Marc R. C. van Dongen
TypeTechnical Report, Misc
AbstractIn 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 "dead-ends." 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.
Length7
LanguageEnglish
Year1999
MonthAugust
Edition0
Translation No
Refereed No
Webmaster