On the Relation of Resolution and Tableaux Proof Systems for Description Logics

Ullrich Hustadt, Renate A. Schmidt
1999 International Joint Conference on Artificial Intelligence  
This paper investigates the relationship between resolution and tableaux proof system for the satisfiability of general knowledge bases in the description logic We show that resolution proof systems can polynornially simulate their tableaux counterpart. Our resolution proof system is based on a selection refinement and utilises standard redundancy elimination criteria to ensure termination.
dblp:conf/ijcai/HustadtS99 fatcat:5ktpmhsdqzaedl2vh2awqt44du