Search Results for author:
Found 22 papers, 1 papers with code
A preferential interpretation of MultiLayer Perceptrons in a conditional logic with typicality
In this paper we investigate the relationships between a multipreferential semantics for defeasible reasoning in knowledge representation and a multilayer neural network model.
Complexity and scalability of defeasible reasoning in many-valued weighted knowledge bases with typicality
Weighted knowledge bases for description logics with typicality under a "concept-wise" multi-preferential semantics provide a logical interpretation of MultiLayer Perceptrons.
Many-valued Argumentation, Conditionals and a Probabilistic Semantics for Gradual Argumentation
In this paper we propose a general approach to define a many-valued preferential interpretation of gradual argumentation semantics.
An ASP approach for reasoning on neural networks under a finitely many-valued semantics for weighted conditional knowledge bases
Weighted knowledge bases for description logics with typicality have been recently considered under a "concept-wise" multipreference semantics (in both the two-valued and fuzzy case), as the basis of a logical semantics of MultiLayer Perceptrons (MLPs).
From Weighted Conditionals of Multilayer Perceptrons to Gradual Argumentation and Back
A fuzzy multipreference semantics has been recently proposed for weighted conditional knowledge bases, and used to develop a logical semantics for Multilayer Perceptrons, by regarding a deep neural network (after training) as a weighted conditional knowledge base.
Weighted Conditional EL{^}bot Knowledge Bases with Integer Weights: an ASP Approach
Weighted knowledge bases for description logics with typicality have been recently considered under a "concept-wise" multipreference semantics (in both the two-valued and fuzzy case), as the basis of a logical semantics of Multilayer Perceptrons.
Reasoning about actions with EL ontologies with temporal answer sets
We propose an approach based on Answer Set Programming for reasoning about actions with domain descriptions including ontological knowledge, expressed in the lightweight description logic EL^\bot.
From Common Sense Reasoning to Neural Network Models through Multiple Preferences: an overview
In this paper we discuss the relationships between conditional and preferential logics and neural network models, based on a multi-preferential semantics.
A conditional, a fuzzy and a probabilistic interpretation of self-organising maps
In particular, we show that the input/output behavior of a Self-Organising Map after training can be described by a fuzzy description logic interpretation as well as by a preferential interpretation, based on a concept-wise multipreference semantics, which takes into account preferences with respect to different concepts and has been recently proposed for ranked and for weighted defeasible description logics.
Weighted defeasible knowledge bases and a multipreference semantics for a deep neural network model
In this paper we investigate the relationships between a multipreferential semantics for defeasible reasoning in knowledge representation and a deep neural network model.
A framework for a modular multi-concept lexicographic closure semantics
The idea is that of distributing the defeasible properties of concepts into different modules, according to their subject, and of defining a notion of preference for each module based on the lexicographic closure semantics.
On a plausible concept-wise multipreference semantics and its relations with self-organising maps
Inthispaperwedescribeaconcept-wisemulti-preferencesemantics for description logic which has its root in the preferential approach for modeling defeasible reasoning in knowledge representation.
An ASP approach for reasoning in a concept-aware multipreferential lightweight DL
In this paper we develop a concept aware multi-preferential semantics for dealing with typicality in description logics, where preferences are associated with concepts, starting from a collection of ranked TBoxes containing defeasible concept inclusions.
Reasoning about Typicality and Probabilities in Preferential Description Logics
In this work we describe preferential Description Logics of typicality, a nonmonotonic extension of standard Description Logics by means of a typicality operator T allowing to extend a knowledge base with inclusions of the form T(C) v D, whose intuitive meaning is that normally/typically Cs are also Ds.
A reconstruction of the multipreference closure
Here, we reconstruct the notion of MP-closure in the propositional case and we show that it is a natural variant of Lehmann's lexicographic closure.
Reasoning about exceptions in ontologies: from the lexicographic closure to the skeptical closure
Reasoning about exceptions in ontologies is nowadays one of the challenges the description logics community is facing.
Defeasible Reasoning in SROEL: from Rational Entailment to Rational Closure
In this work we study a rational extension $SROEL^R T$ of the low complexity description logic SROEL, which underlies the OWL EL ontology language.
Reasoning about multiple aspects in DLs: Semantics and Closure Construction
Starting from the observation that rational closure has the undesirable property of being an "all or nothing" mechanism, we here propose a multipreferential semantics, which enriches the preferential semantics underlying rational closure in order to separately deal with the inheritance of different properties in an ontology with exceptions.
ASP for Minimal Entailment in a Rational Extension of SROEL
In this paper we exploit Answer Set Programming (ASP) for reasoning in a rational extension SROEL-R-T of the low complexity description logic SROEL, which underlies the OWL EL ontology language.
Rational Closure in SHIQ
We define a notion of rational closure for the logic SHIQ, which does not enjoys the finite model property, building on the notion of rational closure introduced by Lehmann and Magidor in [23].
On Rational Closure in Description Logics of Typicality
We show that this semantics captures exactly a notion of rational closure which is a natural extension to Description Logics of Lehmann and Magidor's original one.
