Cover Image

Partial Redundancy in Saturation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hajdu, Márton, Kovács, Laura, Voronkov, Andrei
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Getting Saturated with Induction
by: Hajdu, Márton, et al.
Published: (2024)

Term Ordering Diagrams
by: Hajdu, Márton, et al.
Published: (2025)

Saturating Sorting without Sorts
by: Georgiou, Pamina, et al.
Published: (2024)

Program Synthesis in Saturation
by: Hozzová, Petra, et al.
Published: (2024)

Synthesis Benchmarks for Automated Reasoning
by: Hajdu, Márton, et al.
Published: (2025)

Rewriting and Inductive Reasoning
by: Hajdu, Márton, et al.
Published: (2024)

Completeness of Synthesis under Realizability Assumptions using Superposition
by: Hajdu, Márton, et al.
Published: (2026)

Lean on Vampire Proofs (Short Paper)
by: Bodingbauer, Jonas, et al.
Published: (2026)

The Vampire Diary
by: Bártek, Filip, et al.
Published: (2025)

Positive Almost-Sure Termination of Polynomial Random Walks
by: Winkler, Lorenz, et al.
Published: (2025)

Lazy Reimplication in Chronological Backtracking
by: Coutelier, Robin, et al.
Published: (2025)

Finding Connections via Satisfiability Solving
by: Eisenhofer, Clemens, et al.
Published: (2026)

Constraint Learning for Non-confluent Proof Search
by: Rawson, Michael, et al.
Published: (2026)

Spanning Matrices via Satisfiability Solving
by: Eisenhofer, Clemens, et al.
Published: (2024)

Certificate-Aware Property-Directed Reachability
by: Ferdowsi, Arman, et al.
Published: (2026)

On Solving String Equations via Powers and Parikh Images
by: Eisenhofer, Clemens, et al.
Published: (2026)

SAT-Based Subsumption Resolution
by: Coutelier, Robin, et al.
Published: (2024)

Case Study: Saturations as Explicit Models in Equational Theories
by: Janota, Mikoláš, et al.
Published: (2026)

SAT Solving for Variants of First-Order Subsumption
by: Coutelier, Robin, et al.
Published: (2024)

PolySAT: Word-level Bit-vector Reasoning in Z3
by: Rath, Jakob, et al.
Published: (2024)

Existential Calculi of Relations with Transitive Closure: Complexity and Edge Saturations
by: Nakamura, Yoshiki
Published: (2023)

MCSat-based Finite Field Reasoning in the Yices2 SMT Solver
by: Hader, Thomas, et al.
Published: (2024)

Local structure of idempotent algebras I
by: Bulatov, Andrei A.
Published: (2020)

Linear Loop Synthesis for Quadratic Invariants
by: Hitarth, S., et al.
Published: (2023)

CryptoVampire: Automated Reasoning for the Complete Symbolic Attacker Cryptographic Model
by: Jeanteur, Simon, et al.
Published: (2023)

Realizing the totally unordered structure of ordinals
by: Fontanella, Laura, et al.
Published: (2025)

On Efficient Algorithms For Partial Quantifier Elimination
by: Goldberg, Eugene
Published: (2024)

Revisiting Stateful Partial-Order Reduction
by: Herbreteau, Frédéric, et al.
Published: (2024)

Partial Quantifier Elimination By Certificate Clauses
by: Goldberg, Eugene
Published: (2020)

From Partial to Monadic: Combinatory Algebra with Effects
by: Cohen, Liron, et al.
Published: (2025)

Programming and Reasoning in Partially Observable Probabilistic Environments
by: Gürtler, Tobias, et al.
Published: (2025)

Forward and Backward Simulations for Partially Observable Probability
by: Chen, Chris, et al.
Published: (2025)

On-the-fly LTLf Synthesis under Partial Observability
by: Alon, Nadav, et al.
Published: (2026)

Disjoint Partial Enumeration without Blocking Clauses
by: Spallitta, Giuseppe, et al.
Published: (2023)

Scaling CheckMate for Game-Theoretic Security
by: Rain, Sophie, et al.
Published: (2024)

Translating Workflow Nets into the Partially Ordered Workflow Language
by: Kourani, Humam, et al.
Published: (2025)

Characterizing the Exponential-Space Hierarchy Via Partial Fixpoints
by: Bruse, Florian, et al.
Published: (2025)

Structure-Aware Computing, Partial Quantifier Elimination And SAT
by: Goldberg, Eugene
Published: (2024)

From Coalgebraic Determinization to Belief Construction for Partial Observability
by: Kori, Mayuko, et al.
Published: (2026)

LLMs and Fuzzing in Tandem: A New Approach to Automatically Generating Weakest Preconditions
by: King, Daragh, et al.
Published: (2025)