de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Resolution-based theorem proving for SHn-logics

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45516

Sofronie-Stokkermans,  Viorica
Automation of Logic, MPI for Informatics, Max Planck Society;
Programming Logics, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Sofronie-Stokkermans, V. (2000). Resolution-based theorem proving for SHn-logics. In Automated Deduction in Classical and Non-Classical Logic (Selected Papers of FTP'98) (pp. 268-282). Berlin, Germany: Springer.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-3462-5
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.