Research map / Learning theory and algorithms / Prediction and decision losses
Answering Queries with Negation over Existential Rules
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Query Answering with Inconsistent Existential Rules under Stable Model Semantics (AAAI 2016 · similarity 0.91)
- Consistent Query Answering over Existential Rules with Open and Closed Predicates (AAAI 2025 · similarity 0.90)
- Characterizing the Program Expressive Power of Existential Rule Languages (AAAI 2022 · similarity 0.90)
- Answering Conjunctive Queries with Safe Negation and Inequalities over RDFS Knowledge Bases (AAAI 2025 · similarity 0.90)
- Goal-Driven Query Answering for Existential Rules With Equality (AAAI 2018 · similarity 0.90)
- A Foundation Model for Zero-shot Logical Query Reasoning (NeurIPS 2024 · similarity 0.87)
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.
