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

Hustadt, Ullrich; Schmidt, Renate A.

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

Download BibTeX Cite

Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 110-116.

Abstract

This paper investigates the relationship between resolution and tableaux proof system for the satisfiability of general knowledge bases in the description logic A.CC. 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.

Ullrich Hustadt, and Renate A. Schmidt. 1999. On the Relation of Resolution and Tableaux Proof Systems for Description Logics. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99. IJCAI, 110–116. https://ijcai.org/proceedings/1999/17

@inproceedings{ijcai1999p17,
  title     = {On the Relation of Resolution and Tableaux Proof Systems for Description Logics},
  author    = {Hustadt, Ullrich and Schmidt, Renate A.},
  booktitle = {Proceedings of the Sixteenth International Joint Conference on
               Artificial Intelligence, {IJCAI-99}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Thomas Dean},
  pages     = {110--116},
  year      = {1999},
  note      = {Automated Reasoning},
  url       = {https://ijcai.org/proceedings/1999/17},
}

TY  - CPAPER
TI  - On the Relation of Resolution and Tableaux Proof Systems for Description Logics
AU  - Hustadt, Ullrich
AU  - Schmidt, Renate A.
T2  - Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1999
SP  - 110
EP  - 116
UR  - https://ijcai.org/proceedings/1999/17
ER  -