English
Related papers

Related papers: Binding Contexts as Partitionable Multisets in Abe…

200 papers

Traditionally categorical data analysis (e.g. generalized linear models) works with simple, flat datasets akin to a single table in a database with no notion of missing data or conflicting versions. In contrast, modern data analysis must…

Databases · Computer Science 2017-08-11 Jason Morton

In traditional justification logic, evidence terms have the syntactic form of polynomials, but they are not equipped with the corresponding algebraic structure. We present a novel semantic approach to justification logic that models…

Logic · Mathematics 2023-08-21 Michael Baur , Thomas Studer

The database community lacks a unified relational query language for subset selection and optimisation queries, limiting both user expression and query optimiser reasoning about such problems. Decades of research (latterly under the rubric…

Databases · Computer Science 2025-09-09 David Robert Pratten , Luke Mathieson , Fahimeh Ramezani

Reasoning about images/objects and their hierarchical interactions is a key concept for the next generation of computer vision approaches. Here we present a new framework to deal with it through a visual hierarchical context-based…

Computer Vision and Pattern Recognition · Computer Science 2019-09-04 Pedro H. Bugatti , Priscila T. M. Saito , Larry S. Davis

Constraint Handling Rules provide descriptions for constraint solvers. However, they fall short when those constraints specify some binding structure, like higher-rank types in a constraint-based type inference algorithm. In this paper, the…

Logic in Computer Science · Computer Science 2017-07-11 Alejandro Serrano , Jurriaan Hage

Refinement types are types equipped with predicates that specify preconditions and postconditions of underlying functional languages. We propose a general semantic construction of dependent refinement type systems from underlying type…

Logic in Computer Science · Computer Science 2020-10-19 Satoshi Kura

This paper seeks to apply categorical logic to the design of artificial intelligent agents that reason symbolically about objects more richly structured than sets. Using Johnstone's sequent calculus of terms- and formulae-in-context, we…

Artificial Intelligence · Computer Science 2025-04-29 Ralph Wojtowicz

Since the early Sixties and Seventies it has been known that the regular and context-free languages are characterized by definability in the monadic second-order theory of certain structures. More recently, these descriptive…

cmp-lg · Computer Science 2016-08-31 James Rogers

We present ReasonBert, a pre-training method that augments language models with the ability to reason over long-range relations and multiple, possibly hybrid contexts. Unlike existing pre-training methods that only harvest learning signals…

Computation and Language · Computer Science 2021-09-13 Xiang Deng , Yu Su , Alyssa Lees , You Wu , Cong Yu , Huan Sun

Text-to-image generative models often exhibit bias related to sensitive attributes. However, current research tends to focus narrowly on single-object prompts with limited contextual diversity. In reality, each object or attribute within a…

Computer Vision and Pattern Recognition · Computer Science 2025-11-11 Jeng-Lin Li , Ming-Ching Chang , Wei-Chao Chen

Case-based reasoning is known to play an important role in several legal settings. In this paper we focus on a recent approach to case-based reasoning, supported by an instantiation of abstract argumentation whereby arguments represent…

Artificial Intelligence · Computer Science 2023-10-31 Guilherme Paulino-Passos , Francesca Toni

Recent research has made significant progress in localizing and editing image regions based on text. However, most approaches treat these regions in isolation, relying solely on local cues without accounting for how each part contributes to…

Computer Vision and Pattern Recognition · Computer Science 2025-10-21 Thuy Phuong Vu , Dinh-Cuong Hoang , Minhhuy Le , Phan Xuan Tan

Definite descriptions are phrases of the form 'the $x$ such that $\varphi$', used to refer to single entities in a context. They are often more meaningful to users than individual names alone, in particular when modelling or querying data…

Logic in Computer Science · Computer Science 2021-06-30 Alessandro Artale , Andrea Mazzullo , Ana Ozaki , Frank Wolter

In human cognition, the binding problem describes the open question of how the brain flexibly integrates diverse information into cohesive object representations. Analogously, in machine learning, there is a pursuit for models capable of…

Machine Learning · Computer Science 2024-02-09 Sindy Löwe , Francesco Locatello , Max Welling

Relation Extraction (RE) aims to label relations between groups of marked entities in raw text. Most current RE models learn context-aware representations of the target entities that are then used to establish relation between them. This…

Computation and Language · Computer Science 2019-02-26 Gaurav Singh , Parminder Bhatia

We study how large language models (LLMs) reason about memorized knowledge through simple binary relations such as equality ($=$), inequality ($<$), and inclusion ($\subset$). Unlike in-context reasoning, the axioms (e.g., $a < b, b < c$)…

Machine Learning · Computer Science 2025-09-18 Jonathan Shaki , Emanuele La Malfa , Michael Wooldridge , Sarit Kraus

The relational semantics of linear logic is a powerful framework for defining resource-aware models of the $\lambda$-calculus. However, its quantitative aspects are not reflected in the preorders and equational theories induced by these…

Logic in Computer Science · Computer Science 2026-04-30 Adrienne Lancelot , Giulio Manzonetto , Guy McCusker , Gabriele Vanoni

Identifying metaphors in text is very challenging and requires comprehending the underlying comparison. The automation of this cognitive process has gained wide attention lately. However, the majority of existing approaches concentrate on…

Computation and Language · Computer Science 2020-10-13 Omnia Zayed , John P. McCrae , Paul Buitelaar

When we work with information from multiple sources, the formalism each employs to handle uncertainty may not be uniform. In order to be able to combine these knowledge bases of different formats, we need to first establish a common basis…

Artificial Intelligence · Computer Science 2013-02-18 Choh Man Teng

An answer set is a plain set of literals which has no further structure that would explain why certain literals are part of it and why others are not. We show how argumentation theory can help to explain why a literal is or is not contained…

Artificial Intelligence · Computer Science 2020-02-19 Claudia Schulz , Francesca Toni
‹ Prev 1 8 9 10 Next ›