Upward refinement operators for conceptual blending in the description logic \(\mathcal{EL}^{++}\)
type: Item
instance of: scholarly article
title: Upward refinement operators for conceptual blending in the description logic \(\mathcal{EL}^{++}\)
zbMATH Open document ID: 1398.68501
author: Roberto Confalonieri
author: Manfred Eppe
author: Marco Schorlemmer
author: Oliver Kutz
author: Rafael Peñaloza
author: Enric Plaza
published in: Annals of Mathematics and Artificial Intelligence
publication date: 2018-08-06T00:00:00Z
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68T30
zbMATH DE Number: 6913830
zbMATH Keywords: computational creativity
zbMATH Keywords: conceptual blending
zbMATH Keywords: description logic
zbMATH Keywords: answer set programming
describes a project that uses: Maude
describes a project that uses: OntoDLV
describes a project that uses: Clingo
MaRDI profile type: Publication
full work available at URL: s10472-016-9524-8
OpenAlex ID: W2526614304
cites work: Conceptual Structures for Knowledge Creation and Communication
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Q5477943
cites work: Unification in the Description Logic $\mathcal{EL}$
cites work: Computing the least common subsumer w.r.t. a background terminology
cites work: Completeness and properness of refinement operators in inductive logic programming
cites work: Knowledge Representation, Reasoning and Declarative Problem Solving
cites work: Q4447224
cites work: Nested preferences in answer set programming
cites work: Using possibilistic logic for modeling qualitative decision: answer set programming algorithms
cites work: OntoDLV: An ASP-based System for Enterprise Ontologies
cites work: Similarity measures over refinement graphs
cites work: Combining answer set programming with description logics for the semantic web
cites work: Approximate postdictive reasoning with answer set programming
cites work: Approximate Epistemic Planning with Postdiction as Answer-Set Programming
cites work: ASP, Amalgamation, and the Conceptual Blending Workflow
cites work: Q4051550
cites work: Reformulating the situation calculus and the event calculus in the general theory of stable models and in answer set programming
cites work: Ideal Downward Refinement in the $\mathcal{EL}$ Description Logic
cites work: Concept learning in description logics using refinement operators
cites work: Logic Programming and Nonmonotonic Reasoning
DOI: 10.1007/S10472-016-9524-8
Recommended article: Q4537963
Recommended article: Foundations of Refinement Operators for Description Logics
Recommended article: Concept learning in description logics using refinement operators
Recommended article: Ideal Downward Refinement in the $\mathcal{EL}$ Description Logic
Recommended article: Hybrid Unification in the Description Logic $\mathcal{EL}$
Recommended article: Q4867027
Recommended article: Adding Threshold Concepts to the Description Logic $\mathcal{EL}$
Recommended article: Unification in the Description Logic $\mathcal{EL}$
Recommended article: An epistemic operator for description logics
Recommended article: Foundations of instance level updates in expressive description logics
description: scientific article; zbMATH DE number 6913830