Fabio Aurelio D’Asaro

ORCID: 0000-0002-2958-3874
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Logic, Reasoning, and Knowledge
  • Semantic Web and Ontologies
  • Bayesian Modeling and Causal Inference
  • Culinary Culture and Tourism
  • Multi-Agent Systems and Negotiation
  • Explainable Artificial Intelligence (XAI)
  • Logic, programming, and type systems
  • Social Robot Interaction and HRI
  • Complex Systems and Decision Making
  • Cognitive Science and Education Research
  • Cryptography and Data Security
  • Advanced Algebra and Logic
  • Advanced Database Systems and Queries
  • Epistemology, Ethics, and Metaphysics
  • Robotics and Automated Systems
  • Adversarial Robustness in Machine Learning
  • Human Pose and Action Recognition
  • Intelligent Tutoring Systems and Adaptive Learning
  • Distributed Control Multi-Agent Systems
  • Software Engineering Research
  • Modular Robots and Swarm Intelligence
  • Security and Verification in Computing
  • Machine Learning and Data Classification
  • Wikis in Education and Collaboration
  • Artificial Intelligence in Healthcare and Education

University of Verona
2022-2025

University of Milan
2021-2025

IMT School for Advanced Studies Lucca
2025

University of Naples Federico II
2020-2023

University College London
2016-2020

University of Palermo
2013-2015

Abstract In this paper we present the probabilistic typed natural deduction calculus TPTND, designed to reason about and derive trustworthiness properties of computational processes, like those underlying current AI applications. Derivability in TPTND is interpreted as process extracting $n$ samples possibly complex outputs with a certain frequency from given categorical distribution. We formalize trust for such form hypothesis testing on distance between intended probability. The main...

10.1093/logcom/exaf003 article EN Journal of Logic and Computation 2025-01-23

We put forward a proposal for logics handling both non-monotonic reasoning and boundedly rational agents. propose hierarchy of depth-bounded logics. As the parameter k, which controls level depth, increases, non-monotonicity decreases while inferential power, in classical sense, increases. Ultimately, these aim to provide approximations logic. present arguments evidence supporting adoption this framework.

10.54103/1757-0522/27548 article EN cc-by-sa ˜The œreasoner 2025-01-22

10.1016/j.artint.2020.103352 article EN publisher-specific-oa Artificial Intelligence 2020-06-29

Abstract A robot intended to monitor human behavior must account for the user’s reactions minimize his/her perceived discomfort. The possibility of learning user interaction preferences and changing robot’s accordingly may positively impact quality with robot. should approach without causing any discomfort or interference. In this work, we contribute implement a novel Reinforcement Learning (RL) navigation toward user. Our implementation is proof-of-concept that uses data gathered from...

10.1007/s12369-023-01044-7 article EN cc-by International Journal of Social Robotics 2023-09-07

In this paper we advocate the use of Inductive Logic Programming as a device for explaining black-box models, e.g. Support Vector Machines (SVMs), when they are used to learn user preferences. We present case study where ILP system ILASP explain output SVM classifiers trained on preference datasets. Explanations produced in terms weak constraints, which can be easily understood by humans. both global and local approximator SVMs, score its fidelity, discuss how prove useful interactive...

10.24963/kr.2020/88 article EN 2020-07-01

Some aspects of eLearning experience can be enhanced in a very natural way by using the basic tools offered fuzzy logic.As matter example, consider uncontrolled growth information produced collaborative-oriented context, which each participant (e.g.students, teachers) is able to insert and share new contents (e.g.comments, texts) concerning university course.All incrementally added pieces evaluated several ways: intervention "dictator" (e.g. teacher), rating form, or even according frequency...

10.2991/eusflat.2013.29 article EN cc-by-nc 2013-01-01

In this contribution we begin to discuss the thesis that an analysis of similarities and differences typical methodologies human sciences, technology hard sciences show some unforeseen but strong between technologies. context fuzzy sets ideas provide useful tools which help render more quantitative without loosing connection with a purely descriptive analysis. These kinds considerations would have been hardly conceivable in setting XIX Century conception science. It is development...

10.1109/ifsa-nafips.2013.6608482 article EN 2013-06-01

Abstract We present and discuss a runtime architecture that integrates sensorial data classifiers with logic-based decision-making system in the context of an e-Health for rehabilitation children neuromotor disorders. In this application, perform task form games. The main aim is to derive set parameters child’s current level cognitive behavioral performance (e.g., engagement, attention, accuracy) from available sensors eye trackers, motion sensors, emotion recognition techniques) take...

10.1017/s1471068422000382 article EN cc-by Theory and Practice of Logic Programming 2022-10-20

Download This Paper Open PDF in Browser Add to My Library Share: Permalink Using these links will ensure access this page indefinitely Copy URL DOI

10.2139/ssrn.4722645 article EN SSRN Electronic Journal 2024-01-01

The simple act of perceiving, planning an action, predicting others’ intentions, and imagining the events a day in future are cognitive processes with something common, at least according to Active Inference Hypothesis: They all based on model constructed basis our inner structures as well past experiences, themselves formed perceptions internal external stimuli. As conceptual tool, that hypothesis can be traced back Kant’s metaphysical assumption about way which we form from sensory data...

10.22541/au.171945748.89099414/v1 preprint EN Authorea (Authorea) 2024-06-27

We describe a general procedure for translating Epistemic Probabilistic Event Calculus (EPEC) action language domains into Answer Set Programs (ASP), and show how the Python-driven features of ASP solver Clingo can be used to provide efficient computation in this probabilistic setting. EPEC supports probabilistic, epistemic reasoning containing narratives that include both an agent's own executions environmentally triggered events. Some actions may belief-conditioned, some imperfect sensing...

10.1016/j.ijar.2023.109101 article EN cc-by International Journal of Approximate Reasoning 2023-12-14

In many different social contexts, communication allows a collective intelligence to emerge.However, correct way of exchanging information usually requires determined topological configurations the agents involved in process.Such configuration should take into account several parameters, e.g.agents positioning, their proximity and time efficiency communication.Our aim is present an algorithm, based on evolutionary programming, which optimizes placement arbitrarily shaped areas.In order show...

10.5220/0005230601980202 article EN cc-by-nc-nd 2015-01-01

In this paper we present the probabilistic typed natural deduction calculus TPTND, designed to reason about and derive trustworthiness properties of computational processes, like those underlying current AI applications. Derivability in TPTND is interpreted as process extracting $n$ samples possibly complex outputs with a certain frequency from given categorical distribution. We formalize trust for such form hypothesis testing on distance between intended probability. The main advantage...

10.48550/arxiv.2206.12934 preprint EN cc-by arXiv (Cornell University) 2022-01-01

Argumentation is a very active research field of Artificial Intelligence concerned with the representation and evaluation arguments used in dialogues between humans and/or artificial agents. Acceptability semantics formal argumentation systems define criteria for acceptance or rejection arguments. Several software systems, known as solvers, have been developed to compute accepted/rejected using such criteria. These include that learn identify accepted non-interpretable methods. In this paper...

10.48550/arxiv.2310.12309 preprint EN cc-by arXiv (Cornell University) 2023-01-01
Coming Soon ...