{"type":"ScholarlyArticle","title":"A Superposition Oriented Theorem Prover","authors":[{"name":"Laurent Fribourg","slug":"laurent-fribourg","given":"Laurent","family":"Fribourg","affiliation":""}],"abstract":"A theorem proving procedure is described which combines the approach of locking resolution with that of rewriting systems. Indeed, both the binary resolution and a complete restriction of paramodulation are embodied by an extension of the rewriting operation called superposition. Experimental results are reported and compared with literature automated proofs.","doi":null,"url":"https://ijcai.org/proceedings/1983/217","pdf":"https://ijcai.org/proceedings/1983/0217.pdf","markdown":"https://ijcai.org/proceedings/1983/217.md","bibtex":"https://ijcai.org/proceedings/1983/bibtex/217","volume":{"slug":"1983","title":"Proceedings of the Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1983","url":"https://ijcai.org/proceedings/1983/","year":1983,"location":"Karlsruhe, West Germany","dates":"","editors":"Alan Bundy","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Theorem Proving","track":"Theorem Proving","number":217,"pages":{"first":923,"last":924},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}