1,816 research outputs found
Efficient structural symmetry breaking for constraint satisfaction problems
Symmetry breaking for constraint satisfaction
problems (CSPs) has attracted considerable attention
in recent years. Various general schemes have been proposed to eliminate symmetries. In general, these schemes may take exponential space or time to eliminate all the symmetries. We identify several classes of CSPs that encompass many practical problems and for which symmetry breaking for various forms of value and variable interchangeability is tractable using dedicated search procedures or symmetry-breaking constraints that allow nogoods and their symmetrically equivalent solutions to be stored and checked efficiently
Symmetry Breaking for Answer Set Programming
In the context of answer set programming, this work investigates symmetry
detection and symmetry breaking to eliminate symmetric parts of the search
space and, thereby, simplify the solution process. We contribute a reduction of
symmetry detection to a graph automorphism problem which allows to extract
symmetries of a logic program from the symmetries of the constructed coloured
graph. We also propose an encoding of symmetry-breaking constraints in terms of
permutation cycles and use only generators in this process which implicitly
represent symmetries and always with exponential compression. These ideas are
formulated as preprocessing and implemented in a completely automated flow that
first detects symmetries from a given answer set program, adds
symmetry-breaking constraints, and can be applied to any existing answer set
solver. We demonstrate computational impact on benchmarks versus direct
application of the solver.
Furthermore, we explore symmetry breaking for answer set programming in two
domains: first, constraint answer set programming as a novel approach to
represent and solve constraint satisfaction problems, and second, distributed
nonmonotonic multi-context systems. In particular, we formulate a
translation-based approach to constraint answer set solving which allows for
the application of our symmetry detection and symmetry breaking methods. To
compare their performance with a-priori symmetry breaking techniques, we also
contribute a decomposition of the global value precedence constraint that
enforces domain consistency on the original constraint via the unit-propagation
of an answer set solver. We evaluate both options in an empirical analysis. In
the context of distributed nonmonotonic multi-context system, we develop an
algorithm for distributed symmetry detection and also carry over
symmetry-breaking constraints for distributed answer set programming.Comment: Diploma thesis. Vienna University of Technology, August 201
Increasing symmetry breaking by preserving target symmetries and eliminating eliminated symmetries in constraint satisfaction.
在約束滿足問題中,破壞指數量級數量的所有對稱通常過於昂貴。在實踐中,我們通常只有效地破壞對稱的一個子集。我們稱之為目標對稱。在靜態對稱破壞中,我們的目標是發佈一套約束去破壞這些目標對稱,以達到減少解集以及搜索空間的效果。一個問題中的所有對稱之間是互相交織的。一個旨在特定對稱的破壞對稱約束几乎總會產生副作用,而不僅僅破壞了預期的對稱。破壞相同目標對稱的不同約束可以有不同的副作用。傳統智慧告訴我們應該選擇一個破壞更多對稱從而有更多副作用的破壞對稱約束。雖然這樣的說法在許多方面上都是有效的,我們應該更加注意副作用發生的地方。給與一個約束滿足問題,一個對稱被一個約束保留當且僅當該對稱仍然是新的約束滿足問題的對稱。這個新的約束滿足問題是有原問題加上該約束組成的。我們給出定律和例子,以表明發佈儘量保留目標對稱以及限制它的副作用發生在非目標對稱上的破壞約束是有利的。這些好處來自于被破壞的對稱數目以及一個對稱被破壞(或消除)的程度,并導致一個較小的解集和搜索空間。但是,對稱不一定會被保留。我們顯示,旨在一個已經被消除的目標對稱的破壞對稱約束仍然可以被發佈。我們建議根據問題的約束以及其他破壞對稱約束來選擇破壞對稱約束,以繼續消除更多的對稱。我們進行了廣泛的實驗來確認我們的建議的可行性與效率。Breaking the exponential number of all symmetries of a constraint satisfaction problem is often too costly. In practice, we often aim at breaking a subset of the symmetries efficiently, which we call target symmetries. In static sym-metry breaking, the goal is to post a set of constraints to break these target symmetries in order to reduce the solution set and thus also the search space. Symmetries of a problem are all intertwined. A symmetry breaking constraint intended for a particular symmetry almost always breaks more than just the intended symmetry as a side-effect. Different constraints for breaking the same target symmetry can have different side-effects. Conventional wisdom suggests that we should select a symmetry breaking constraint that has more side-effects by breaking more symmetries. While this wisdom is valid in many ways, we should be careful where the side-effects take place.A symmetry σ of a CSP P =(V, D, C) is preserved by a set of symmetry breaking constraints C{U+02E2}{U+1D47} i σ is a symmetry of P¹ =(V, D, CU C{U+02E2}{U+1D47}). We give theorems and examples to demonstrate that it is beneficial to post symmetry breaking constraints that preserve the target symmetries and restrict the side-effects to only non-target symmetries as much as possible. The benefits are in terms of the number of symmetries broken and the extent to which a symmetry is broken (or eliminated), resulting in a smaller solution set and search space. However, symmetry preservation may not always hold. We illustrate that symmetry breaking constraints, which aim at a target symmetry that is already eliminated, can still be posted. To continue eliminating more symmetries, we suggest to select symmetry breaking constraints based on problem constraints and other symmetry breaking constraints. Extensive experiments are also conducted to confirm the feasibility and efficiency of our proposal empirically.Detailed summary in vernacular field only.Detailed summary in vernacular field only.Li, Jingying.Thesis (M.Phil.)--Chinese University of Hong Kong, 2012.Includes bibliographical references (leaves 101-112).Abstracts also in Chinese.Chapter 1 --- Introduction --- p.1Chapter 1.1 --- Constraint Satisfaction Problems --- p.1Chapter 1.2 --- Motivation and Goals --- p.3Chapter 1.3 --- Outline of Thesis --- p.5Chapter 2 --- Background --- p.8Chapter 2.1 --- Constraint Satisfaction Problems --- p.8Chapter 2.1.1 --- Backtracking Search --- p.9Chapter 2.1.2 --- Consistency Techniques --- p.12Chapter 2.1.3 --- Local Consistencies with Backtracking Search --- p.15Chapter 2.2 --- Symmetry Breaking in CSPs --- p.16Chapter 2.2.1 --- Symmetry Classes --- p.18Chapter 2.2.2 --- Breaking Symmetries --- p.22Chapter 2.2.3 --- Variable and Value Symmetries --- p.23Chapter 2.2.4 --- Symmetry Breaking Constraints --- p.26Chapter 3 --- Effects of Symmetry Breaking Constraints --- p.29Chapter 3.1 --- Removing Symmetric Search Space --- p.29Chapter 3.1.1 --- Properties --- p.30Chapter 3.1.2 --- Canonical Variable Orderings --- p.31Chapter 3.1.3 --- Regenerating All Solutions --- p.33Chapter 3.1.4 --- Remaining Solution Set Sizes --- p.36Chapter 3.2 --- Constraint Interactions in Propagation --- p.43Chapter 4 --- Choices of Symmetry Breaking Constraints --- p.45Chapter 4.1 --- Side-Effects --- p.45Chapter 4.2 --- Symmetry Preservation --- p.50Chapter 4.2.1 --- De nition and Properties --- p.50Chapter 4.2.2 --- Solution Reduction --- p.54Chapter 4.2.3 --- Preservation Examples --- p.55Chapter 4.2.4 --- Preserving Order --- p.64Chapter 4.3 --- Eliminating Eliminated Symmetries --- p.65Chapter 4.3.1 --- Further Elimination --- p.65Chapter 4.3.2 --- Aggressive Elimination --- p.71Chapter 4.4 --- Interactions with Problem Constraints --- p.72Chapter 4.4.1 --- Further Simplification --- p.72Chapter 4.4.2 --- Increasing Constraint Propagation --- p.73Chapter 5 --- Experiments --- p.75Chapter 5.1 --- Symmetry Preservation --- p.75Chapter 5.1.1 --- Diagonal Latin Square Problem --- p.76Chapter 5.1.2 --- NN-Queen Problem --- p.77Chapter 5.1.3 --- Error Correcting Code - Lee Distance (ECCLD) --- p.78Chapter 5.2 --- Eliminating Eliminated Symmetries --- p.80Chapter 5.2.1 --- Equidistance Frequency Permutation Array Problem --- p.80Chapter 5.2.2 --- Cover Array Problem --- p.82Chapter 5.2.3 --- Sports League Scheduling Problem --- p.83Chapter 6 --- Related Work --- p.86Chapter 6.1 --- Symmetry Breaking Approaches --- p.86Chapter 6.2 --- Reducing Overhead and Increasing Propagation --- p.90Chapter 6.3 --- Selecting and Generating Choices --- p.91Chapter 6.3.1 --- Reducing Conflict with Search Heuristic --- p.92Chapter 6.3.2 --- Choosing the Subset of Symmetries --- p.93Chapter 6.4 --- Detecting Symmetries --- p.93Chapter 7 --- Conclusion and Remarks --- p.95Chapter 7.1 --- Conclusion --- p.95Chapter 7.2 --- Discussions --- p.97Chapter 7.3 --- Future Work --- p.99Bibliography --- p.10
Symmetry Breaking Constraints: Recent Results
Symmetry is an important problem in many combinatorial problems. One way of
dealing with symmetry is to add constraints that eliminate symmetric solutions.
We survey recent results in this area, focusing especially on two common and
useful cases: symmetry breaking constraints for row and column symmetry, and
symmetry breaking constraints for eliminating value symmetryComment: To appear in Proceedings of Twenty-Sixth Conference on Artificial
Intelligence (AAAI-12
Symmetry within Solutions
We define the concept of an internal symmetry. This is a symmety within a
solution of a constraint satisfaction problem. We compare this to solution
symmetry, which is a mapping between different solutions of the same problem.
We argue that we may be able to exploit both types of symmetry when finding
solutions. We illustrate the potential of exploiting internal symmetries on two
benchmark domains: Van der Waerden numbers and graceful graphs. By identifying
internal symmetries we are able to extend the state of the art in both cases.Comment: AAAI 2010, Proceedings of Twenty-Fourth AAAI Conference on Artificial
Intelligenc
On The Complexity and Completeness of Static Constraints for Breaking Row and Column Symmetry
We consider a common type of symmetry where we have a matrix of decision
variables with interchangeable rows and columns. A simple and efficient method
to deal with such row and column symmetry is to post symmetry breaking
constraints like DOUBLELEX and SNAKELEX. We provide a number of positive and
negative results on posting such symmetry breaking constraints. On the positive
side, we prove that we can compute in polynomial time a unique representative
of an equivalence class in a matrix model with row and column symmetry if the
number of rows (or of columns) is bounded and in a number of other special
cases. On the negative side, we show that whilst DOUBLELEX and SNAKELEX are
often effective in practice, they can leave a large number of symmetric
solutions in the worst case. In addition, we prove that propagating DOUBLELEX
completely is NP-hard. Finally we consider how to break row, column and value
symmetry, correcting a result in the literature about the safeness of combining
different symmetry breaking constraints. We end with the first experimental
study on how much symmetry is left by DOUBLELEX and SNAKELEX on some benchmark
problems.Comment: To appear in the Proceedings of the 16th International Conference on
Principles and Practice of Constraint Programming (CP 2010
Improving the Computational Efficiency in Symmetrical Numeric Constraint Satisfaction Problems
Models are used in science and engineering for experimentation,
analysis, diagnosis or design. In some cases, they can be considered
as numeric constraint satisfaction problems (NCSP). Many models
are symmetrical NCSP. The consideration of symmetries ensures that
NCSP-solver will find solutions if they exist on a smaller search space.
Our work proposes a strategy to perform it. We transform the symmetrical
NCSP into a newNCSP by means of addition of symmetry-breaking
constraints before the search begins. The specification of a library of possible
symmetries for numeric constraints allows an easy choice of these
new constraints. The summarized results of the studied cases show the
suitability of the symmetry-breaking constraints to improve the solving
process of certain types of symmetrical NCSP. Their possible speedup
facilitates the application of modelling and solving larger and more
realistic problems.Ministerio de Ciencia y Tecnología DIP2003-0666-02-
- …