Determinization of conditional term rewriting systems
From MaRDI portal
Publication:1929232
DOI10.1016/J.TCS.2012.09.005zbMATH Open1253.68199OpenAlexW2123848106MaRDI QIDQ1929232FDOQ1929232
Masahiko Sakai, Toshiki Sakabe, Masanori Nagashima
Publication date: 7 January 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.09.005
Recommendations
- Characterizing and proving operational termination of deterministic conditional term rewriting systems
- Reachability in conditional term rewriting systems
- scientific article
- On soundness conditions for unraveling deterministic conditional rewrite systems
- scientific article; zbMATH DE number 1696594
- Complexity of conditional term rewriting
- Combinations of simplifying conditional term rewriting systems
- Conditional term rewriting and first-order theorem proving
- Confluence of terminating conditional rewrite systems revisited
- Dependency pairs for proving termination properties of conditional term rewriting systems
Cites Work
- Termination of term rewriting using dependency pairs
- Orderings for term-rewriting systems
- Unfold⧸fold transformation of general logic programs for the well-founded semantics
- Programming Languages and Systems
- Title not available (Why is that?)
- Operational termination of conditional term rewriting systems
- Conditional rewrite rules: Confluence and termination
- Soundness of unravelings for conditional term rewriting systems via ultra-properties related to linearity
- Unravelings and ultra-properties
- A Transformation System for Developing Recursive Programs
- Program Inversion for Tail Recursive Functions
- Completeness results for basic narrowing
- Rules + strategies for transforming lazy functional logic programs
- Verification of Erlang processes by dependency pairs
- Modularity of simple termination of term rewriting systems with shared constructors
- Equivalence-preserving first-order unfold/fold transformation systems
- A transformation system for deductive database modules with perfect model semantics
- Transforming constraint logic programs
- Transformations of CLP modules
- Term Rewriting and Applications
- Order-sorted completion: The many-sorted way
- Automatic Partial Inversion of Inductively Sequential Functions
- Program development in computational logic. A decade of research advances in logic-based program development.
- Constraint-based correctness proofs for logic program transformations
- BEYOND TAMAKI-SATO STYLE UNFOLD/FOLD TRANSFORMATIONS FOR NORMAL LOGIC PROGRAMS
- On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems
- A method for automatic program inversion based on LR(0) parsing
Cited In (12)
- Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems
- Characterizing Compatible View Updates in Syntactic Bidirectionalization
- Title not available (Why is that?)
- Inverse Unfold Problem and Its Heuristic Solving
- Semi-inversion of Conditional Constructor Term Rewriting Systems
- Conditional term rewriting and first-order theorem proving
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reversible computation in term rewriting
- Modular properties of conditional term rewriting systems
- Deterministic Caterpillar Expressions
- Determinization of inverted grammar programs via context-free expressions
Uses Software
This page was built for publication: Determinization of conditional term rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1929232)
