Skip to main content
SpringerLink
Log in

Note on resolution circuits

  • Communications
  • Conference paper
  • First Online:
Methodologies for Intelligent Systems (ISMIS 1991)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 542))

Included in the following conference series:

  • 173 Accesses

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 to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Grätzer, G. (1968). Universal Algebra. Van Nostrand.

    Google Scholar 

  2. Murray, N. (1982). Completely Non-Clausal Theorem Proving. Artificial Intelligence 18, 67–85.

    Google Scholar 

  3. Post, E. (1921). Introduction to a General Theory of Elementary Propositions. American Journal of Mathematics 43, 163–185.

    Google Scholar 

  4. Stachniak, Z. (1991). Extending Resolution to Resolution Logics. Journal of Experimental and Theoretical Artificial Intelligence 3, 17–32.

    Google Scholar 

  5. Stachniak, Z. (1991). Minimization of Resolution Proof Systems. Fundamenta Informaticae 14, 129–146.

    Google Scholar 

  6. Stachniak, Z. (1991). Resolution Approximation of First-Order Logics, to appear in Information and Computation.

    Google Scholar 

  7. 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.

    Google Scholar 

  8. 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.

    Google Scholar 

  9. Wójcicki, R. (1988). Theory of Logical Calculi: Basic Theory of Consequence Operations. Kluwer Academic Publishers.

    Google Scholar 

  10. Zygmunt, J. (1983). An Application of the Lindenbaum Method in the Domain of Strongly Finite Sentential Calculi. Acta Universitatis Wratislaviensis 517, pp. 59–68.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, York University, M3J 1P3, North York, Ontario, Canada

    Zbigniew Stachniak

Authors
  1. Zbigniew Stachniak
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Z. W. Ras M. Zemankova

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation