Abstract
In this paper we continue the study of the class of resolution logics initiated in [4–8]. The main result reported in the paper shows that there exists an effective method of associating with every resolution logic \(\mathcal{P}\)an AND-OR network \(\Re\)of resolution proof systems which is refutationally equivalent to \(\mathcal{P}\). Such AND-OR networks offer an attractive automated theorem proving representation for many resolution logics whose minimal resolution counterparts are much too big to be efficiently implemented.
This research was supported by the grant from Natural Sciences and Engineering Research Council of Canada.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Grätzer, G. (1968). Universal Algebra. Van Nostrand.
Murray, N. (1982). Completely Non-Clausal Theorem Proving. Artificial Intelligence 18, 67–85.
Post, E. (1921). Introduction to a General Theory of Elementary Propositions. American Journal of Mathematics 43, 163–185.
Stachniak, Z. (1991). Extending Resolution to Resolution Logics. Journal of Experimental and Theoretical Artificial Intelligence 3, 17–32.
Stachniak, Z. (1991). Minimization of Resolution Proof Systems. Fundamenta Informaticae 14, 129–146.
Stachniak, Z. (1991). Resolution Approximation of First-Order Logics, to appear in Information and Computation.
Stachniak, Z. (1990). Note on Effective Constructibility of Resolution Proof Systems. Proceedings of the European Workshop on Logics in AI, JELIA ′90, Amsterdam, Lecture Notes in Artificial Intelligence 478, 487–498.
Stachniak, Z. (1988). Resolution Rule: An Algebraic Perspective. Proceedings of Algebraic Logic and Universal Algebra in Computer Science Conference, Ames, Lecture Notes in Computer Science 425, 227–242.
Wójcicki, R. (1988). Theory of Logical Calculi: Basic Theory of Consequence Operations. Kluwer Academic Publishers.
Zygmunt, J. (1983). An Application of the Lindenbaum Method in the Domain of Strongly Finite Sentential Calculi. Acta Universitatis Wratislaviensis 517, pp. 59–68.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stachniak, Z. (1991). Note on resolution circuits. In: Ras, Z.W., Zemankova, M. (eds) Methodologies for Intelligent Systems. ISMIS 1991. Lecture Notes in Computer Science, vol 542. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54563-8_125
Download citation
DOI: https://doi.org/10.1007/3-540-54563-8_125
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54563-7
Online ISBN: 978-3-540-38466-3
eBook Packages: Springer Book Archive