Variable Elimination in Binary CSP via Forbidden Patterns.
HAL (Le Centre pour la Communication Scientifique Directe)(2013)
摘要
A variable elimination rule allows the polynomial-time identification of certain variables whose elimination does not affect the satisfiability of an instance. Variable elimination in the constraint satisfaction problem (CSP) can be used in preprocessing or during search to reduce search space size. We show that there are essentially just four variable elimination rules defined by forbidding generic sub-instances, known as irreducible patterns, in arc-consistent CSP instances. One of these rules is the Broken Triangle Property, whereas the other three are novel.
更多查看译文
关键词
variable elimination rule,variable elimination,certain variable,arc-consistent CSP instance,search space size,Broken Triangle Property,constraint satisfaction problem,generic sub-instances,irreducible pattern,polynomial-time identification,binary CSP
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络