Bounded Rewriting Induction for LCSTRSs
Fuente:
arXiv
Saved in:
| Main Authors: | Hagens, Kasper, Kop, Cynthia |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Templates in Rewriting Induction
by: Hagens, Kasper, et al.
Published: (2026)
by: Hagens, Kasper, et al.
Published: (2026)
Higher-Order Constrained Dependency Pairs for (Universal) Computability
by: Guo, Liye, et al.
Published: (2024)
by: Guo, Liye, et al.
Published: (2024)
Verifying Procedural Programs via Constrained Rewriting Induction
by: Fuhs, Carsten, et al.
Published: (2014)
by: Fuhs, Carsten, et al.
Published: (2014)
A weakly monotonic, logically constrained, HORPO-variant
by: Kop, Cynthia
Published: (2024)
by: Kop, Cynthia
Published: (2024)
A Characterization of Basic Feasible Functionals Through Higher-Order Rewriting and Tuple Interpretations
by: Baillot, Patrick, et al.
Published: (2024)
by: Baillot, Patrick, et al.
Published: (2024)
Proceedings of the 19th International Workshop on Logical and Semantic Frameworks, with Applications
by: Kop, Cynthia, et al.
Published: (2025)
by: Kop, Cynthia, et al.
Published: (2025)
Tree Rewriting Calculi for Strictly Positive Logics
by: Santiago-Fernández, Sofía, et al.
Published: (2025)
by: Santiago-Fernández, Sofía, et al.
Published: (2025)
On Complexity Bounds and Confluence of Parallel Term Rewriting
by: Baudon, Thaïs, et al.
Published: (2023)
by: Baudon, Thaïs, et al.
Published: (2023)
Rewriting Induction for Existentially Quantified Equations in Logically Constrained Rewriting (Full Version)
by: Nishida, Naoki, et al.
Published: (2026)
by: Nishida, Naoki, et al.
Published: (2026)
Drag Rewriting
by: Dershowitz, Nachum, et al.
Published: (2024)
by: Dershowitz, Nachum, et al.
Published: (2024)
Rewriting and Inductive Reasoning
by: Hajdu, Márton, et al.
Published: (2024)
by: Hajdu, Márton, et al.
Published: (2024)
A Topological Rewriting of Tarski's Mereogeometry
by: Barlatier, Patrick, et al.
Published: (2025)
by: Barlatier, Patrick, et al.
Published: (2025)
Induction and Recursion Principles in a Higher-Order Quantitative Logic for Probability
by: Bacci, Giorgio, et al.
Published: (2025)
by: Bacci, Giorgio, et al.
Published: (2025)
A Rewriting Theory for Quantum Lambda-Calculus
by: Faggian, Claudia, et al.
Published: (2024)
by: Faggian, Claudia, et al.
Published: (2024)
Confluence of Logically Constrained Rewrite Systems Revisited
by: Schöpf, Jonas, et al.
Published: (2024)
by: Schöpf, Jonas, et al.
Published: (2024)
On Problems Dual to Unification: The String-Rewriting Case
by: Akçam, Zümrüt, et al.
Published: (2021)
by: Akçam, Zümrüt, et al.
Published: (2021)
Timed Strategies for Real-Time Rewrite Theories
by: Olarte, Carlos, et al.
Published: (2024)
by: Olarte, Carlos, et al.
Published: (2024)
Getting Saturated with Induction
by: Hajdu, Márton, et al.
Published: (2024)
by: Hajdu, Márton, 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)
by: Chen, Hubie, et al.
Published: (2024)
Nominal Equational Rewriting and Narrowing
by: Ayala-Rincón, Mauricio, et al.
Published: (2025)
by: Ayala-Rincón, Mauricio, et al.
Published: (2025)
Formalizing Representation Theorems for a Logical Framework with Rewriting
by: Traversié, Thomas, et al.
Published: (2025)
by: Traversié, Thomas, et al.
Published: (2025)
Variable Elimination as Rewriting in a Linear Lambda Calculus
by: Ehrhard, Thomas, et al.
Published: (2025)
by: Ehrhard, Thomas, et al.
Published: (2025)
Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders
by: Fernández, Maribel, et al.
Published: (2025)
by: Fernández, Maribel, et al.
Published: (2025)
Weighted Rewriting: Semiring Semantics for Abstract Reduction Systems
by: Ahrens, Emma, et al.
Published: (2025)
by: Ahrens, Emma, et al.
Published: (2025)
Induction rules for Transition Algebra
by: Hashimoto, Go
Published: (2026)
by: Hashimoto, Go
Published: (2026)
Automated Analysis of Logically Constrained Rewrite Systems using crest
by: Schöpf, Jonas, et al.
Published: (2025)
by: Schöpf, Jonas, et al.
Published: (2025)
A Dependency Pair Framework for Relative Termination of Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2024)
by: Kassing, Jan-Christoph, et al.
Published: (2024)
Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems
by: Kanovich, Max, et al.
Published: (2016)
by: Kanovich, Max, et al.
Published: (2016)
Confluence Criteria for Logically Constrained Rewrite Systems (Full Version)
by: Schöpf, Jonas, et al.
Published: (2023)
by: Schöpf, Jonas, et al.
Published: (2023)
Left-Linear Rewriting in Adhesive Categories
by: Baldan, Paolo, et al.
Published: (2024)
by: Baldan, Paolo, et al.
Published: (2024)
Partial Rewriting and Value Interpretation of Logically Constrained Terms (Full Version)
by: Aoto, Takahito, et al.
Published: (2026)
by: Aoto, Takahito, et al.
Published: (2026)
From Rewrite Rules to Axioms in the $λ$$Π$-Calculus Modulo Theory
by: Blot, Valentin, et al.
Published: (2024)
by: Blot, Valentin, et al.
Published: (2024)
Inductive Reasoning with Equality Predicates, Contextual Rewriting and Variant-Based Simplification
by: Meseguer, Jose
Published: (2024)
by: Meseguer, Jose
Published: (2024)
Small Term Reachability and Related Problems for Terminating Term Rewriting Systems
by: Baader, Franz, et al.
Published: (2024)
by: Baader, Franz, et al.
Published: (2024)
Unified Opinion Dynamic Modeling as Concurrent Set Relations in Rewriting Logic
by: Olarte, Carlos, et al.
Published: (2024)
by: Olarte, Carlos, et al.
Published: (2024)
Equational Theories and Validity for Logically Constrained Term Rewriting (Full Version)
by: Aoto, Takahito, et al.
Published: (2024)
by: Aoto, Takahito, et al.
Published: (2024)
Recovering Commutation of Logically Constrained Rewriting and Equivalence Transformations (Full Version)
by: Takahata, Kanta, et al.
Published: (2025)
by: Takahata, Kanta, et al.
Published: (2025)
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2023)
by: Kassing, Jan-Christoph, et al.
Published: (2023)
Rewriting with Acyclic Queries: Mind Your Head
by: Geck, Gaetano, et al.
Published: (2022)
by: Geck, Gaetano, et al.
Published: (2022)
Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2024)
by: Kassing, Jan-Christoph, et al.
Published: (2024)
Similar Items
-
Templates in Rewriting Induction
by: Hagens, Kasper, et al.
Published: (2026) -
Higher-Order Constrained Dependency Pairs for (Universal) Computability
by: Guo, Liye, et al.
Published: (2024) -
Verifying Procedural Programs via Constrained Rewriting Induction
by: Fuhs, Carsten, et al.
Published: (2014) -
A weakly monotonic, logically constrained, HORPO-variant
by: Kop, Cynthia
Published: (2024) -
A Characterization of Basic Feasible Functionals Through Higher-Order Rewriting and Tuple Interpretations
by: Baillot, Patrick, et al.
Published: (2024)