Dynamic constraint satisfaction problem solver with inferred problem association removal
作者： Gao Chen , Joyce Ng , Claire M. Bagley
DOI:
关键词:
摘要: A constraint solver for solving a satisfaction problem network that comprises plurality of nodes and constraints. The receives request to remove an inferred association determines one or more user decisions triggered the association.
lens.org 参考文章(20)
Yvan DeBoeck, Duncan McGillivray, Kris Dockx, Ettore DiLena, Configuration system and methods ,(2001)
Narendra Jussien, Olivier Lhomme, Dynamic domain splitting for numeric CSPs european conference on artificial intelligence. pp. 224- 228 ,(1998)
Brian Falkenhainer, Sanjay Mittal, Dynamic constraint satisfaction problems national conference on artificial intelligence. pp. 25- 32 ,(1990)
Eugene C. Freuder, Daniel Sabin, Configuration as Composite Constraint Satisfaction ,(1996)
T. Fruhwirth, S. Abdennadher, Principles of constrain systems and constraint solvers Archives of Control Sciences. ,vol. 16, pp. 131- 159 ,(2006)
Anish Das Sarma, Surajit Chaudhuri, Shriraghav Kaushik, Venkatesh Ganti, Leveraging constraints for deduplication ,(2007)
Olivier Lhomme, Consistency techniques for numeric CSPs international joint conference on artificial intelligence. pp. 232- 238 ,(1993)
Lisa S. Purvis, System and method for constraint-based document generation ,(2002)
David Leslie, Robert Laufenberg, Networked based paralleling switchgear equipment configuration process ,(2001)