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

Authors: Bartosz Bednarczyk, Emanuel Kieroński5487-5494

AAAI 2022 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical Our main result is that the DLs ZOQ and ZOI are finitely controllable, i.e. that their finite and unrestricted entailment problems for local queries coincide. This allows us to reuse recently established upper bounds on querying these logics under the classical semantics. While we will not solve finite query entailment for the third main logic in the Z family, ZIQ, we provide a generic reduction from the finite entailment problem to the finite KBSat problem, working for ZIQ and some of its sublogics. Our proofs unify and solidify previously established results on finite satisfiability and finite query entailment for many known DLs.
Researcher Affiliation Academia Bartosz Bednarczyk,1,2 Emanuel Kiero nski2 1 Computational Logic Group, TU Dresden 2 University of Wrocław, Faculty of Mathematics and Computer Science { bartosz.bednarczyk, emanuel.kieronski }@cs.uni.wroc.pl
Pseudocode No The paper does not contain structured pseudocode or algorithm blocks.
Open Source Code No The paper does not provide any information about open-source code for the described methodology.
Open Datasets No This is a theoretical paper and does not involve datasets, training, or empirical evaluation.
Dataset Splits No This is a theoretical paper and does not involve dataset splits for validation or training.
Hardware Specification No This is a theoretical paper and does not describe any experimental hardware specifications.
Software Dependencies No This is a theoretical paper and does not describe any specific software dependencies with version numbers.
Experiment Setup No This is a theoretical paper and does not describe any experimental setup details such as hyperparameters or training configurations.