Resolution-Based Theorem Proving for SHn-Logics

  • Viorica Sofronie-Stokkermans
Conference paper

DOI: 10.1007/3-540-46508-1_18

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1761)
Cite this paper as:
Sofronie-Stokkermans V. (2000) Resolution-Based Theorem Proving for SHn-Logics. In: Caferra R., Salzer G. (eds) Automated Deduction in Classical and Non-Classical Logics. Lecture Notes in Computer Science, vol 1761. Springer, Berlin, Heidelberg

Abstract

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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