Logo image
Back
Extending Maximal Completion
Conference proceeding   Open access   Peer reviewed

Extending Maximal Completion

Sarah Maria Winkler
Leibniz International Proceedings in Informatics, LIPIcs [4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019)], Vol.131, pp.1-15
131
4th International Conference on Formal Structures for Computation and Deduction (Dortmund, 24/06/2019 - 30/06/2019)
2019
DOI: https://doi.org/10.4230/LIPIcs.FSCD.2019.3
Handle:
https://hdl.handle.net/10863/43732

Abstract

Automated reasoning Completion Theorem proving
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.
pdf
LIPIcs.FSCD.2019.3505.31 kBDownloadView
Open Access
url
https://doi.org/10.4230/LIPIcs.FSCD.2019.3View

Details

Metrics

1 Record Views