A comparative study of several proof procedures

https://doi.org/10.1016/0004-3702(82)90024-8Get rights and content

Abstract

In this paper three algorithms for testing the complementarity of a matrix (representing a propositional formula) are developed in stages. Any of these algorithms is distinguished from its predecessor by a specific feature (linearity, jump, non-normal form) which endows it with a provable advantage w.r.t. its performance. For well-known proof procedures it is shown that they can be simulated by at least one of these algorithms which provides a hierarchy among several ATP-methods.

References (21)

There are more references available in the full text version of this article.

Cited by (16)

View all citing articles on Scopus

This work was performed while the author was on leave from the Institut für Informatik, Technische Universität München, München, W. Germany. Author's present address: Institut für Informatik, Technische Universität München, Arcisstrasse, 8000 München, W. Germany.

View full text