On the relation of resolution and tableaux proof systems for description logics

Hustadt, Ullrich; Schmidt, Renate A.

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

On the relation of resolution and tableaux proof systems for description logics

MPS-Authors

/persons/resource/persons44660

Hustadt, Ullrich
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45401

Schmidt, Renate A.
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

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.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-3679-3

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.