A reconstruction of multipreference closure
From MaRDI portal
Publication:2046040
DOI10.1016/j.artint.2020.103398zbMath1504.68210arXiv1905.03855OpenAlexW3092333072MaRDI QIDQ2046040
Valentina Gliozzi, Laura Giordano
Publication date: 16 August 2021
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.03855
Related Items (4)
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 ⋮ Characterizing multipreference closure with system W ⋮ Weighted defeasible knowledge bases and a multipreference semantics for a deep neural network model
Cites Work
- Unnamed Item
- Unnamed Item
- A non-monotonic description logic for reasoning about typicality
- Semantic characterization of rational closure: from propositional logic to description logics
- Conditional entailment: bridging two approaches to default reasoning.
- Preference fusion for default reasoning beyond system Z
- Nonmonotonic reasoning, preferential models and cumulative logics
- What does a conditional knowledge base entail?
- The logic of conditionals. An application of probability to deductive logic
- A note on the rational closure of knowledge bases with both positive and negative knowledge
- A thorough axiomatization of a principle of conditional preservation in belief revision
- System JLZ -- rational default reasoning by minimal ranking constructions.
- Belief functions and default reasoning
- Rationality and context in defeasible subsumption
- 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
- Another perspective on default reasoning
- The complexity of the consistency problem in the probabilistic description logic \(\mathcal{ALC}^\mathsf{ME}\)
- Maximum entropy calculations for the probabilistic description logic \(\mathcal{ALC}^{\mathsf{ME}}\)
- Contextual rational closure for defeasible \(\mathcal{ALC} \)
- Taking defeasible entailment beyond rational closure
- Reasoning about exceptions in ontologies: an approximation of the multipreference semantics
- Rational closure for all description logics
- Expressive probabilistic description logics
- On the logical properties of the nonmonotonic description logic \(\mathcal{DL}^{\operatorname{N}}\)
- Defeasible Inheritance-Based Description Logics
- Towards Rational Closure for Fuzzy Logic: The Case of Propositional Gödel Logic
- Relevant Closure: A New Form of Defeasible Reasoning for Description Logics
- Analytic tableaux calculi for KLM logics of nonmonotonic reasoning
- Preferential Description Logics
- Rational Closure for Defeasible Description Logics
- Reasoning about Multiple Aspects in Rational Closure for DLs
- Conditionals in nonmonotonic reasoning and belief revision. Considering conditionals as agents
This page was built for publication: A reconstruction of multipreference closure
