English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Resolution-Based Decision Procedures for Subclasses of First-Order Logic

Hustadt, U. (1999). Resolution-Based Decision Procedures for Subclasses of First-Order Logic. PhD Thesis, Universität des Saarlandes, Saarbrücken.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Hustadt, Ullrich1, Author           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 Abstract: This thesis studies decidable fragments of first-order logic which are relevant to the field of non-classical logic and knowledge representation. We show that refinements of resolution based on suitable liftable orderings provide decision procedures for the subclasses $\CE^+$, $\overline{\mathrm{K}}$, and $\overline{\mathrm{DK}}$ of first-order logic. By the use of semantics-based translation methods we can embed the description logic $\mathcal{ALCR}$ and extensions of the basic modal logic $\mathsf{K}$ into fragments of first-order logic. We describe various decision procedures based on ordering refinements and selection functions for these fragments and show that a polynomial simulation of tableaux-based decision procedures for these logics is possible. In the final part of the thesis we develop a benchmark suite and perform an empirical analysis of various modal theorem provers.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-121999-11-081999
 Publication Status: Issued
 Pages: -
 Publishing info: Saarbrücken : Universität des Saarlandes
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 519730
Other: Local-ID: C1256104005ECAFC-3C4F8D74A0A484FFC125675A005CF7E5-Hustadt1999
 Degree: PhD

Event

show

Legal Case

show

Project information

show

Source

show