Statistical EL is ExpTime-complete

November 02, 2019 · The Ethereal · 🏛 Information Processing Letters

🔮 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 Bartosz Bednarczyk arXiv ID 1911.00696 Category cs.LO: Logic in CS Cross-listed cs.AI Citations 1 Venue Information Processing Letters Last Checked 5 months ago
Abstract
We show that the consistency problem for Statistical EL ontologies, defined by Pe{ñ}aloza and Potyka, is ExpTime-hard. Together with existing ExpTime upper bounds, we conclude ExpTime-completeness of the logic. Our proof goes via a reduction from the consistency problem for EL extended with negation of atomic concepts.
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