Complexity of the Description Logic ALCM

November 12, 2015 · The Ethereal · 🏛 International Conference on Principles of Knowledge Representation and Reasoning

🔮 THE ETHEREAL: The Ethereal
Pure theory — exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Monica Martinez, Edelweis Rohrer, Paula Severi arXiv ID 1511.03749 Category cs.LO: Logic in CS Cross-listed cs.AI Citations 5 Venue International Conference on Principles of Knowledge Representation and Reasoning Last Checked 5 months ago
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.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Logic in CS