Imagen de Portada

Symmetries of Dependency Quantified Boolean Formulas

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Hofstadler, Clemens, Kauers, Manuel, Seidl, Martina
Formato:	Preprint
Publicado:	2024
Materias:	Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Model Counting for Dependency Quantified Boolean Formulas
por: Fung, Long-Hin, et al.
Publicado: (2025)

Satisfiability of Quantified Boolean Announcements
por: van Ditmarsch, Hans, et al.
Publicado: (2022)

The QBF Gallery 2023
por: Heisinger, Simone, et al.
Publicado: (2026)

On the Number of Quantifiers Needed to Define Boolean Functions
por: Carmosino, Marco, et al.
Publicado: (2024)

Efficient Implementation of an Abstract Domain of Quantified First-Order Formulas
por: Frenkel, Eden, et al.
Publicado: (2024)

Rings and Boolean Algebras as Algebraic Theories
por: De Faveri, Arturo
Publicado: (2025)

Boolean basis, formula size, and number of modal operators
por: Berkholz, Christoph, et al.
Publicado: (2024)

Breaking Symmetries in Quantified Graph Search: A Comparative Study
por: Janota, Mikoláš, et al.
Publicado: (2025)

Structural Analysis of Boolean Equation Systems
por: Keiren, Jeroen, et al.
Publicado: (2010)

Compositional Control-Driven Boolean Circuits
por: Arellanes, Damian
Publicado: (2025)

Embedded Finite Models Beyond Restricted Quantifier Collapse
por: Benedikt, Michael, et al.
Publicado: (2023)

On Top-Down Pseudo-Boolean Model Counting
por: Yang, Suwei, et al.
Publicado: (2025)

Some General Completeness Results for Propositionally Quantified Modal Logics
por: Ding, Yifeng, et al.
Publicado: (2024)

A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity
por: Grabmayer, Clemens
Publicado: (2022)

Bringing memory to Boolean networks: a unifying framework
por: Gadouleau, Maximilien, et al.
Publicado: (2024)

Practical Boolean Decomposition for Delay-driven LUT Mapping
por: Calvino, Alessandro Tempia, et al.
Publicado: (2024)

Bridging abstract dialectical argumentation and Boolean gene regulation
por: Azpeitia, Eugenio, et al.
Publicado: (2024)

Simplifier: A New Tool for Boolean Circuit Simplification
por: Averkov, Daniil, et al.
Publicado: (2025)

When Are Prime Formulae Characteristic?
por: Aceto, Luca, et al.
Publicado: (2024)

Characterizing LTL Formulas by Examples
por: Cate, Balder ten, et al.
Publicado: (2026)

Characterising Modal Formulas with Examples
por: Cate, Balder ten, et al.
Publicado: (2023)

Dependence Logics in Temporal Settings
por: Baltag, Alexandru, et al.
Publicado: (2022)

Nested Sequents for Horn-Characterizable Quantified Modal Logics with Equality via Reachability Rules
por: Lyon, Tim S., et al.
Publicado: (2026)

Primitive Recursive Dependent Type Theory
por: Buchholtz, Ulrik, et al.
Publicado: (2024)

Efficient Volume Computation for SMT Formulas
por: Shaw, Arijit, et al.
Publicado: (2025)

Deciding Boolean Separation Logic via Small Models (Technical Report)
por: Dacík, Tomáš, et al.
Publicado: (2024)

Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks
por: Kabir, Mohimenul, et al.
Publicado: (2025)

A Sequent Calculus For Trace Formula Implication
por: Heidler, Niklas, et al.
Publicado: (2025)

Non-Derivability Results in Polymorphic Dependent Type Theory
por: Geuvers, Herman
Publicado: (2026)

$Π_{2}^{P}$ vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem
por: Zhuk, Dmitriy
Publicado: (2024)

Logics with probabilistic team semantics and the Boolean negation
por: Hannula, Miika, et al.
Publicado: (2023)

From Quantifier Depth to Quantifier Number: Separating Structures with k Variables
por: Vinall-Smeeth, Harry
Publicado: (2023)

The Undecidability of Quantified Announcements
por: Ågotnes, Thomas, et al.
Publicado: (2024)

Interpolation and Quantifiers in Ortholattices
por: Guilloud, Simon, et al.
Publicado: (2025)

Progress, Justness and Fairness in Modal $μ$-Calculus Formulae
por: Spronck, Myrthe, et al.
Publicado: (2024)

The Complexity of Defining and Separating Fixpoint Formulae in Modal Logic
por: Jung, Jean Christoph, et al.
Publicado: (2025)

Formulas as Processes, Deadlock-Freedom as Choreographies (Extended Version)
por: Acclavio, Matteo, et al.
Publicado: (2025)

A topological reading of inductive and coinductive definitions in Dependent Type Theory
por: Sabelli, Pietro
Publicado: (2024)

Improved Static Analysis of Parameterised Boolean Equation Systems using Control Flow Reconstruction
por: Keiren, Jeroen J. A., et al.
Publicado: (2013)

The Dual of Quantifier Elimination: Boolean Elimination over C and R
por: Frank, Matthew
Publicado: (2025)