Pith. sign in

REVIEW

Complexity of the Description Logic ALCM

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1511.03749 v1 pith:HLI36KB4 submitted 2015-11-12 cs.LO cs.AI

Monica Martinez , Edelweis Rohrer , Paula Severi This is my paper · ORCID
classification cs.LOcs.AI
keywords alcmalgorithmbasecheckingconsistencydescriptionknowledgelogic
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Pith tools