Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems

DOI10.4230/LIPIcs.FSCD.2018.26zbMath1462.68097OpenAlexW2886482294MaRDI QIDQ4993358

Yuya Maeda, Naoki Nishida

Publication date: 15 June 2021

Full work available at URL: https://doi.org/10.4230/LIPIcs.FSCD.2018.26

zbMATH Keywords

conditional term rewritingregular tree grammarinnermost narrowing

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Automatically Proving and Disproving Feasibility Conditions

Uses Software

• Conditional Confluence
• CO3

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sufficient completeness verification for conditional and constrained TRS
• Operational termination of conditional term rewriting systems
• On sufficient-completeness and related properties of term rewriting systems
• Completeness results for basic narrowing
• Automatic synthesis of logical models for order-sorted first-order theories
• Reversible computation in term rewriting
• Determinization of conditional term rewriting systems
• A framework for computing finite SLD trees
• Computing More Specific Versions of Conditional Rewriting Systems
• Unravelings and ultra-properties
• A Finite Representation of the Narrowing Space
• Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
• Reachability in Conditional Term Rewriting Systems
• Level-confluence of conditional rewrite systems with extra variables in right-hand sides
• Conditional Confluence (System Description)
• Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems
• Program Inversion for Tail Recursive Functions

This page was built for publication: Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems