Search Results for author:
Found 6 papers, 1 papers with code
Minimal Macro-Based Rewritings of Formal Languages: Theory and Applications in Ontology Engineering (and beyond)
In this paper, we introduce the problem of rewriting finite formal languages using syntactic macros such that the rewriting is minimal in size.
Ontology-based n-ball Concept Embeddings Informing Few-shot Image Classification
The approach consists of two components - converting symbolic knowledge of an ontology into continuous space by learning n-ball embeddings that capture properties of subsumption and disjointness, and guiding the training and inference of a vision model using the learnt embeddings.
Visual-Semantic Embedding Model Informed by Structured Knowledge
With respect to both standard and zero-shot image classification, our approach shows superior performance compared with the original approach, which uses word embeddings.
Theoretical Foundations of Defeasible Description Logics
Besides showing that our semantics is appropriate, these results pave the way for more effective decision procedures for defeasible reasoning in DLs.
Generating Ontologies from Templates: A Rule-Based Approach for Capturing Regularity
We present a second-order language that can be used to succinctly specify ontologies in a consistent and transparent manner.
Algorithm for Adapting Cases Represented in a Tractable Description Logic
Following the idea of adaptation as revision, we firstly extend the logical basis for describing cases from propositional logic to the DL $\mathcal{EL_{\bot}}$, and present a formalism for adaptation based on $\mathcal{EL_{\bot}}$.
