Least General Generalizations in Description Logic: Verification and Existence

Authors: Jean Christoph Jung, Carsten Lutz, Frank Wolter2854-2861

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

Reproducibility Variable Result LLM Response
Research Type Theoretical Our focus is on the complexity of existence and verification, the latter meaning to decide whether a candidate concept is the LCS or MSC. We consider cases with and without a background TBox and a target signature. Our results range from CONP-complete for LCS and MSC verification in the description logic EL without TBoxes to undecidability of LCS and MSC verification and existence in ELI with TBoxes.
Researcher Affiliation Academia Jean Christoph Jung,1 Carsten Lutz,1 Frank Wolter2 1University of Bremen, Germany 2University of Liverpool, United Kingdom {jeanjung, clu}@uni-bremen.de, wolter@liverpool.ac.uk
Pseudocode No No structured pseudocode or algorithm blocks were found in the paper.
Open Source Code No The paper states: 'A full version that contains all proof details is available at http://www.informatik.uni-bremen.de/tdki/research/.' This link is for proof details, not the source code of the methodology.
Open Datasets No This is a theoretical paper and does not involve the use of datasets for training.
Dataset Splits No This is a theoretical paper and does not involve the use of datasets or their validation splits.
Hardware Specification No This is a theoretical paper and does not describe experiments that would require hardware specifications.
Software Dependencies No This is a theoretical paper and does not mention any specific software dependencies with version numbers.
Experiment Setup No This is a theoretical paper and does not describe any experimental setup details or hyperparameters.