Complexity of the Description Logic ALCM
Monica Martinez, Edelweis Rohrer, Paula Severi
TL;DR
This paper proves that checking the consistency of knowledge bases in the Description Logic ALCM, which includes meta-modelling, is an ExpTime-complete problem, extending existing algorithms for ALC.
Contribution
It establishes the complexity of ALCM and develops an ExpTime Tableau algorithm for its consistency checking.
Findings
Consistency checking in ALCM is ExpTime-complete
Extended existing ALC algorithms to ALCM
Provided an algorithm for practical consistency verification
Abstract
In this paper we show that the problem of checking consistency of a knowledge base in the Description Logic ALCM is ExpTime-complete. The M stands for meta-modelling as defined by Motz, Rohrer and Severi. To show our main result, we define an ExpTime Tableau algorithm as an extension of an algorithm for checking consistency of a knowledge base in ALC by Nguyen and Szalas.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSemantic Web and Ontologies · Logic, Reasoning, and Knowledge · Natural Language Processing Techniques