New research explores query answering complexity over knowledge bases

This paper delves into the computational complexity of answering navigational queries over knowledge bases augmented with ontologies. Researchers analyzed two-way regular path queries (CRPQ) and conjunctive regular path queries (CRPQ) against ontologies defined by guarded existential rules. For linear existential rules, data complexity was found to be NL-complete, while combined complexity ranged from PTime-complete to ExpTime-complete depending on predicate arity. AI

IMPACT This research contributes to the theoretical underpinnings of knowledge base querying, potentially impacting future AI systems that rely on complex data retrieval and reasoning.

RANK_REASON The item is an academic paper published on arXiv detailing theoretical research into computational complexity. [lever_c_demoted from research: ic=1 ai=1.0]

Read on arXiv cs.AI →

• 2ExpTime-complete
• alphaXiv
• Answering Path Queries under Linear and Guarded Existential Rules
• arXiv
• CatalyzeX Code Finder for Papers
• Connected Papers
• CORE Recommender
• DagsHub
• ExpTime-complete
• Gotit.pub
• Hugging Face
• Litmaps
• NL-complete
• PSPACE-complete
• PTime-complete
• ScienceCast
• scite Smart Citations

• paper
• other

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →