Open AccessBound Consistency for Binary Length-Lex Set Constraints
Author(s) -
Pascal Van Hentenryck,
Justin Yip,
Carmen Gervet,
Grégoire Dooms
Publication year - 2008
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - Uncategorized
Resource type - Conference proceedings
Subject(s) - cardinality (data modeling) , unary operation , local consistency , upper and lower bounds , consistency (knowledge bases) , constraint satisfaction problem , constraint (computer aided design) , eventual consistency , set (abstract data type) , constraint satisfaction , representation (politics) , binary number , mathematics , binary constraint , computer science , strong consistency , combinatorics , discrete mathematics , algorithm , consistency model , data mining , programming language , statistics , mathematical analysis , arithmetic , estimator , correctness , law , geometry , political science , politics , probabilistic logic