Logical separability of labeled data examples under ontologies

DOI10.1016/j.artint.2022.103785OpenAlexW4297860799MaRDI QIDQ2093388

Hadrien Pulcini, Frank Wolter, Carsten Lutz, Jean Christoph Jung

Publication date: 8 November 2022

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.01610

zbMATH Keywords

complexitydescription logicontologieslearning from examplesdecidable fragments of first-order logiclogical separability

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Related Items (1)

Living without Beth and Craig: Definitions and Interpolants in Description and Modal Logics with Nominals and Role Inclusions

Uses Software

• DL-learner

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the finite controllability of conjunctive query answering in databases under open-world assumption
• Elements of finite model theory.
• Testing containment of conjunctive queries under functional and inclusion dependencies
• Reasoning and revision in hybrid representation systems
• Modal languages and bounded fragments of predicate logic
• Concept learning in description logics using refinement operators
• Query inseparability for \(\mathcal{ALC}\) ontologies
• Data-complexity of the two-variable fragment with counting quantifiers
• Remarks on Berger's paper on the domino problem
• An Introduction to Description Logic
• Learning in Description Logics with Fuzzy Concrete Domains
• The Complexity of Conjunctive Query Answering in Expressive Description Logics
• DL-FOIL Concept Learning in Description Logics
• Ideal Downward Refinement in the $\mathcal{EL}$ Description Logic
• On languages with two variables
• On the Decision Problem for Two-Variable First-Order Logic
• SOME MODEL THEORY OF GUARDED NEGATION
• On the Restraining Power of Guards
• Ontology-Based Data Access
• The Exact Complexity of the First-Order Logic Definability Problem
• Conservative Extensions in Guarded and Two-Variable Fragments.
• Dichotomies in Ontology-Mediated Querying with the Guarded Fragment
• A Model+Solver Approach to Concept Learning
• The Freedoms of (Guarded) Bisimulation
• Querying the Guarded Fragment
• The undecidability of the domino problem
• Guarded Negation

This page was built for publication: Logical separability of labeled data examples under ontologies