Cover Image

Dynamic Boolean Synthesis with Zero-suppressed Decision Diagrams

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lin, Yi, Vardi, Moshe Y.
Format:	Preprint
Published:	2025
Subjects:	Symbolic Computation Logic in Computer Science I.1.2; F.2.1; F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Probabilistic Shoenfield Machines
by: Bujok, Maksymilian, et al.
Published: (2024)

Integer Polynomial Factorization by Recombination of Real Factors: Re-evaluating an Old Technique in Modern Era
by: Iravanian, Shahriar
Published: (2024)

When do homomorphism counts help in query algorithms?
by: Cate, Balder ten, et al.
Published: (2023)

Normalization of Quaternionic Polynomials in Coordinate-Free Quaternionic Variables in Conjugate-Alternating Order
by: Li, Hongbo, et al.
Published: (2025)

Faster Inversion and Other Black Box Matrix Computations Using Efficient Block Projections
by: Eberly, Wayne, et al.
Published: (2007)

Certification of the QR factor R, and of lattice basis reducedness
by: Villard, Gilles
Published: (2007)

Complex reflection groups as differential Galois groups
by: Arreche, Carlos E., et al.
Published: (2024)

The Syntax and Semantics of einsum
by: Wenig, Maurice, et al.
Published: (2025)

Non-minimality of minimal telescopers explained by residues
by: Chen, Shaoshi, et al.
Published: (2025)

Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs
by: de Rezende, Susanna F., et al.
Published: (2019)

Summa Summarum: Moessner's Theorem without Dynamic Programming
by: Danvy, Olivier
Published: (2024)

Unravelling Abstract Cyclic Proofs into Proofs by Induction
by: Grotenhuis, Lide, et al.
Published: (2026)

MathPartner: An Artificial Intelligence Cloud Service
by: Malaschonok, Gennadi, et al.
Published: (2024)

SUBMASSIVE: Resolving Subclass Cycles in Very Large Knowledge Graphs
by: Wang, Shuai, et al.
Published: (2024)

Inductive First-Order Formula Synthesis by ASP: A Case Study in Invariant Inference
by: Yang, Ziyi, et al.
Published: (2026)

Constant time testability of first-order logic with modulo counting on finitary graphs
by: Adler, Isolde, et al.
Published: (2026)

Space-time process algebra with asynchronous communication
by: Bergstra, J. A., et al.
Published: (2024)

Positivity certificates for linear recurrences
by: Ibrahim, Alaa, et al.
Published: (2023)

Dormancy-aware timed branching bisimilarity, with an application to communication protocol analysis
by: Middelburg, C. A.
Published: (2021)

Branching Bisimilarity for Processes with Time-outs
by: Reghem, Gaspard, et al.
Published: (2024)

Concrete Branching Bisimilarity for Processes with Time-outs
by: Reghem, Gaspard, et al.
Published: (2024)

Verifying First-Order Temporal Properties of Infinite-State Systems via Timers and Rankings
by: Lotan, Raz, et al.
Published: (2026)

Proving Cutoff Bounds for Safety Properties in First-Order Logic
by: Lotan, Raz, et al.
Published: (2024)

Implicit Rankings for Verifying Liveness Properties in First-Order Logic
by: Lotan, Raz, et al.
Published: (2024)

A Quadratic Lower Bound for Simulation
by: Groote, Jan Friso, et al.
Published: (2024)

A Complete Finitary Refinement Type System for Scott-Open Properties
by: Riba, Colin, et al.
Published: (2026)

Converting BPMN Diagrams to Privacy Calculus
by: Pitsiladis, Georgios V., et al.
Published: (2024)

From Compactifying Lambda-Letrec Terms to Recognizing Regular-Expression Processes
by: Grabmayer, Clemens
Published: (2024)

Power Series Composition in Near-Linear Time
by: Kinoshita, Yasunori, et al.
Published: (2024)

Deciding One to One property of Boolean maps: Condition and algorithm in terms of implicants
by: Sule, Virendra
Published: (2023)

Mechanizing Operads with Event-B
by: Attiogbé, Christian
Published: (2025)

Chronology as a Consistency Invariant in Composable Information Systems
by: Calvo, Anherutowa, et al.
Published: (2026)

A Resolution-Based Interactive Proof System for UNSAT
by: Czerner, Philipp, et al.
Published: (2024)

FastLEC: Parallel Datapath Equivalence Checking with Hybrid Engines
by: Zhang, Xindi, et al.
Published: (2025)

Translating Three-Variable First-Order Predicate Logic to Relation Algebra, Implemented using Z3
by: Brogni, Anthony, et al.
Published: (2023)

Reactive Synthesis for Expected Impacts
by: Chini, Emanuele, et al.
Published: (2024)

On the Satisfaction Probabilities of $k$-CNF Formulas
by: Tantau, Till
Published: (2022)

$XX^{t}$ Can Be Faster
by: Rybin, Dmitry, et al.
Published: (2025)

Towards LLM-based Generation of Human-Readable Proofs in Polynomial Formal Verification
by: Drechsler, Rolf
Published: (2025)

A Coq-based Axiomatization of Tarski's Mereogeometry
by: Barlatier, Patrick, et al.
Published: (2025)