Automated Deduction in Classical and Non-Classical Logics

Volume 1761 of the series Lecture Notes in Computer Science pp 267-281


Resolution-Based Theorem Proving for SH n-Logics

  • Viorica Sofronie-StokkermansAffiliated withMax-Planck-Institut für Informatik

* Final gross prices may vary according to local VAT.

Get Access


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.