:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Baader, Franz, Giesl, Jürgen
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science
Online Access:	https://arxiv.org/abs/2412.06047
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

The Annotated Dependency Pair Framework for Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, 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)

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

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

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

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

Deciding Termination of Simple Randomized Loops
by: Meyer, Éléanore, et al.
Published: (2025)

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

Termination of Triangular Polynomial Loops
by: Hark, Marcel, et al.
Published: (2019)

AProVE: Modular Termination Analysis of Memory-Manipulating C Programs
by: Emrich, Frank, et al.
Published: (2023)

Infinite State Model Checking by Learning Transitive Relations
by: Frohn, Florian, et al.
Published: (2025)

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

On Deciding Constant Runtime of Linear Loops
by: Frohn, Florian, et al.
Published: (2026)

The Unification Type of an Equational Theory May Depend on the Instantiation Preorder: From Results for Single Theories to Results for Classes of Theories
by: Baader, Franz, et al.
Published: (2026)

Integrating Loop Acceleration into Bounded Model Checking
by: Frohn, Florian, et al.
Published: (2024)

Satisfiability Modulo Exponential Integer Arithmetic
by: Frohn, Florian, et al.
Published: (2024)

Modular Automatic Complexity Analysis of Recursive Integer Programs
by: Lommen, Nils, et al.
Published: (2025)

Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
by: Lommen, Nils, et al.
Published: (2023)

Accelerating Loops with Arrays
by: Frohn, Florian, et al.
Published: (2026)

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

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

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

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

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

Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT
by: Lommen, Nils, et al.
Published: (2024)

Targeting Completeness: Automated Complexity Analysis of Integer Programs
by: Lommen, Nils, et al.
Published: (2024)

Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
by: Lommen, Nils, et al.
Published: (2022)

Concrete Domains Meet Expressive Cardinality Restrictions in Description Logics (Extended Version)
by: Baader, Franz, et al.
Published: (2025)

Termination of Rewriting on Reversible Boolean Circuits as a Free 3-Category Problem
by: Barile, Adriano, et al.
Published: (2024)

Automated Strategy Invention for Confluence of Term Rewrite Systems
by: Zhang, Liao, et al.
Published: (2024)

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

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

Multiple Reachability in Linear Dynamical Systems
by: Karimov, Toghrul, et al.
Published: (2024)

Term Ordering Diagrams
by: Hajdu, Márton, et al.
Published: (2025)

Efficient Probabilistic Model Checking for Relational Reachability (Extended Version)
by: Gerlach, Lina, et al.
Published: (2025)

The Reachability Problem for Neural-Network Control Systems
by: Schilling, Christian, et al.
Published: (2024)

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

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