Linkless normal form for ALC concepts and TBoxes

Authors:
Claudia Schon
Affiliations:
University of Koblenz-Landau, Germany
Venue:
KI'11 Proceedings of the 34th Annual German conference on Advances in artificial intelligence
Year:
2011

Citing 13
Cited 0

Dissolution: making paths vanish

Journal of the ACM (JACM)
Knowledge compilation and theory approximation

Journal of the ACM (JACM)
Decomposable negation normal form

Journal of the ACM (JACM)
Computing Least Common Subsumers in Description Logics with Existential Restrictions

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Comparison of Theorem Provers for Modal Logics - Introduction and Summary

TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Basic description logics

The description logic handbook
Implementation and optimization techniques

The description logic handbook
The Description Logic Handbook

The Description Logic Handbook
Prime implicates and prime implicants in modal logic

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
A knowledge compilation map

Journal of Artificial Intelligence Research
Forgetting and uniform interpolation in large-scale description logic terminologies

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Concept and Role Forgetting in ${\mathcal {ALC}}$ Ontologies

ISWC '09 Proceedings of the 8th International Semantic Web Conference
FaCT++ description logic reasoner: system description

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce a normal form for ALC concepts and TBoxes called linkless normal form. We investigate properties of concepts given in this normal form such as an efficient satisfiability test and the calculation of uniform interpolants. We further show a way to approximate a TBox by a concept in linkless normal form, which allows us to check certain subsumptions efficiently. This makes the linkless normal form interesting from the viewpoint of knowledge compilation. Furthermore, we show how to use the approximation of a TBox in linkless normal form to efficiently construct an approximation of a uniform interpolant of a TBox w.r.t. a given signature.