atlas

Research map / Learning theory and algorithms / Sample complexity

Consistent Query Answering over Existential Rules with Open and Closed Predicates

AAAI 2025 · Learning theory and algorithms › Sample complexity · approach: Computational thresholds in graphs and structure · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes a consistent query answering framework over existential rule knowledge bases that mixes open- and closed-world predicates, and establishes data complexity for unions of conjunctive queries in this setting.

Problem

Consistent query answering over knowledge bases with existential rules where some predicates are open-world and others closed-world; the body text provided is only the ACM acmart template, so the actual results are unavailable.

Approach

Combines prior CQA approaches so that open and closed predicates can coexist in one knowledge base with existential rules, enabling mixed-assumption query answering.

Key results

Limitations

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy