In this article we present an advanced version of Dual-PECCS, a cognitively-inspired knowledge representation and reasoning system aimed at extending the capabilities of artificial systems in conceptual categorization tasks. It combines different sorts of common-sense categorization (prototypical and exemplars-based categorization) with standard monotonic categorization procedures. These different types of inferential procedures are reconciled according to the tenets coming from the dual process theory of reasoning. On the other hand, from a representational perspective, the system relies on the hypothesis of conceptual (...) structures represented as heterogeneous proxytypes. Dual-PECCS has been experimentally assessed in a task of conceptual categorization where a target concept illustrated by a simple common-sense linguistic description had to be identified by resorting to a mix of categorization strategies, and its output has been compared to human responses. The obtained results suggest that our approach can be beneficial to improve the representational and reasoning conceptual capabilities of standard cognitive artificial systems, and –in addition– that it may be plausibly applied to different general computational models of cognition. The current version of the system, in fact, extends our previous work, in that Dual-PECCS is now integrated and tested into two cognitive architectures, ACT-R and CLARION, implementing different assumptions on the underlying invariant structures governing human cognition. Such integration allowed us to extend our previous evaluation. (shrink)

Pour la plupart des systèmes de représentation de la connaissance orientés concept, l’un des problèmes principaux relève de la commodité technique. A savoir, la représentation de connaissance en termes prototypiques, tout comme la possibilité d’exploiter des formes de raisonnement conceptuel basées sur la typicalité, ne sont pas autorisées. Au contraire, dans les sciences cognitives, il existe des données en faveur de concepts prototypiques, et des formes non-monotoniques de raisonnement conceptuel ont été largement étudiées. Ce fossé cognitif concernant la représentation et (...) le raisonnement constitue un problème pour les systèmes computationnels, puisque l’information prototypique joue un rôle crucial dans plusieurs tâches importantes. Dans la lignée des théories du raisonnement et de la rationalité dites du double processus, nous soutenons que la représentation conceptuelle dans les systèmes computationnels devrait dépendre de (au moins) deux composantes représentationnelles, chacune spécialisée dans le traitement de différents genres de processus de raisonnement. Dans cet article, nous présentons les avantages computationnels de cette approche en termes de double processus, et les comparons brièvement avec d’autres solutions d’orientation logique, adoptées pour traiter du même problème. (shrink)

In this paper we propose a computational framework aimed at extending the problem solving capabilities of cognitive artificial agents through the introduction of a novel, goal-directed, dynamic knowledge generation mechanism obtained via a non monotonic reasoning procedure. In particular, the proposed framework relies on the assumption that certain classes of problems cannot be solved by simply learning or injecting new external knowledge in the declarative memory of a cognitive artificial agent but, on the other hand, require a mechanism for the (...) automatic and creative re-framing, or re-formulation, of the available knowledge. We show how such mechanism can be obtained trough a framework of dynamic knowledge generation that is able to tackle the problem of commonsense concept combination. In addition, we show how such a framework can be employed in the field of cognitive architectures in order to overcome situations like the impasse in SOAR by extending the possible options of its subgoaling procedures. (shrink)

We propose a nonmonotonic Description Logic of typicality able to account for the phenomenon of the combination of prototypical concepts. The proposed logic relies on the logic of typicality ALC + TR, whose semantics is based on the notion of rational closure, as well as on the distributed semantics of probabilistic Description Logics, and is equipped with a cognitive heuristic used by humans for concept composition. We first extend the logic of typicality ALC + TR by typicality inclusions of the (...) form p :: T(C) v D, whose intuitive meaning is that “we believe with degree p about the fact that typical Cs are Ds”. As in the distributed semantics, we define different scenarios containing only some typicality inclusions, each one having a suitable probability. We then exploit such scenarios in order to ascribe typical properties to a concept C obtained as the combination of two prototypical concepts. We also show that reasoning in the proposed Description Logic is EXPTIME-complete as for the underlying standard Description Logic ALC. (shrink)

