Resolution-Based Theorem Proving for SHn-Logics
- First Online:
- 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
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.
Unable to display preview. Download preview PDF.