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

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Automated theorem proving by resolution in non-classical 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. (2003). Automated theorem proving by resolution in non-classical logics. In Fourth International Conference Journees de l'Informatique Messine: Knowledge Discovery and Discrete Mathematics (JIM-03) (pp. 151-167). Domaine de Voulceau - Rocquencourt, France: INRIA.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-2C55-1
Abstract
We present several classes of non-classical logics (many of which are practically relevant in knowledge representation) which can be translated into tractable and relatively simple fragments of classical logic. In this context, refinements of resolution can be often used successfully for automated theorem proving, and in many cases yield optimal decision procedures.