English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Automated theorem proving by resolution in non-classical logics

MPS-Authors
/persons/resource/persons45516

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

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
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: https://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.