Skip to main content
SpringerLink
Log in

Note on effective constructibility of resolution proof systems

  • Selected Papers
  • Conference paper
  • First Online:
Logics in AI (JELIA 1990)

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

Included in the following conference series:

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.

4 References

  1. Grigolia, R. (1977). Algebraic Analysis of Lukasiewicz-Tarski's n-valued Logical Systems. In Selected Papers on Lukasiewicz Sentential Calculi (R. Wójcicki, ed.), 81–92.

    Google Scholar 

  2. Loś, J. (1949). O Matrycach Logicznych. Travaux de la Société des Sciences et des Lettres de Wroclaw, B 19, Wroclaw.

    Google Scholar 

  3. Lukasiewicz, J. and Tarski, A. (1930) Untersuchungen ”uber den Aussagenkalkül. Comptes Rendus des S'eances de la Société des Sciences et des Lettres de Varsovie, 23: 30–50.

    Google Scholar 

  4. Manna, Z., Waldinger, R. (1986). Special Relations in Automated Deduction. JACM, 33: 1–59.

    Google Scholar 

  5. Malinowski, G. (1977). S-Algebras for n-valued Sentential Calculi of Lukasiewicz. In Selected Papers on Lukasiewicz Sentential Calculi (R. Wójcicki, ed.): 149–159.

    Google Scholar 

  6. McKinsey, J., Tarski, A. (1948). Some Theorems About the Lewis and Heyting Calculi. The Journal of Symbolic Logic, 13: 1–15.

    Google Scholar 

  7. McNaughton, R. (1951). A Theorem About Infinite-Valued Sentential Logic. The Journal of Symbolic Logic, 16: 1–13.

    Google Scholar 

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

    Google Scholar 

  9. Rescher, N. (1969). Many-Valued Logics. McGraw-Hill.

    Google Scholar 

  10. Rosser, J., Turquette, A. (1958). Many-Valued Logics. North-Holland.

    Google Scholar 

  11. Stachniak, Z. (1990). Resolution Proof Systems with Weak Transformation Rules. Proceedings of the International Symposium on Symbolic and Algebraic Computation, Tokyo: 38–43.

    Google Scholar 

  12. Stachniak, Z. (1990). Extending Resolution to Resolution Logics. To appear in The Journal of Experimental and Theoretical Artificial Intelligence.

    Google Scholar 

  13. Stachniak, Z. (1990). Resolution Approximation of First-Order Logics. To appear in Information and Computation.

    Google Scholar 

  14. Stachniak, Z. (1989). Minimization of Resolution Proof Systems. To appear in Fundamenta Informaticae.

    Google Scholar 

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

    Google Scholar 

  16. Tokarz, M. (1977). A Remark on Maximal Matrix Consequences. Bulletin of the Section of Logic, PAN, 6: 190–192.

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Z. Stachniak

Authors
  1. Z. Stachniak
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. van Eijck

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stachniak, Z. (1991). Note on effective constructibility of resolution proof systems. In: van Eijck, J. (eds) Logics in AI. JELIA 1990. Lecture Notes in Computer Science, vol 478. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018461

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53686-4

  • Online ISBN: 978-3-540-46982-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation