A Completion Method to Decide Reachability in Rewrite Systems

DOI10.1007/978-3-319-24246-0_13zbMath1471.68105OpenAlexW2237226913MaRDI QIDQ2964463

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

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polarized Resolution Modulo
• Completion of a Set of Rules Modulo a Set of Equations
• Proving termination with multiset orderings
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems