A Superposition Oriented Theorem Prover
Abstract
This paper describes a theorem proving procedure which combines the approach of Resolution with that of Rewriting. The basic-theoretical result is the completeness of a strong restriction of paramodulation for locking resolution procedures. Its oriented character suggests to consider the restricted paramodulation as a form of superposition (the Rewriting operation). This is achieved by means of a new formalism of clauses, named equational clauses, in which each literal is converted into an equation. Thereby, superposition on equational clauses is shown to embody not only paramodulation but also binary resolution; so clausal superposition will build up our major rule of inference. In addition, term simplification is incorporated in our procedure as well as subsumption. Experimental results and potential applications for our theorem prover are lastly reported.
Cite
Text
Fribourg. "A Superposition Oriented Theorem Prover." International Joint Conference on Artificial Intelligence, 1983. doi:10.1016/0304-3975(85)90011-8Markdown
[Fribourg. "A Superposition Oriented Theorem Prover." International Joint Conference on Artificial Intelligence, 1983.](https://mlanthology.org/ijcai/1983/fribourg1983ijcai-superposition/) doi:10.1016/0304-3975(85)90011-8BibTeX
@inproceedings{fribourg1983ijcai-superposition,
title = {{A Superposition Oriented Theorem Prover}},
author = {Fribourg, Laurent},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1983},
pages = {923-925},
doi = {10.1016/0304-3975(85)90011-8},
url = {https://mlanthology.org/ijcai/1983/fribourg1983ijcai-superposition/}
}