PulseAugur
LIVE 10:07:36
tool · [1 source] ·
2
tool

New logic ELbotpreceq extends DL-Lite for graph query languages

Researchers have introduced ELbotpreceq, a new description logic that extends DL-Lite and supports reasoning in NL. This logic is designed to be rewritable into graph query languages, addressing the limitations of existing DL-Lite systems which are restricted to first-order queries. ELbotpreceq incorporates a stratification mechanism to manage conjunction and recursion, enabling it to express many ELI and DL-Lite ontologies while maintaining NL upper bounds. AI

Summary written by gemini-2.5-flash-lite from 1 source. How we write summaries →

IMPACT Extends expressive power for ontology-mediated query answering, potentially enabling more complex graph data querying.

RANK_REASON Academic paper introducing a new logic and its properties. [lever_c_demoted from research: ic=1 ai=1.0]

Read on arXiv cs.AI →

COVERAGE [1]

  1. arXiv cs.AI TIER_1 · Magdalena Ortiz ·

    A Horn extension of DL-Lite with NL data complexity

    The literature on ontology-mediated query answering (OMQA) has been shaped by two key results: first-order rewritability for DL-Lite, and PTime-hardness of data complexity for essentially every description logic beyond it. This has effectively positioned DL-Lite as the only pract…