You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

Minimization of Resolution Proof Systems

Article type: Research Article

Authors: Stachniak, Zbigniew; *

Affiliations: Department of Computer Science, York University, North York, ONT M3J 1P3, Canada

Note: [*] Research supported by the Natural Sciences and Engineering Research Council of Canada under grant A9136.

Abstract: In this paper we show that minimal resolution counterparts of strongly finite logics can be effectively constructed. Moreover, we show that the class of resolution counterparts of structural propositional logics coincides with the class of resolution counterparts of strongly finite logics.

DOI: 10.3233/FI-1991-14107

Journal: Fundamenta Informaticae, vol. 14, no. 1, pp. 129-146, 1991

Published: 1 January 1991
Price: EUR 27.50
Show more