Complexity of conditional term rewriting
From MaRDI portal
Publication:2980968
DOI10.23638/LMCS-13(1:6)2017zbMATH Open1398.68275arXiv1510.07276MaRDI QIDQ2980968FDOQ2980968
Aart Middeldorp, Cynthia Kop, Thomas Sternagel
Publication date: 8 May 2017
Full work available at URL: https://arxiv.org/abs/1510.07276
Recommendations
Cites Work
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Conditional Confluence (System Description)
- Analyzing innermost runtime complexity of term rewriting by dependency pairs
- Algorithms with polynomial interpretation termination proof
- Polynomial path orders
- Tyrolean Complexity Tool: Features and Usage.
- Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems
- Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations
- Automated Complexity Analysis Based on the Dependency Pair Method
- Title not available (Why is that?)
- Automated Complexity Analysis Based on Context-Sensitive Rewriting
- The Derivational Complexity Induced by the Dependency Pair Method
- Term Rewriting and All That
- Complexity Analysis by Rewriting
- Title not available (Why is that?)
- Operational termination of conditional term rewriting systems
- Soundness of unravelings for conditional term rewriting systems via ultra-properties related to linearity
- 2D Dependency Pairs for Proving Operational Termination of CTRSs
- Unravelings and ultra-properties
- Computationally Equivalent Elimination of Conditions
- POLYNOMIALLY BOUNDED MATRIX INTERPRETATIONS
- Modular Complexity Analysis for Term Rewriting
- Characterizing and proving operational termination of deterministic conditional term rewriting systems
- A rationale for conditional equational programming
- Context-sensitive rewriting strategies
- On tree automata that certify termination of left-linear term rewriting systems
- Title not available (Why is that?)
- Elimination of conditions
- Title not available (Why is that?)
- Proving Termination of Programs Automatically with AProVE
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- Determinization of conditional term rewriting systems
- Simplifying conditional term rewriting systems: Unification, termination and confluence
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors
- Conditional term rewriting and first-order theorem proving
- Title not available (Why is that?)
- Complexity analysis of term-rewriting systems
- Applications and extensions of context-sensitive rewriting
- Title not available (Why is that?)
Uses Software
This page was built for publication: Complexity of conditional term rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980968)
