Upward refinement operators for conceptual blending in the description logic EL^++
From MaRDI portal
Publication:1653445
Recommendations
- scientific article; zbMATH DE number 1759244
- Foundations of Refinement Operators for Description Logics
- Concept learning in description logics using refinement operators
- Ideal downward refinement in the \(\mathcal{EL}\) description logic
- Hybrid unification in the description logic \(\mathcal{EL}\)
- Publication:4867027
- Adding threshold concepts to the description logic \(\mathcal{EL}\)
- Unification in the Description Logic $\mathcal{EL}$
- An epistemic operator for description logics
- Foundations of instance level updates in expressive description logics
Cites work
- Approximate Epistemic Planning with Postdiction as Answer-Set Programming
- Approximate postdictive reasoning with answer set programming
- ASP, amalgamation, and the conceptual blending workflow
- Combining answer set programming with description logics for the semantic web
- Completeness and properness of refinement operators in inductive logic programming
- Computing the least common subsumer in the description logic \(\mathcal{EL}\) w.r.t. terminological cycles with descriptive semantics
- Computing the least common subsumer w.r.t. a background terminology
- Concept learning in description logics using refinement operators
- Graph-Theoretic Concepts in Computer Science
- scientific article; zbMATH DE number 3466489 (Why is no real title available?)
- scientific article; zbMATH DE number 2043522 (Why is no real title available?)
- scientific article; zbMATH DE number 5037197 (Why is no real title available?)
- Ideal downward refinement in the \(\mathcal{EL}\) description logic
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Logic Programming and Nonmonotonic Reasoning
- Nested preferences in answer set programming
- OntoDLV: An ASP-based System for Enterprise Ontologies
- Reformulating the situation calculus and the event calculus in the general theory of stable models and in answer set programming
- Similarity measures over refinement graphs
- Unification in the Description Logic $\mathcal{EL}$
- Using possibilistic logic for modeling qualitative decision: answer set programming algorithms
Cited in
(5)- A computational framework for conceptual blending
- Towards a model of creative understanding: deconstructing and recreating conceptual blends using image schemas and qualitative spatial descriptors
- Blending under deconstruction. The roles of logic, ontology, and cognition in computational concept invention
- Theory blending: extended algorithmic aspects and examples
- ASP, amalgamation, and the conceptual blending workflow
This page was built for publication: Upward refinement operators for conceptual blending in the description logic \(\mathcal{EL}^{++}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1653445)
