A Completion Method to Decide Reachability in Rewrite Systems
From MaRDI portal
Publication:2964463
DOI10.1007/978-3-319-24246-0_13zbMATH Open1471.68105OpenAlexW2237226913MaRDI QIDQ2964463FDOQ2964463
Gilles Dowek, Ying Jiang, Guillaume Burel
Publication date: 27 February 2017
Published in: Frontiers of Combining Systems (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01252138/file/pkb.pdf
Recommendations
- Completion of rewrite systems with membership constraints
- Term Rewriting and Applications
- scientific article
- Reachability analysis over term rewriting systems
- On the reachability of a version of graph-rewriting system
- Completion for constrained term rewriting systems
- Reachability in conditional term rewriting systems
- Completion of rewrite systems with membership constraints. I: Deduction rules
- scientific article
- Completion of rewrite systems with membership constraints. II: Constraint solving
Cites Work
- Title not available (Why is that?)
- Proving termination with multiset orderings
- Title not available (Why is that?)
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Completion of a Set of Rules Modulo a Set of Equations
- Polarized Resolution Modulo
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- Completion of rewrite systems with membership constraints
- Completion of rewrite systems with membership constraints. I: Deduction rules
- Completeness of rewrite rules and rewrite strategies for FP
- Completeness of Conversion between Reactive Programs for Ultrametric Models
- Existence, Uniqueness, and Construction of Rewrite Systems
- Title not available (Why is that?)
- Constructing Rewrite-Based Decision Procedures for Embeddings and Termination
This page was built for publication: A Completion Method to Decide Reachability in Rewrite Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2964463)
