English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  On the relation of resolution and tableaux proof systems for description logics

Hustadt, U., & Schmidt, R. A. (1999). On the relation of resolution and tableaux proof systems for description logics. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99) (pp. 110-115). San Francisco, USA: Morgan Kaufmann.

Item is

Files

show Files

Locators

show

Creators

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

Content

show
hide
Free keywords: -
 Abstract: This paper investigates the relationship between resolution and tableaux proof system for the satisfiability of general knowledge bases in the description logic $\mathcal{ALC}$. We show that resolution proof systems can polynomially simulate their tableaux counterpart. Our resolution proof system is based on a selection refinement and utilises standard redundancy elimination criteria to ensure termination.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-121999
 Publication Status: Issued
 Pages: -
 Publishing info: San Francisco, USA : Morgan Kaufmann
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 519733
Other: Local-ID: C1256104005ECAFC-67A3E20E68980A97C125675A0061DA11-HustadtSchmidt99b
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Stockholm, Sweden
Start-/End Date: 1999

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99)
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: San Francisco, USA : Morgan Kaufmann
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 110 - 115 Identifier: ISBN: 1-55860-613-0