Automated theorem proving by resolution in non-classical logics

Sofronie-Stokkermans, Viorica

doi:10.1007/s10472-007-9051-8

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

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;

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. (2007). Automated theorem proving by resolution in non-classical logics. Annals of Mathematics and Artificial Intelligence, 49(1-4), 221-252. doi:10.1007/s10472-007-9051-8.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-1E58-C

Abstract

This paper is an overview of a variety of results, all centered around a common theme, namely embedding of non-classical logics into first order logic and resolution theorem proving. We present several classes of non-classical logics, many of which are of great practical relevance in knowledge representation, which can be translated into tractable and relatively simple fragments of classical logic. In this context, we show that refinements of resolution can often be used successfully for automated theorem proving, and in many interesting cases yield optimal decision procedures.