Skip to main content
SpringerLink
Log in

An essay on resolution logics

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

This paper discusses the resolution principle in the context of non-classical logics.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

  2. J. Hopcroft andJ. Ullman,Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.

  3. J. Lukasiewicz,Logika dwuwartościowa (Two-valued Logic),Przeglad Filozoficzny,23 (1921), pp. 189–205.

    Google Scholar 

  4. Z. Manna andR. Waldinger,Special Relations in Automated Deduction,Journal of the ACM,33 (1986), pp. 1–59.

    Google Scholar 

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

    Google Scholar 

  6. J. A. Robinson,A Machine-Oriented Logic Based on the Resolution Principle,Journal of ACM,12 (1965), pp. 23–41.

    Google Scholar 

  7. J. Słupecki,St. Leśniewski's Protothetics,Studia Logica,3 (1953), pp. 7–76.

    Google Scholar 

  8. Z. Stachniak,Resolution Approximation of First-Order Logics,Information and Computation,96 (1992), pp. 225–244.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  11. Z. Stachniak,Note on Effective Constructibility of Resolution Proof Systems,Proceedings of European Workshop on Logic in AI, Amsterdam,Lecture Notes in Artificial Intelligence,478 (1990), pp. 487–498.

    Google Scholar 

  12. Z. Stachniak,Resolution Rule: An Algebraic Perspective,Proceedings of Algebraic Logic and Universal Algebra in Computer Science Conference, Ames,Lecture Notes in Computer Science,425 (1988), pp. 227–242.

    Google Scholar 

  13. Z. Stachniak andP. O'Hearn,Resolution in the Domain of Strongly Finite Logics,Fundamenta Informaticae 13 (1990), pp. 333–351.

    Google Scholar 

  14. J. Srzednicki andZ. Stachniak,S. Leśniewski's Lecture Notes in Logic. Kluwer Academic Publishers, Dordrecht/Boston/London 1988.

    Google Scholar 

  15. R. Wójcicki,Theory of Logical Calculi: Basic Theory of Consequence Operations. Kluwer Academic Publishers, Dordrecht/Boston/London 1988.

    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

Additional information

Research supported by the grant from Natural Sciences and Engineering Research Council of Canada.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stachniak, Z. An essay on resolution logics. Stud Logica 52, 309–322 (1993). https://doi.org/10.1007/BF01058394

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01058394

Keywords

Search

Navigation