Cover Image

Equational Theories and Validity for Logically Constrained Term Rewriting (Full Version)

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Aoto, Takahito, Nishida, Naoki, Schöpf, Jonas
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Partial Rewriting and Value Interpretation of Logically Constrained Terms (Full Version)
by: Aoto, Takahito, et al.
Published: (2026)

Recovering Commutation of Logically Constrained Rewriting and Equivalence Transformations (Full Version)
by: Takahata, Kanta, et al.
Published: (2025)

Characterizing Equivalence of Logically Constrained Terms via Existentially Constrained Terms (Full Version)
by: Takahata, Kanta, et al.
Published: (2025)

Confluence Criteria for Logically Constrained Rewrite Systems (Full Version)
by: Schöpf, Jonas, et al.
Published: (2023)

Difference of Constrained Patterns in Logically Constrained Term Rewrite Systems (Full Version)
by: Nishida, Naoki, et al.
Published: (2025)

Rewriting Induction for Existentially Quantified Equations in Logically Constrained Rewriting (Full Version)
by: Nishida, Naoki, et al.
Published: (2026)

Automated Analysis of Logically Constrained Rewrite Systems using crest
by: Schöpf, Jonas, et al.
Published: (2025)

Confluence of Logically Constrained Rewrite Systems Revisited
by: Schöpf, Jonas, et al.
Published: (2024)

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

Verifying Procedural Programs via Constrained Rewriting Induction
by: Fuhs, Carsten, et al.
Published: (2014)

Abstract Framework for All-Path Reachability Analysis toward Safety and Liveness Verification (Full Version)
by: Kojima, Misaki, et al.
Published: (2026)

From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2023)

Tree Rewriting Calculi for Strictly Positive Logics
by: Santiago-Fernández, Sofía, et al.
Published: (2025)

The Computability Path Order for Beta-Eta-Normal Higher-Order Rewriting (Full Version)
by: Niederhauser, Johannes, et al.
Published: (2025)

Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2024)

A Hoare Logic for Domain Specification (Full Version)
by: Kamburjan, Eduard, et al.
Published: (2024)

From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity
by: Kassing, Jan-Christoph, et al.
Published: (2024)

Translation of Temporal Logic for Efficient Infinite-State Reactive Synthesis (Full Version)
by: Heim, Philippe, et al.
Published: (2024)

Small Term Reachability and Related Problems for Terminating Term Rewriting Systems
by: Baader, Franz, et al.
Published: (2024)

Formalizing Representation Theorems for a Logical Framework with Rewriting
by: Traversié, Thomas, et al.
Published: (2025)

Nominal Equational Rewriting and Narrowing
by: Ayala-Rincón, Mauricio, et al.
Published: (2025)

Linearization via Rewriting (Long Version)
by: Lago, Ugo Dal, et al.
Published: (2025)

Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders
by: Fernández, Maribel, et al.
Published: (2025)

A Dependency Pair Framework for Relative Termination of Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2024)

Unified Opinion Dynamic Modeling as Concurrent Set Relations in Rewriting Logic
by: Olarte, Carlos, et al.
Published: (2024)

A Rewriting Theory for Quantum Lambda-Calculus
by: Faggian, Claudia, et al.
Published: (2024)

Timed Strategies for Real-Time Rewrite Theories
by: Olarte, Carlos, et al.
Published: (2024)

Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity
by: Chen, Hubie, et al.
Published: (2024)

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

On Explicit Solutions to Fixed-Point Equations in Propositional Dynamic Logic
by: Lyon, Tim S.
Published: (2024)

Approximation Fixpoint Theory as a Unifying Framework for Fuzzy Logic Programming Semantics (Extended Version)
by: Kettmann, Pascal, et al.
Published: (2025)

Paraconsistent Semantics for Extended Fuzzy Logic Programs via Approximation Fixpoint Theory [Extended Version]
by: Kettmann, Pascal, et al.
Published: (2026)

The Annotated Dependency Pair Framework for Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2024)

On Complexity Bounds and Confluence of Parallel Term Rewriting
by: Baudon, Thaïs, et al.
Published: (2023)

Proof Theory and Decision Procedures for Deontic STIT Logics
by: Lyon, Tim S., et al.
Published: (2024)

Proof Nets for PiL (Full Version)
by: Acclavio, Matteo, et al.
Published: (2026)

Disproving (Positive) Almost-Sure Termination of Probabilistic Term Rewriting via Random Walks
by: Kassing, Jan-Christoph, et al.
Published: (2026)

From Proof-theoretic Validity to Base-extension Semantics for Intuitionistic Propositional Logic
by: Gheorghiu, Alexander V., et al.
Published: (2022)

From Rewrite Rules to Axioms in the $λ$$Π$-Calculus Modulo Theory
by: Blot, Valentin, et al.
Published: (2024)

A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2023)