论文标题
在静音网络有效表示中，最大的约束
At-Most-One Constraints in Efficient Representations of Mutex Networks
论文作者
论文摘要
最重要的（AMO）约束是基数约束的特殊情况，最多需要一个从一组布尔变量设置为true的变量。 AMO对于将问题作为布尔可满足性（SAT）的建模很重要，在决策变量代表某些无法共享相同空间或时间插槽的某些对象的空间或时间放置的域中，AMO很重要。 AMO约束可以用于更有效的表示和解决问题的静音网络中的问题解决，这些网络由配对的相互排除组成，禁止布尔变量对以同时为true。提出了一种在线检测集团自动检测的方法，以有效表示使用AMOS到达新的静音网络的增量静音网络。显示了使用各种编码的AMO约束代表的MUTEX网络中基于SAT的问题解决的比较。
The At-Most-One (AMO) constraint is a special case of cardinality constraint that requires at most one variable from a set of Boolean variables to be set to TRUE. AMO is important for modeling problems as Boolean satisfiability (SAT) from domains where decision variables represent spatial or temporal placements of some objects that cannot share the same spatial or temporal slot. The AMO constraint can be used for more efficient representation and problem solving in mutex networks consisting of pair-wise mutual exclusions forbidding pairs of Boolean variable to be simultaneously TRUE. An on-line method for automated detection of cliques for efficient representation of incremental mutex networks where new mutexes arrive using AMOs is presented. A comparison of SAT-based problem solving in mutex networks represented by AMO constraints using various encodings is shown.
