Image de couverture de livre

Characterizing Equivalence of Logically Constrained Terms via Existentially Constrained Terms (Full Version)

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Takahata, Kanta, Schöpf, Jonas, Nishida, Naoki, Aoto, Takahito
Format:	Preprint
Publié:	2025
Sujets:	Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Recovering Commutation of Logically Constrained Rewriting and Equivalence Transformations (Full Version)
par: Takahata, Kanta, et autres
Publié: (2025)

Equational Theories and Validity for Logically Constrained Term Rewriting (Full Version)
par: Aoto, Takahito, et autres
Publié: (2024)

Partial Rewriting and Value Interpretation of Logically Constrained Terms (Full Version)
par: Aoto, Takahito, et autres
Publié: (2026)

Difference of Constrained Patterns in Logically Constrained Term Rewrite Systems (Full Version)
par: Nishida, Naoki, et autres
Publié: (2025)

Confluence Criteria for Logically Constrained Rewrite Systems (Full Version)
par: Schöpf, Jonas, et autres
Publié: (2023)

Rewriting Induction for Existentially Quantified Equations in Logically Constrained Rewriting (Full Version)
par: Nishida, Naoki, et autres
Publié: (2026)

Automated Analysis of Logically Constrained Rewrite Systems using crest
par: Schöpf, Jonas, et autres
Publié: (2025)

Confluence of Logically Constrained Rewrite Systems Revisited
par: Schöpf, Jonas, et autres
Publié: (2024)

Termination of Innermost-Terminating Right-Linear Overlay Term Rewrite Systems (Full Version)
par: Nishida, Naoki
Publié: (2026)

Verifying Procedural Programs via Constrained Rewriting Induction
par: Fuhs, Carsten, et autres
Publié: (2014)

Abstract Framework for All-Path Reachability Analysis toward Safety and Liveness Verification (Full Version)
par: Kojima, Misaki, et autres
Publié: (2026)

Towards Term-based Verification of Diagrammatic Equivalence
par: Cailler, Julie, et autres
Publié: (2026)

A Hoare Logic for Domain Specification (Full Version)
par: Kamburjan, Eduard, et autres
Publié: (2024)

Existential Notation3 Logic
par: Arndt, Dörthe, et autres
Publié: (2023)

Translation of Temporal Logic for Efficient Infinite-State Reactive Synthesis (Full Version)
par: Heim, Philippe, et autres
Publié: (2024)

From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting
par: Kassing, Jan-Christoph, et autres
Publié: (2023)

Semantic Incompleteness of Liberman et al. (2020)'s Hilbert-style System for Term-modal Logic K with Equality and Non-rigid Terms
par: Sawasaki, Takahiro
Publié: (2024)

Equivalence and Conditional Independence in Atomic Sheaf Logic
par: Simpson, Alex
Publié: (2024)

Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
par: Kassing, Jan-Christoph, et autres
Publié: (2024)

Automated Catamorphism Synthesis for Solving Constrained Horn Clauses over Algebraic Data Types
par: Katsura, Hiroyuki, et autres
Publié: (2025)

Paraconsistent Existential Graphs Gamma Peirce System
par: Sierra-Aristizabal, Manuel
Publié: (2023)

Existential and positive games: a comonadic and axiomatic view
par: Abramsky, Samson, et autres
Publié: (2025)

From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity
par: Kassing, Jan-Christoph, et autres
Publié: (2024)

Reachability Analysis Using Constrained Polynomial Logical Zonotopes
par: Hafez, Ahmad, et autres
Publié: (2024)

Beyond Ability: The Four-Fold Spectrum of Power and the Logic of Full Inability
par: Wang, Shanxia
Publié: (2026)

Power Term Polynomial Algebra for Boolean Logic
par: Sansone, Emanuele, et autres
Publié: (2026)

Impure Simplicial Complex and Term-Modal Logic with Assignment Operators
par: Yang, Yuanzhe
Publié: (2025)

Small Term Reachability and Related Problems for Terminating Term Rewriting Systems
par: Baader, Franz, et autres
Publié: (2024)

Towards Counting Markov Equivalence Classes with Logical Constraints
par: Bizzaro, Davide, et autres
Publié: (2024)

Synthesizing Strongly Equivalent Logic Programs: Beth Definability for Answer Set Programs via Craig Interpolation in First-Order Logic
par: Heuer, Jan, et autres
Publié: (2024)

Term Ordering Diagrams
par: Hajdu, Márton, et autres
Publié: (2025)

Proof Nets for PiL (Full Version)
par: Acclavio, Matteo, et autres
Publié: (2026)

A Mixed Linear and Graded Logic: Proofs, Terms, and Models (with appendices)
par: Vollmer, Victoria, et autres
Publié: (2024)

Constructive Interpolation and Concept-Based Beth Definability for Description Logics via Sequents
par: Lyon, Tim S., et autres
Publié: (2024)

Identifying and Explaining (Non-)Equivalence of First-Order Logic Formulas
par: Vehlken, Fabian, et autres
Publié: (2026)

Equilibrium Semantics and Strong Equivalence for Higher-Order Logic Programs
par: Charalambidis, Angelos, et autres
Publié: (2026)

Existential Positive Transductions of Sparse Graphs
par: Mählmann, Nikolas, et autres
Publié: (2026)

Decidability of Graph Neural Networks via Logical Characterizations
par: Benedikt, Michael, et autres
Publié: (2024)

Compiling Quantum Lambda-Terms into Circuits via the Geometry of Interaction
par: Chardonnet, Kostia, et autres
Publié: (2026)

Finite Axiomatizability by Disjunctive Existential Rules
par: Calautti, Marco, et autres
Publié: (2025)