English
Related papers

Related papers: Symmetries of Quantified Boolean Formulas

200 papers

Quantum algebras are a mathematical tool which provides us with a class of symmetries wider than that of Lie algebras, which are contained in the former as a special case. After a self-contained introduction to the necessary mathematical…

Nuclear Theory · Physics 2008-02-03 Dennis Bonatsos , C. Daskaloyannis , P. Kolokotronis , D. Lenis

Resolution is the rule of inference at the basis of most procedures for automated reasoning. In these procedures, the input formula is first translated into an equisatisfiable formula in conjunctive normal form (CNF) and then represented as…

Artificial Intelligence · Computer Science 2011-11-04 E. Giunchiglia , M. Narizzano , A. Tacchella

Symmetry is a powerful tool for studying dynamics in QFT: it provides selection rules, constrains RG flows, and often simplifies analysis. Currently, our understanding is that the most general form of symmetry is described by categorical…

High Energy Physics - Theory · Physics 2024-11-06 T. Daniel Brennan , Zhengdi Sun

We generalize many results concerning the tractability of SAT and #SAT on bounded treewidth CNF-formula in the context of Quantified Boolean Formulas (QBF). To this end, we start by studying the notion of width for OBDD and observe that the…

Computational Complexity · Computer Science 2018-07-12 Florent Capelli , Stefan Mengel

These are a set of lecture notes on generalized global symmetries in quantum field theory. The focus is on invertible symmetries with a few comments regarding non-invertible symmetries. The main topics covered are the basics of higher-form…

We introduce two types of message passing algorithms for quantified Boolean formulas (QBF). The first type is a message passing based heuristics that can prove unsatisfiability of the QBF by assigning the universal variables in such a way…

Artificial Intelligence · Computer Science 2012-06-12 Pan Zhang , Abolfazl Ramezanpour , Lenka Zdeborová , Riccardo Zecchina

Topological defects and operators give a far-reaching generalization of symmetries of quantum fields. An auxiliary topological field theory in one dimension higher than the QFT of interest, known as the SymTFT, provides a natural way for…

High Energy Physics - Theory · Physics 2025-12-15 Federico Bonetti , Michele Del Zotto , Ruben Minasian

We introduce and investigate symbolic proof systems for Quantified Boolean Formulas (QBF) operating on Ordered Binary Decision Diagrams (OBDDs). These systems capture QBF solvers that perform symbolic quantifier elimination, and as such…

Computational Complexity · Computer Science 2021-04-07 Stefan Mengel , Friedrich Slivovsky

Curved Boolean Logic (CBL) generalizes propositional logic by allowing local truth assignments that do not extend to a single global valuation, analogous to curvature in geometry. We give equivalent sheaf and exclusivity-graph semantics and…

Logic in Computer Science · Computer Science 2025-10-14 Maximilian R. P. von Liechtenstein

Several effective preprocessing techniques for Boolean formulas with and without quantifiers use unit propagation to simplify the formula. Among these techniques are vivification, unit propagation look-ahead (UPLA), and the identification…

Logic in Computer Science · Computer Science 2023-03-28 Ralf Wimmer , Ming-Yi Hu

Over the last few years, much progress has been made in the theory and practice of solving quantified Boolean formulas (QBF). Novel solvers have been presented that either successfully enhance established techniques or implement novel…

Logic in Computer Science · Computer Science 2016-04-21 Florian Lonsing , Martina Seidl , Allen Van Gelder

Q-resolution is a proof system for quantified Boolean formulas (QBFs) in prenex conjunctive normal form (PCNF) which underlies search-based QBF solvers with clause and cube learning (QCDCL). With the aim to derive and learn stronger clauses…

Logic in Computer Science · Computer Science 2016-06-15 Florian Lonsing , Uwe Egly , Martina Seidl

Determining the validity of a quantified Boolean formula (QBF) is a PSPACE-complete problem with rich expressive power. Despite interest in efficient solvers, there is, compared to problems in NP, a lack of positive theoretical results, and…

Computational Complexity · Computer Science 2026-05-13 Leif Eriksson , Victor Lagerkvist , Sebastian Ordyniak , George Osipov , Fahad Panolan , Mateusz Rychlicki

Quasi-Boolean algebras were introduced as the generalization of Boolean algebras in the setting of quantum computation logic. In this paper, we investigate the completeness and congruences of quasi-Boolean algebras. First, we discuss the…

Logic · Mathematics 2025-10-28 Xiaohao Liu , Heyan Wang , Wenjuan Chen

We study conformally invariant boundary conditions that break part of the bulk symmetries. A general theory is developped for those boundary conditions for which the preserved subalgebra is the fixed algebra under an abelian orbifold group.…

High Energy Physics - Theory · Physics 2009-10-31 J. Fuchs , C. Schweigert

Symmetry plays a central role in quantum field theory. Recent developments include symmetries that act on defects and other subsystems, and symmetries that are categorical rather than group-like. These generalized notions of symmetry allow…

High Energy Physics - Theory · Physics 2022-05-20 Clay Cordova , Thomas T. Dumitrescu , Kenneth Intriligator , Shu-Heng Shao

A general algebraic approach, incorporating both invariance groups and dynamic symmetry algebras, is developed to reveal hidden coherent structures (closed complexes and configurations) in quantum many-body physics models due to symmetries…

Quantum Physics · Physics 2008-11-26 Valery P. Karassiov

In general quantum field theories (QFTs), ordinary (0-form) global symmetries and 1-form symmetries can combine into 2-group global symmetries. We describe this phenomenon in detail using the language of symmetry defects. We exhibit a…

High Energy Physics - Theory · Physics 2019-03-28 Francesco Benini , Clay Cordova , Po-Shen Hsin

We study quantified propositional logics from the complexity theoretic point of view. First we introduce alternating dependency quantified boolean formulae (ADQBF) which generalize both quantified and dependency quantified boolean formulae.…

Logic in Computer Science · Computer Science 2016-09-15 Miika Hannula , Juha Kontinen , Martin Lück , Jonni Virtema

Symmetry Breaking is used as an "underlying principle", bringing different features of QFT to the foreground. However, the understanding of Symmetry Breaking that is used here is quite different from what is done in the mainstream: Symmetry…

High Energy Physics - Theory · Physics 2009-04-16 D. D. Ferrante