文章基本信息

标题：Extending Maximal Completion (Invited Talk)
本地全文：下载
作者：Sarah Winkler
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2019
卷号：131
页码：1-15
DOI：10.4230/LIPIcs.FSCD.2019.3
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：Maximal completion (Klein and Hirokawa 2011) is an elegantly simple yet powerful variant of Knuth-Bendix completion. This paper extends the approach to ordered completion and theorem proving as well as normalized completion. An implementation of the different procedures is described, and its practicality is demonstrated by various examples.
关键词：automated reasoning; completion; theorem proving