An ASP approach for reasoning in a concept-aware multipreferential lightweight DL
From MaRDI portal
Publication:5140012
DOI10.1017/S1471068420000381zbMath1468.68212arXiv2006.04387OpenAlexW3088199683MaRDI QIDQ5140012
Daniele Theseider Dupré, Laura Giordano
Publication date: 13 December 2020
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.04387
Related Items (5)
An ASP Approach for Reasoning on Neural Networks under a Finitely Many-Valued Semantics for Weighted Conditional Knowledge Bases ⋮ On the KLM properties of a fuzzy DL with typicality ⋮ A general framework for preferences in answer set programming ⋮ Weighted defeasible knowledge bases and a multipreference semantics for a deep neural network model ⋮ Reasoning on Multirelational Contextual Hierarchies via Answer Set Programming with Algebraic Measures
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonmonotonic reasoning, preferential models and cumulative logics
- What does a conditional knowledge base entail?
- Reasoning in the defeasible description logic \(\mathcal{EL}_{\bot}\) -- computing standard inferences under rational and relevant semantics
- Enhancing context knowledge repositories with justifiable exceptions
- Properties of skeptical c-inference for conditional knowledge bases and its realization as a constraint satisfaction problem
- On the computational cost of disjunctive logic programming: Propositional case
- Another perspective on default reasoning
- Reasoning with justifiable exceptions in \(\mathcal{EL}_\bot\) contextualized knowledge repositories
- A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure
- Rational closure for all description logics
- The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
- Combining answer set programming with description logics for the semantic web
- Defeasible Inheritance-Based Description Logics
- Well-founded semantics for description logic programs in the semantic web
- Preferential Description Logics
- Reconciling description logics and rules
- The Complexity of Circumscription in DLs
- ASP for minimal entailment in a rational extension of SROEL
- Towards a Rational Closure for Expressive Description Logics: the Case of 𝒮𝒽𝒾𝓆
- Defeasible Reasoning in 𝒮ℛ𝒪ℰℒ: from Rational Entailment to Rational Closure
- Rational Closure for Defeasible Description Logics
- Efficient Inferencing for OWL EL
- Reasoning about Multiple Aspects in Rational Closure for DLs
- Description logics of minimal knowledge and negation as failure
- A description logic of typicality for conceptual combination
This page was built for publication: An ASP approach for reasoning in a concept-aware multipreferential lightweight DL
