Conditional Narrowing Modulo In Rewriting Logic And Maude
REWRITING LOGIC AND ITS APPLICATIONS, WRLA 2014(2014)
摘要
This work studies the relationship between verifiable and computable answers for reachability problems in rewrite theories with an underlying membership equational logic. These problems have the form(there exists(x) over bar) s((x) over bar) ->* t((x) over bar)with (x) over bar some variables, or a conjunction of several of these subgoals. A calculus that solves this kind of problems has been developed and proved correct. Given a reachability problem in a rewrite theory, this calculus can compute any normalized answer that can be checked by rewriting, or a more general one. Special care has been taken in the calculus to keep membership information attached to each term, using this information whenever possible.
更多查看译文
关键词
Maude,Narrowing,Reachability,Rewriting logic,Unification,Membership equational logic
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要