Labeled Trees and Localized Automorphisms of the Cuntz Algebras

We initiate a detailed and systematic study of automorphisms of the Cuntz algebras \O_n which preserve both the diagonal and the core $UHF$-subalgebra. A general criterion of invertibility of endomorphisms yielding such automorphisms is given. Combinatorial investigations of endomorphisms related to permutation matrices are presented. Key objects entering this analysis are labeled rooted trees equipped with additional data. Our analysis provides insight into the structure of {\rm Aut}(\O_n) and leads to numerous new examples. In particular, we completely classify all such automorphisms of ${\mathcal O}_2$ for the permutation unitaries in $\otimes^4 M_2$. We show that the subgroup of {\rm Out}(\O_2) generated by these automorphisms contains a copy of the infinite dihedral group ${\mathbb Z} \rtimes {\mathbb Z}_2$.Comment: 35 pages, slight changes, to appear on Trans. Amer. Math. So

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