Resolution-Based Theorem Proving for SHn-Logics

  • Viorica Sofronie-Stokkermans
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1761)


In this paper we illustrate by means of an example, namely SH n-logics, a method for translation to clause form and automated theorem proving for first-order many-valued logics based on distributive lattices with operators.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. AB70.
    R. Anderson and W. Bledsoe. A linear format for resolution with merging and a new technique for establishing completeness. Journal of the ACM, 17:525–534, 1970.MATHCrossRefMathSciNetGoogle Scholar
  2. BF95.
    M. Baaz and C.G. Fermüller. Resolution-based theorem proving for manyvalued logics. Journal of Symbolic Computation, 19:353–391, 1995.MATHCrossRefMathSciNetGoogle Scholar
  3. DP90.
    B.A. Davey and H.A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 1990.Google Scholar
  4. GSS99.
    H. Ganzinger and V. Sofronie-Stokkermans. Chaining calculi and resolutionbased theorem proving in many-valued logic. In preparation, 1999.Google Scholar
  5. Häh94.
    R. Hähnle. Short conjunctive normal forms in finitely valued logics. Journal of Logic and Computation, 4(6):905–927, 1994.MATHCrossRefMathSciNetGoogle Scholar
  6. Häh96.
    R. Hähnle. Exploiting data dependencies in many-valued logics. Journal of Applied Non-Classical Logics, 6(1):49–69, 1996.MATHMathSciNetGoogle Scholar
  7. Häh98.
    R. Hähnle. Commodious axiomatization of quantifiers in multiple-valued logic. Studia Logica, 61(1):101–121, 1998.MATHCrossRefMathSciNetGoogle Scholar
  8. IO96.
    L. Iturrioz and E. Orłowska. A Kripke-style and relational semantics for logics based on Lukasiewicz algebras. Conference in honour of J. Lukasiewicz, Dublin, 1996.Google Scholar
  9. Itu82.
    L. Iturrioz. Modal operators on symmetrical Heyting algebras. In T. Traczyk, editor, Universal Algebra and Applications, Banach Center Publications, Vol. 9, pages 289–303. PWN-Polish Scientific Publishers, 1982.Google Scholar
  10. Itu83.
    L. Iturrioz. Symmetrical Heyting algebras with operators. Zeitschrift f. math. Logik und Grundlagen d. Mathematik, 29:33–70, 1983.MATHCrossRefMathSciNetGoogle Scholar
  11. Sal96.
    G. Salzer. Optimal axiomatizations for multiple-valued operators and quantifiers based on semilattices. In M. McRobbie and J. Slaney, editors, Proc. 13th Conference on Automated Deduction, New Brunswick/NJ, USA, LNCS 1104, pages 688–702. Springer Verlag, 1996.Google Scholar
  12. Sco73.
    D.S. Scott. Background to formalization. In H. Leblanc, editor, Truth, Syntax and Modality. Proceedings of the Temple University Conference on Alternative Semantics, Studies in Logic and the Foundations of Mathematics, Vol. 68, pages 244–273, 1973.Google Scholar
  13. SS97.
    V. Sofronie-Stokkermans. Fibered Structures and Applications to Automated Theorem Proving in Certain Classes of Finitely-Valued Logics and to Modeling Interacting Systems. PhD thesis, RISC-Linz, J.Kepler University Linz, Austria, 1997.Google Scholar
  14. SS98.
    V. Sofronie-Stokkermans. On translation of finitely-valued logics to classical first-order logic. In H. Prade, editor, Proceedings of ECAI 98, pages 410–411. John Wiley & Sons, 1998.Google Scholar
  15. SS99a.
    V. Sofronie-Stokkermans. Automated theorem proving by resolution for finitely-valued logics based on distributive lattices with operators. Submitted, 1999.Google Scholar
  16. SS99b.
    V. Sofronie-Stokkermans. Priestley duality for SHn-algebras and applications to the study of Kripke-style models for SHn-logics. Multiple-Valued Logic — An International Journal, To appear, 1999.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Viorica Sofronie-Stokkermans
    • 1
  1. 1.Max-Planck-Institut für InformatikSaarbrückenGermany

Personalised recommendations