In this paper I will present an analysis of the impact that the notion of “bounded rationality”, introduced by Herbert Simon in his book “Administrative Behavior”, produced in the field of Artificial Intelligence (AI). In particular, by focusing on the field of Automated Decision Making (ADM), I will show how the introduction of the cognitive dimension into the study of choice of a rational (natural) agent, indirectly determined - in the AI field - the development of a line of research (...) aiming at the realisation of artificial systems whose decisions are based on the adoption of powerful shortcut strategies (known as heuristics) based on “satisficing” - i.e. non optimal - solutions to problem solving. I will show how the “heuristic approach” to problem solving allowed, in AI, to face problems of combinatorial complexity in real-life situations and still represents an important strategy for the design and implementation of intelligent systems. (shrink)

In this work, we propose a meaningful extension of description logics for non-monotonic reasoning. We introduce \, a logic allowing for the representation of and reasoning about both typical class-membership and typical instances of a relation. We propose a preferential semantics for \ in terms of partially-ordered DL interpretations which intuitively captures the notions of typicality we are interested in. We define a tableau-based algorithm for checking \ knowledge-base consistency that always terminates and we show that it is sound and (...) complete w.r.t. our preferential semantics. The general framework we here propose can serve as the foundation for further exploration of non-monotonic reasoning in description logics and similarly structured logics. (shrink)

We investigate an aspect of defeasibility that has somewhat been overlooked by the non-monotonic reasoning community, namely that of defeasible modes of reasoning. These aim to formalise defeasibility of the traditional notion of necessity in modal logic, in particular of its different readings as action, knowledge and others in specific contexts, rather than defeasibility of conditional forms. Building on an extension of the preferential approach to modal logics, we introduce new modal osperators with which to formalise the notion of defeasible (...) necessity and distinct possibility, and that can be used to represent expected effects, refutable knowledge, and so on. We show how KLM-style conditionals can smoothly be integrated with our richer language. We also propose a tableau calculus which is sound and complete with respect to our modal preferential semantics, and of which the computational complexity remains in the same class as that of the underlying classical modal logic. (shrink)

Revision operation is the consistent expansion of a theory by a new belief-representing sentence. We consider that in a paraconsistent setting this desideratum can be accomplished in at least three distinct ways: the output of a revision operation should be either non-trivial or non-contradictory (in general or relative to the new belief). In this paper those distinctions will be explored in the constructive level by showing how the remainder sets could be refined, capturing the key concepts of paraconsistency in a (...) dynamical scenario. These are preliminaries results of a wider project on Paraconsistent Belief Change conduced by the authors. (shrink)

Pour la plupart des systèmes de représentation de la connaissance orientés concept, l’un des problèmes principaux relève de la commodité technique. A savoir, la représentation de connaissance en termes prototypiques, tout comme la possibilité d’exploiter des formes de raisonnement conceptuel basées sur la typicalité, ne sont pas autorisées. Au contraire, dans les sciences cognitives, il existe des données en faveur de concepts prototypiques, et des formes non-monotoniques de raisonnement conceptuel ont été largement étudiées. Ce fossé cognitif concernant la représentation et (...) le raisonnement constitue un problème pour les systèmes computationnels, puisque l’information prototypique joue un rôle crucial dans plusieurs tâches importantes. Dans la lignée des théories du raisonnement et de la rationalité dites du double processus, nous soutenons que la représentation conceptuelle dans les systèmes computationnels devrait dépendre de deux composantes représentationnelles, chacune spécialisée dans le traitement de différents genres de processus de raisonnement. Dans cet article, nous présentons les avantages computationnels de cette approche en termes de double processus, et les comparons brièvement avec d’autres solutions d’orientation logique, adoptées pour traiter du même problème. (shrink)

Modal accounts of normality in non-monotonic reasoning traditionally have an underlying semantics based on a notion of preference amongst worlds. In this paper, we motivate and investigate an alternative semantics, based on ordered accessibility relations in Kripke frames. The underlying intuition is that some world tuples may be seen as more normal, while others may be seen as more exceptional. We show that this delivers an elegant and intuitive semantic construction, which gives a new perspective on defeasible necessity. Technically, the (...) revisited logic does not change the expressive power of our previously defined preferential modalities. This conclusion follows from an analysis of both semantic constructions via a generalisation of bisimulations to the preferential case. Reasoners based on the previous semantics therefore also suffice for reasoning over the new semantics. We complete the picture by investigating different notions of defeasible conditionals in modal logic that can also be captured within our framework. (shrink)