Resolution-based Theorem Proving for {SH}n-Logics

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