atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Finite Entailment of Local Queries in the Z Family of Description Logics

AAAI 2022 · Learning theory and algorithms › Combinatorial and search optimization · approach: Logic and answer set programming theory · 6 citations (OpenAlex)

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.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Establish finite controllabilityZOQ and ZOI · Local queries (PEQs)finite versus unrestricted entailment: finite and unrestricted entailment problems ... coincideHelped
Construct finite countermodels by copying and linking finite patterns from quasi-forest modelsZOQ and ZOI · Local queries (PEQs)finite controllabilityHelped
Reduce finite PEQ entailment to finite KB satisfiabilityZIQ · Local queries (PEQs)reducibility: doubly exponentially many instancesHelped
Transform finite countermodels into locally treewidth-one modelsALCI∩Self ⊆ L ⊆ ZIQ · Finite modelslocal treewidth: agirth(J) ≥ GHelped
Extend finite-query reasoning from CQs to PEQsALC ⊆ L ⊆ ALCIHbSelfQ · Finite query entailmentcomplexity coverage: 2EXPTIME-completeHelped

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