Copertina

Partial Rewriting and Value Interpretation of Logically Constrained Terms (Full Version)

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Aoto, Takahito, Nishida, Naoki, Schöpf, Jonas
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

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)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Partially Finite Model Reasoning in Description Logics Extended Version
di: Gogacz, Tomasz, et al.
Pubblicazione: (2026)

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

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

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

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

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

Unified Opinion Dynamic Modeling as Concurrent Set Relations in Rewriting Logic
di: Olarte, Carlos, 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)

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

A Dual-Threshold Probabilistic Knowing Value Logic
di: Wang, Shanxia
Pubblicazione: (2026)

Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting
di: Lichter, Moritz
Pubblicazione: (2022)

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

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

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

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

Many-Valued Modal Logic
di: Karniel, Amir, et al.
Pubblicazione: (2024)

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

Unification of Deterministic Higher-Order Patterns (Full Version)
di: Niederhauser, Johannes, et al.
Pubblicazione: (2026)

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

Sharing and Linear Logic with Restricted Access (Extended Version)
di: Barenbaum, Pablo, et al.
Pubblicazione: (2025)

Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting
di: Kassing, Jan-Christoph, et al.
Pubblicazione: (2025)

Modular Attractor Acceleration in Infinite-State Games (Full Version)
di: Heim, Philippe, et al.
Pubblicazione: (2026)

Localized Attractor Computations for Infinite-State Games (Full Version)
di: Schmuck, Anne-Kathrin, et al.
Pubblicazione: (2024)