Spain

ECAI 2020

Interpretable &amp; Time-Budget-Constrained Contextualization for Re-Ranking

efficiency-effectiveness tradeoff

neural re-ranking

information retrieval

transformers

# Welcome everyone to ACL 2022!

The 60th Annual Meeting of the Association for Computational Linguistics is taking place May 22-27, 2022 as a hybrid event, in Dublin and online. We are happy to welcome all of you to this anniversary edition with an almost 50-50 in-person and virtual participation. 
The main conference program features oral presentations, in-person and virtual posters and demo sessions, a plenary session for our best paper presentations and awards, three amazing keynote events and two new initiatives of invited talks: Spotlight Talks for Young Rising Stars (STIRS) and The Next Big Idea Talks. Posters (including Findings of ACL 2022) and demos are grouped by areas for both the in-person and the virtual sessions. For the virtual component, the talks will be on Zoom and the posters and the demos will be in GatherTown. The Student Research Workshop will have an oral session and a poster session as part of Poster Session 1. The program also features eight Tutorials and 28 Workshops. 

 
We wish you a wonderful conference! 
[**The ACL 2022 Organizing Committee**](https://www.2022.aclweb.org/organisers)
 
[**Conference Handbook**](https://drive.google.com/file/d/1_BUCMfhMVrjG9E2e71aHdHeE28KSje0l/view?usp=sharing) 
[**Mini Handbook**](https://drive.google.com/file/d/1qlBKl0wzmlVF1oCeMQl3BahLd9nLP5Ce/view?usp=sharing) 
[**Posters and Demo guides**](https://drive.google.com/file/d/1UucMAoCNncIOaH1rMMDa0owuG9qgvJTG/view?usp=sharing)

ACL 2022

The Association for Computational Linguistics (ACL) is the premier international scientific and professional society for people working on computational problems involving human language, a field often referred to as either computational linguistics or natural language processing (NLP). 

Interpretable & Time-Budget-Constrained Contextualization for Re-Ranking

technical paper

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.

Learning to Predict Charges for Legal Judgment via Self-Attentive Capsule Network

Bidirectional Scene Text Recognition with a Single Decoder

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.

Abstraction for ASP Planning

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.

Interpretable & Time-Budget-Constrained Contextualization for Re-Ranking

Downloads

Next from ECAI 2020

Learning to Predict Charges for Legal Judgment via Self-Attentive Capsule Network

Similar lecture

Towards Generalizeable Semantic Product Search by Text Similarity Pre-training on Search Click Logs

Stay up to date with the latest Underline news!

PRESENTATIONS

CONFERENCES

COMPANY

RESOURCES

Interpretable & Time-Budget-Constrained Contextualization for Re-Ranking

.css-70qvj9{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;-webkit-align-items:center;-webkit-box-align:center;-ms-flex-align:center;align-items:center;}Downloads

Next from ECAI 2020

Learning to Predict Charges for Legal Judgment via Self-Attentive Capsule Network

Similar lecture

Towards Generalizeable Semantic Product Search by Text Similarity Pre-training on Search Click Logs

Stay up to date with the latest Underline news!

PRESENTATIONS

CONFERENCES

COMPANY

RESOURCES

Downloads