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

Fast Convergence in Self-stabilizing Wireless Networks.

International audienceThe advent of large scale multi-hop wireless networks highlights problems of fault tolerance and scale in distributed systems, motivating designs that autonomously recover from transient faults and spontaneous reconfigurations. Self-stabilization provides an elegant solution for recovering from such faults. We present a complexity analysis for a family of self-stabilizing vertex coloring algorithms in the context of multi-hop wireless networks. Such "coloring" processes are used in several protocols for solving many different issues (clustering, synchronizing...). Overall, our results show that the actual stabilization time is much smaller than the upper bound provided by previous studies. Similarly, the height of the induced DAG is much lower than the linear dependency on the size of the color domain (that was previously announced). Finally, it appears that symmetry breaking tricks traditionally used to expedite stabilization are in fact harmful when used in networks that are not tightly synchronized

Computing Outside the Box: Average Consensus over Dynamic Networks

International audienceNetworked systems of autonomous agents, and applications thereof, often rely on the control primitive of average consensus, where the agents are to compute the average of private initial values. To provide reliable services that are easy to deploy, average consensus should continue to operate when the network is subject to frequent and unpredictable change, and should mobilize few computational resources, so that deterministic, low powered, and anonymous agents can partake in the network.In this stringent adversarial context, we investigate the implementation of average consensus by distributed algorithms over networks with bidirectional, but potentially short-lived, communication links. Inspired by convex recurrence rules for multi-agent systems, and the Metropolis average consensus rule in particular, we design a deterministic distributed algorithm that achieves asymptotic average consensus, which we show to operate in polynomial time in a synchronous temporal model.The algorithm is easy to implement, has low space and computational complexity, and is fully distributed, requiring neither symmetry-breaking devices like unique identifiers, nor global control or knowledge of the network. In the fully decentralized model that we adopt, to our knowledge, no other distributed average consensus algorithm has a better temporal complexity.Our approach distinguishes itself from classical convex recurrence rules in that the agent’s values may sometimes leave their previous convex hull. As a consequence, our convergence bound requires a subtle analysis, despite the syntactic simplicity of our algorithm

Amplitude chimeras and chimera death in dynamical networks

We find chimera states with respect to amplitude dynamics in a network of Stuart-Landau oscillators. These partially coherent and partially incoherent spatio-temporal patterns appear due to the interplay of nonlocal network topology and symmetry-breaking coupling. As the coupling range is increased, the oscillations are quenched, amplitude chimeras disappear and the network enters a symmetry-breaking stationary state. This particular regime is a novel pattern which we call chimera death. It is characterized by the coexistence of spatially coherent and incoherent inhomogeneous steady states and therefore combines the features of chimera state and oscillation death. Additionally, we show two different transition scenarios from amplitude chimera to chimera death. Moreover, for amplitude chimeras we uncover the mechanism of transition towards in-phase synchronized regime and discuss the role of initial conditions

Review of Rotational Symmetry Breaking in Baby Skyrme Models

We discuss one of the most interesting phenomena exhibited by baby skyrmions -- breaking of rotational symmetry. The topics we will deal with here include the appearance of rotational symmetry breaking in the static solutions of baby Skyrme models, both in flat as well as in curved spaces, the zero-temperature crystalline structure of baby skyrmions, and finally, the appearance of spontaneous breaking of rotational symmetry in rotating baby skyrmions.Comment: 35 pages, 16 figures. A version of this manuscript with higher-resolution figures is available at http://www.tau.ac.il/~itayhe/SkReview/SkReview.ra