首页    期刊浏览 2024年11月10日 星期日
登录注册

文章基本信息

  • 标题:Maximal Completion
  • 本地全文:下载
  • 作者:Dominik Klein ; Nao Hirokawa
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2011
  • 卷号:10
  • 页码:71-80
  • DOI:10.4230/LIPIcs.RTA.2011.71
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要:Given an equational system, completion procedures compute an equivalent and complete (terminating and confluent) term rewrite system. We present a very simple and efficient completion procedure, which is based on MaxSAT solving. Experiments show that the procedure is comparable to recent powerful completion tools.
  • 关键词:Term Rewriting; Knuth-Bendix Completion; Multi-completion
国家哲学社会科学文献中心版权所有