Papers by Pierangelo Dell'Acqua
Intelligenza Artificiale
To the aim of constructing effective human-AI teams, that can be useful for improving caregiving ... more To the aim of constructing effective human-AI teams, that can be useful for improving caregiving in medicine and enhancing human performance also in other sectors (i.e., teaching), agents which interact with humans should be endowed with an emotion recognition and management module, capable of empathy, and of modeling aspects of the Theory of Mind, in the sense of being able to reconstruct what someone is thinking or feeling. In this paper, we propose an architecture for such a module, based upon an enhanced notion of Behavior Trees. We illustrate the effectiveness of the proposed architecture on a significant example and on a wider case study.
2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, 2008
Computational Methods for Inverse Problems in Imaging, 2019
Non-stationary regularizing preconditioners have recently been proposed for the acceleration of c... more Non-stationary regularizing preconditioners have recently been proposed for the acceleration of classical iterative methods for the solution of linear discrete ill-posed problems. This paper explores how these preconditioners can be combined with the flexible GMRES iterative method. A new structure-respecting strategy to construct a sequence of regularizing preconditioners is proposed. We show that flexible GMRES applied with these preconditioners is able to restore images that have been contaminated by strongly non-symmetric blur, while several other iterative methods fail to do this.
AI-based systems use trained machine learning models to make important decisions in critical cont... more AI-based systems use trained machine learning models to make important decisions in critical contexts. The EU guidelines for trustworthy AI emphasise the respect for human autonomy, prevention of harm, fairness, and explicability. Many successful machine learning methods, however, deliver opaque models where the reasons for decisions remain unclear to the end user. Hence, accountability and trust are difficult to ascertain. In this position paper, we focus on AI systems that are expected to interact with humans and we propose our visionary architecture, called ECA-HAI (Explainable, Compliant and Adaptive Human-Automation Interaction)-RefArch. ECA-HAI-RefArch allows for building intelligent systems where humans and AIs form teams, able to learn from data but also to learn from each other by playing “serious games”, for a continuous improvement of the overall system. Finally, conclusions are drawn.
Proceedings of the Eleventh International Conference on Logic Programming, Aug 23, 1994
this paper we propose a combination of the dynamic logic programming paradigm and (a version of) ... more this paper we propose a combination of the dynamic logic programming paradigm and (a version of) KS-agents. In the resulting framework, rational, reactive agents can dynamically change their own knowledge bases as well as their own goals. In particular, at every iteration of an observe-think-act cycle, the agent can make observations, learn new facts and new rules from the environment, and then it can update its knowledge accordingly.
Lecture Notes in Computer Science, 2011
Transactions on Rough Sets IV, 2005
Rough sets framework has two appealing aspects. First, it is a mathematical approach to deal with... more Rough sets framework has two appealing aspects. First, it is a mathematical approach to deal with vague concepts. Second, rough set techniques can be used in data analysis to find patterns hidden in the data. The number of applications of rough sets to practical problems in different fields demonstrates the increasing interest in this framework and its applicability. Most of the current rough sets techniques and software systems based on them only consider rough sets defined explicitly by concrete examples given in tabular form. The previous research mostly disregards the following two problems. The first problem is related with how to define rough sets in terms of other rough sets. The second problem is related with how to incorporate domain or expert knowledge. This thesis 1 proposes a language that caters for implicit definitions of rough sets obtained by combining different regions of other rough sets. In this way, concept approximations can be derived by taking into account domain knowledge. A declarative semantics for the language is also discussed. It is then shown that programs in the proposed language can be compiled to extended logic programs under the paraconsistent stable model semantics. The equivalence between the declarative semantics of the language and the declarative semantics of the compiled programs is proved. This transformation provides the computational basis for implementing our ideas. A query language for retrieving information about the concepts represented through the defined rough sets is also defined. Several motivating applications are described. Finally, an extension of the proposed language with numerical measures is discussed. This extension is motivated by the fact that numerical measures are an important aspect in data mining applications. I would like to express my sincere gratitude towards my supervisor, Jan Ma luszynski, for his invaluable guidance and constant support. At the department of Computer Science, at New University of Lisbon, my thanks goes to Carlos Viegas Damásio for his suggestions and the time taken to discuss many aspects of this work with me. I also would like to thank the following people for their comments and support:
Studies in Computational Intelligence, 2009
Several studies within the field of neuroscience, psychology and economics have concluded that em... more Several studies within the field of neuroscience, psychology and economics have concluded that emotions are vital for the human decision making process.Without emotions, humans cannot make reasonable choices, a fact that has until recently been neglected within the area of action selection. We propose a method to extend behavior networks to include affective impact. The work by Loewenstein et al.
Electronic Notes in Theoretical Computer Science, 2002
In this paper, we develop the notion of fuzzy unification and incorporate it into a novel fuzzy a... more In this paper, we develop the notion of fuzzy unification and incorporate it into a novel fuzzy argumentation framework for extended logic programming. We make the following contributions: The argumentation framework is defined by a declarative bottom-up fixpoint semantics and an equivalent goal-directed top-down proof-procedure for extended logic programming. Our framework allows one to represent positive and explicitly negative knowledge, as well as uncertainty. Both concepts are used in agent communication languages such as KQML and FIPA ACL. One source of uncertainty in open systems stems from mismatches in parameter and predicate names and missing parameters. To this end, we conservatively extend classical unification and develop fuzzy unification based on normalised edit distance over trees. Definition 15. Let P be an extended logic program.
Meta-logics and logic …, 1995
A theory system is a collection of interdependent theories, some if which stand in a meta/object ... more A theory system is a collection of interdependent theories, some if which stand in a meta/object relationship, forming an arbitrary number of meta-levels. The main thesis of this chapter is that theory systems constitute a suitable formalism for constructing advanced applications in reasoning and software engineering. The Alloy language for de ning theory systems is introduced, its syntax is de ned and a collection of inference rules is presented. A number of problems suitable for theory systems are discussed, with program examples given in Alloy. Some current implementation issues and future extensions are discussed. This paper appears as a chapter in Meta-logics and Logic Programming, edited by K. Apt and F. Turini, and published by MIT Press in 1995.
Procs. Multidisciplinary Workshop on Advances in Preference Handling (M-PREF’07), 33rd Intl. Conf. on Very Large Data Bases (VLDB’07), Vienna, Austria, Sep 1, 2007
This work proposes the application of preferences over abductive logic programs as an appealing d... more This work proposes the application of preferences over abductive logic programs as an appealing declarative formalism to model choice situations. In particular, both a priori and a posteriori handling of preferences between abductive extensions of a theory are addressed as complementary and essential mechanisms in a broader framework for abductive reasoning. Furthermore, both of these choice mechanisms are combined with other formalisms for decision making, like economic decision theory, resulting in theories ...
Procs. of the ICLP, 1999
Kowalski and Sadri 8] propose an approach to agents (KS-agents) within an extended logic programm... more Kowalski and Sadri 8] propose an approach to agents (KS-agents) within an extended logic programming framework. KS-agents are hybrid in that they exhibit both rational (or deliberative) and reactive behaviour. The reasoning core of KS-agents is a proof procedure that combines forward and backward reasoning. Backward reasoning is used primarily for planning, problem solving and other deliberative activities. Forward reasoning is used primarily for reactivity to the environment, possibly including other agents. The proof ...
Procs. 18th Intl. Conf. on Applications of Declarative Programming and Knowledge Management (INAP09), Nov 5, 2009
Abstract. In previous work, we have proposed a multi-level agent model with at least a meta-level... more Abstract. In previous work, we have proposed a multi-level agent model with at least a meta-level aimed at meta-reasoning and meta-control. In agents, these aspects are strongly related with time and therefore we retain that they can be expressed by means of temporal-logic-like rules. In this paper, we propose an interval temporal logic inspired by METATEM, that allows properties to be verified in specific time interval situated either in the past or in the future. We adopt this logic for definition and run-time verification of properties which ...
Journal of Applied Logic, 2007
Employing a logic program approach, this paper focuses on applying preferential reasoning to theo... more Employing a logic program approach, this paper focuses on applying preferential reasoning to theory revision, both by means of preferences among existing theory rules, and by means of preferences on the possible abductive extensions to the theory. And, in particular, how to prefer among plausible abductive explanations justifying observations.
This paper deals with run-time detection and possible correction of erroneous and/or anomalous be... more This paper deals with run-time detection and possible correction of erroneous and/or anomalous behavior in agents. We augment our previous approaches by allowing an agent to explicitly observe and record its past behavior so as to be able to decide its best actions, and avoid errors performed in previous similar situations.
In previous work, we have proposed a multi-level agent model with (at least) a meta-level aimed a... more In previous work, we have proposed a multi-level agent model with (at least) a meta-level aimed at meta-reasoning and meta-control. In agents, these aspects are strongly related with time and therefore we retain that they can be expressed by means of temporal-logic-like rules. In this paper, we propose an “interval” temporal logic inspired by METATEM, that allows properties to be verified in specific time interval situated either in the past or in the future. We adopt this logic for definition and run-time verification of properties which can imply modifications to the agent’s knowledge base.
Uploads
Papers by Pierangelo Dell'Acqua