Spain

Humans are capable of abstracting away irrelevant details or distinguish the common properties when studying problems. This is especially noticeable for planning problems, as humans are able to disregard certain parts of the domain and focus on the key elements important for finding a plan. Recently, the notion of abstraction has been introduced for Answer Set Programming (ASP), a knowledge representation and reasoning paradigm widely used in problem solving, with the potential to understand the key elements of a program that play a role in finding a solution. This paper highlights the potential use of such an abstraction in getting to the essence of planning problems, expressed in ASP, by disregarding irrelevant details and computing abstract plans.

ECAI 2020

Abstraction for ASP Planning

answer set programming

planning

abstraction

We are pleased to announce the Fortieth AAAI Conference on Artificial Intelligence (AAAI-26), which will be held in Singapore EXPO from January 20 to January 27, 2026.

The purpose of the AAAI conference series is to promote research in Artificial Intelligence (AI) and foster scientific exchange between researchers, practitioners, scientists, students, and engineers across the entirety of AI and its affiliated disciplines. AAAI-26 will feature technical paper presentations, special tracks, invited speakers, workshops, tutorials, poster sessions, senior member presentations, competitions, and exhibit programs, and a range of other activities to be announced.<br><br>

To access this event page, you need to log in with the **email address you registered with**. <br>Access credentials will be sent to your email from Underline -  subject line "Welcome to AAAI 2026". Please be sure to check your spam email folder if you do not see an email confirmation right away.

Please log in

To access this event page, you are required to register.
Please complete your registration to continue.

We recommend reading [**the registration information**](https://aaai.org/conference/aaai/aaai-26/registration/) first.

**Online Registration Form**: https://aaai.getregistered.net/conference-2026 

Registration Required

AAAI 2026

We are pleased to announce the Fortieth AAAI Conference on Artificial Intelligence (AAAI-26), which will be held in Singapore EXPO from January 20 to January 27, 2026.

poster

ECAI2020 featured a full programme of technical papers, as well as many AI-related events of interest for researchers, students and all attendants who are interested on contemporary AI, including:




**An extensive programme of workshops, tutorials, and invited speakers**

**The Prestigious Applications of Intelligent Systems conference (PAIS)**

**The Frontiers in AI track sessions**

**The Lab To Market event**

**The Women in AI time**

**The EU Challenges forum**

… and many more!

ECAI 2020 featured a full programme of technical papers, as well as many AI-related events of interest for researchers, students and all attendants who are interested on contemporary AI.

In some abstract argumentation framework (AAF), arguments have a degree of uncertainty, which impacts on the degree of uncertainty of the extensions obtained under a semantics. In these approaches, both the uncertainty of the arguments and of the extensions are modeled by means of precise probability values. However, in many real life situations the exact probabilities values are unknown and sometimes there is a need for aggregating the probability values of different sources. In this paper, we tackle the problem of calculating the degree of uncertainty of the extensions considering that the probability values of the arguments are imprecise.

Towards an Imprecise Probability Approach for Abstract Argumentation

Local to Global Learning of a Latent Dynamic Bayesian Network

From Eigentrust to a Trust-measuring algorithm in the Max-Plus Algebra

We describe a reasoning framework for knowledge invention and creative problem solving that can integrate and extend the knowledge level mechanism of diverse cognitive architectures (CAs). This framework exploits an extension of a Description Logic (DL) of typicality able to combine prototypical (commonsense) descriptions of concepts. It works as follows: given a goal expressed as a set of properties, in case an intelligent agent cannot find a concept in its knowledge base (KB) able to fulfill these properties, our framework is able to dynamically recombine, in a goal-oriented perspective, the concepts in the KB in order to find a suitable creative combination able to satisfy the goal. The KB of the agent is then extended via a mechanism of commonsense concept combination where the resulting combined concept represents the solution for the initial goal. Here we discuss how such framework is compliant with the general tenets of the Standard Model of Mind and can extend the knowledge level capabilities of diverse CAs.

A goal-oriented framework for knowledge invention and creative problem solving in cognitive architectures

Studying lack of information through type-2 fuzzy strong negation

A Syntactic Approach for Privacy-Preserving Federated Learning

Segmented Tables: an Efficient Modeling Tool for Constraint Reasoning

Within the autonomous driving domain, there is now a  clear need and tremendous potential for hybrid solutions (e.g., integrating  semantics, learning, visual computing) towards fulfilling essential  legal and ethical responsibilities involving explainability (e.g.,  for diagnosis), human-centred AI (e.g., interaction design), and industrial  standardisation (e.g, pertaining to representation, realisation  of rules & norms). In these contexts, this highlight paper positions
 recent research from IJCAI 2019 aimed at advancing humancentred  AI principles in the backdrop of the autonomous driving  application domain. From a technical viewpoint, the highlighted research  provides a model for advancing the state of the art in reasoning
 about space and motion, combining reasoning and learning, nonmonotonic  reasoning, and computational modelling of high-level visuospatial  commonsense. In addition to demonstrating the significance  of integrated vision and semantics solutions in autonomous  driving, we also highlight open questions emphasising the need for  interdisciplinary mixed-methods research –involving AI, Psychology,  HCI– to better appreciate the complexity and spectrum of varied
 human-centred challenges in diverse naturalistic driving situations.

Driven by Commonsense: On the Role of Human-Centred Visual Explainability for Autonomous Vehicles

The Winograd Schema Challenge (WSC) was proposed  by Levesque et al. in 2011 as a new test in Artificial Intelligence (AI)  and possibly as an alternative to the Turing test. WSC is a complex
 coreference resolution task which requires applying knowledge on  commonsense reasoning. It is an easy task for humans but it still remains  an unsolved challenge for computers. There are two categories  of proposed approaches for tackling the WSC. The first encompasses  techniques based on formalized Knowledge Representation and Reasoning  (KRR), while the second entails Machine Learning (ML)  approaches. In this paper we provide a review of the state-of-theart
 approaches proposed from both categories and we outline their  strengths and weaknesses. Additionally, we discuss a recent work  which combines techniques from both categories as it seems to be a  promising and innovative approach.

Review of the Recent Techniques for Learning Commonsense Knowledge applied to the Winograd Schema Challenge

This paper provides an overview of an architecture based on the principle of step-wise refinement for knowledge representation, explainable reasoning, and interactive learning, in robotics. We briefly describe the individual components of the architecture, and emphasize how the interplay between representation, reasoning, and learning, can be exploited to enable reliable and efficient decision making in dynamic domains

Downloads

Next from ECAI 2020

Towards an Imprecise Probability Approach for Abstract Argumentation

Similar lecture

2-ASP(Q) Solving Based on CEGAR