A Completion Method to Decide Reachability in Rewrite Systems
From MaRDI portal
(Redirected from Publication:2964463)
Recommendations
- Completion of rewrite systems with membership constraints
- Term Rewriting and Applications
- scientific article; zbMATH DE number 4164136
- 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; zbMATH DE number 3890721
- Completion of rewrite systems with membership constraints. II: Constraint solving
Cites work
- scientific article; zbMATH DE number 3928342 (Why is no real title available?)
- scientific article; zbMATH DE number 2043517 (Why is no real title available?)
- scientific article; zbMATH DE number 2086373 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- Completion of a Set of Rules Modulo a Set of Equations
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Polarized Resolution Modulo
- Proving termination with multiset orderings
Cited in
(7)- Constructing Rewrite-Based Decision Procedures for Embeddings and Termination
- 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
- scientific article; zbMATH DE number 4164136 (Why is no real title available?)
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)
