Copertina

Templates in Rewriting Induction

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Hagens, Kasper, Kop, Cynthia
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Logic in Computer Science
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Bounded Rewriting Induction for LCSTRSs
di: Hagens, Kasper, et al.
Pubblicazione: (2026)

Higher-Order Constrained Dependency Pairs for (Universal) Computability
di: Guo, Liye, et al.
Pubblicazione: (2024)

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

A weakly monotonic, logically constrained, HORPO-variant
di: Kop, Cynthia
Pubblicazione: (2024)

A Characterization of Basic Feasible Functionals Through Higher-Order Rewriting and Tuple Interpretations
di: Baillot, Patrick, et al.
Pubblicazione: (2024)

Proceedings of the 19th International Workshop on Logical and Semantic Frameworks, with Applications
di: Kop, Cynthia, et al.
Pubblicazione: (2025)

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

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

Drag Rewriting
di: Dershowitz, Nachum, et al.
Pubblicazione: (2024)

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

A Topological Rewriting of Tarski's Mereogeometry
di: Barlatier, Patrick, et al.
Pubblicazione: (2025)

Induction and Recursion Principles in a Higher-Order Quantitative Logic for Probability
di: Bacci, Giorgio, et al.
Pubblicazione: (2025)

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

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

On Problems Dual to Unification: The String-Rewriting Case
di: Akçam, Zümrüt, et al.
Pubblicazione: (2021)

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

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

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

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

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

Variable Elimination as Rewriting in a Linear Lambda Calculus
di: Ehrhard, Thomas, et al.
Pubblicazione: (2025)

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

Weighted Rewriting: Semiring Semantics for Abstract Reduction Systems
di: Ahrens, Emma, et al.
Pubblicazione: (2025)

Induction rules for Transition Algebra
di: Hashimoto, Go
Pubblicazione: (2026)

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

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

Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems
di: Kanovich, Max, et al.
Pubblicazione: (2016)

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

Left-Linear Rewriting in Adhesive Categories
di: Baldan, Paolo, et al.
Pubblicazione: (2024)

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

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

Inductive Reasoning with Equality Predicates, Contextual Rewriting and Variant-Based Simplification
di: Meseguer, Jose
Pubblicazione: (2024)

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

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

Equational Theories and Validity for Logically Constrained Term Rewriting (Full Version)
di: Aoto, Takahito, et al.
Pubblicazione: (2024)

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

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

Rewriting with Acyclic Queries: Mind Your Head
di: Geck, Gaetano, et al.
Pubblicazione: (2022)

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

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