Answering Regular Path Queries Over SQ Ontologies

November 17, 2020 · The Ethereal · 🏛 AAAI Conference on Artificial Intelligence

🔮 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 Víctor Gutiérrez-Basulto, Yazmín Ibáñez-García, Jean Christoph Jung arXiv ID 2011.08816 Category cs.LO: Logic in CS Cross-listed cs.AI Citations 9 Venue AAAI Conference on Artificial Intelligence Last Checked 1 month ago
Abstract
We study query answering in the description logic $\mathcal{SQ}$ supporting qualified number restrictions on both transitive and non-transitive roles. Our main contributions are a tree-like model property for $\mathcal{SQ}$ knowledge bases and, building upon this, an optimal automata-based algorithm for answering positive existential regular path queries in 2ExpTime.
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