Complexity and scalability of defeasible reasoning with typicality in many-valued weighted knowledge bases
From MaRDI portal
Publication:6545558
DOI10.1007/978-3-031-43619-2_33MaRDI QIDQ6545558
Daniele Theseider Dupré, Laura Giordano, Mario Alviano
Publication date: 29 May 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compiling finite linear CSP into SAT
- Description logic programs under probabilistic uncertainty and fuzzy vagueness
- Fuzzy description logics and \(t\)-norm based fuzzy logics
- On truth-table reducibility to SAT
- Nonmonotonic reasoning, preferential models and cumulative logics
- What does a conditional knowledge base entail?
- Another perspective on default reasoning
- Weighted defeasible knowledge bases and a multipreference semantics for a deep neural network model
- On the KLM properties of a fuzzy DL with typicality
- Towards Rational Closure for Fuzzy Logic: The Case of Propositional Gödel Logic
- Adding Threshold Concepts to the Description Logic $\mathcal{EL}$
- Bounded Query Classes
- JOINING GÖDEL AND ZADEH FUZZY LOGICS IN FUZZY DESCRIPTION LOGICS
- Rational Closure for Defeasible Description Logics
- ASP-Core-2 Input Language Format
- Reasoning on Multirelational Contextual Hierarchies via Answer Set Programming with Algebraic Measures
- An ASP Approach for Reasoning on Neural Networks under a Finitely Many-Valued Semantics for Weighted Conditional Knowledge Bases
- An ASP approach for reasoning in a concept-aware multipreferential lightweight DL
- Ordered models for concept representation
- The Description Logic Handbook
- Conditionals in nonmonotonic reasoning and belief revision. Considering conditionals as agents
- A description logic of typicality for conceptual combination
- Weighted conditional \(\mathscr{EL}^\bot\) knowledge bases with integer weights: an ASP approach
This page was built for publication: Complexity and scalability of defeasible reasoning with typicality in many-valued weighted knowledge bases
