Logical separability of labeled data examples under ontologies
type: Item
instance of: scholarly article
title: Logical separability of labeled data examples under ontologies
author: Jean Christoph Jung
author: Carsten Lutz
author: Hadrien Pulcini
author: F. Wolter
published in: Artificial Intelligence
publication date: 2022-11-08T00:00:00Z
full work available at URL: https://arxiv.org/abs/2007.01610
Mathematics Subject Classification ID: 68Txx
zbMATH DE Number: 7613163
zbMATH Keywords: logical separability
zbMATH Keywords: decidable fragments of first-order logic
zbMATH Keywords: description logic
zbMATH Keywords: learning from examples
zbMATH Keywords: complexity
zbMATH Keywords: ontologies
describes a project that uses: DL-learner
MaRDI profile type: Publication
OpenAlex ID: W4297860799
cites work: Q4537963
cites work: Ideal Downward Refinement in the $\mathcal{EL}$ Description Logic
cites work: Concept learning in description logics using refinement operators
cites work: Learning in Description Logics with Fuzzy Concrete Domains
cites work: DL-FOIL Concept Learning in Description Logics
cites work: Q4636969
cites work: A Model+Solver Approach to Concept Learning
cites work: Reasoning and revision in hybrid representation systems
cites work: The Exact Complexity of the First-Order Logic Definability Problem
cites work: Q3174895
cites work: Q4864249
cites work: Modal languages and bounded fragments of predicate logic
cites work: On the Restraining Power of Guards
cites work: Q4266483
cites work: Guarded negation
cites work: On the Decision Problem for Two-Variable First-Order Logic
cites work: Q4406531
cites work: An Introduction to Description Logic
cites work: Elements of finite model theory.
cites work: SOME MODEL THEORY OF GUARDED NEGATION
cites work: On languages with two variables
cites work: Testing containment of conjunctive queries under functional and inclusion dependencies
cites work: On the finite controllability of conjunctive query answering in databases under open-world assumption
cites work: Querying the Guarded Fragment
cites work: The Complexity of Conjunctive Query Answering in Expressive Description Logics
cites work: Dichotomies in Ontology-Mediated Querying with the Guarded Fragment
cites work: The Freedoms of (Guarded) Bisimulation
cites work: The undecidability of the domino problem
cites work: Remarks on Berger's paper on the domino problem
cites work: Q5691140
cites work: Data-complexity of the two-variable fragment with counting quantifiers
cites work: Ontology-Based Data Access
cites work: Conservative Extensions in Guarded and Two-Variable Fragments.
cites work: Query inseparability for \(\mathcal{ALC}\) ontologies
cites work: Q4348133
DOI: 10.1016/J.ARTINT.2022.103785
description: scientific article; zbMATH DE number 7613163