English
Related papers

Related papers: Grounding Operators: Transitivity and Trees, Logic…

200 papers

We introduce a novel language for reasoning about agents' cognitive attitudes of both epistemic and motivational type. We interpret it by means of a computationally grounded semantics using belief bases. Our language includes five types of…

Logic in Computer Science · Computer Science 2024-12-19 Tiago de Lima , Emiliano Lorini , Elise Perrotin , François Schwarzentruber

Humans can ground natural language commands to tasks at both abstract and fine-grained levels of specificity. For instance, a human forklift operator can be instructed to perform a high-level action, like "grab a pallet" or a low-level…

Artificial Intelligence · Computer Science 2018-06-20 Dilip Arumugam , Siddharth Karamcheti , Nakul Gopalan , Lawson L. S. Wong , Stefanie Tellex

Recent attempts to support high-level scene interpretation and planning in Autonomous Vehicles (AVs) using ensembles of Large Language Models (LLMs) and Large Multimodal Models (LMMs) continue to treat time as a secondary property. This…

Artificial Intelligence · Computer Science 2026-05-20 Ahmed Y. Gado , Omar Y. Goba , Alaa Hassanein , Catherine M. Elias , Ahmed Hussein

Force-directed layout algorithms are ubiquitously-used tools for network visualisation across a multitude of scientific disciplines. However, they lack theoretical grounding which allows to interpret their outcomes rigorously and can guide…

Social and Information Networks · Computer Science 2025-05-14 Felix Gaisbauer , Armin Pournaki , Sven Banisch , Eckehard Olbrich

Physics-based reinforcement learning tasks can benefit from simplified physics simulators as they potentially allow near-optimal policies to be learned in simulation. However, such simulators require the latent factors (e.g. mass, friction…

Machine Learning · Computer Science 2022-02-14 Buddhika Laknath Semage , Thommen George Karimpanal , Santu Rana , Svetha Venkatesh

We introduce a new family of temporal logics designed to finely balance the trade-off between expressivity and complexity. Their key feature is the possibility of defining operators of a new kind that we call transformation operators. Some…

Logic in Computer Science · Computer Science 2024-09-09 Alessandro Ronca

Following several papers in the prior literature, we study the relationship between order bounded operators, topologically bounded operators and topologically continuous operators. Our main contribution is two folded: (i) we provide a set…

Functional Analysis · Mathematics 2018-04-12 Liang Hong

We consider entailment problems involving powerful constraint languages such as guarded existential rules, in which additional semantic restrictions are put on a set of distinguished relations. We consider restricting a relation to be…

Databases · Computer Science 2019-03-21 Antoine Amarilli , Michael Benedikt , Pierre Bourhis , Michael Vanden Boom

Logical reasoning is central to complex human activities, such as thinking, debating, and planning; it is also a central component of many AI systems as well. In this paper, we investigate the extent to which encoder-only transformer…

Computation and Language · Computer Science 2024-07-02 Paulo Pirozelli , Marcos M. José , Paulo de Tarso P. Filho , Anarosa A. F. Brandão , Fabio G. Cozman

We present a new approach to the global fairness verification of tree-based classifiers. Given a tree-based classifier and a set of sensitive features potentially leading to discrimination, our analysis synthesizes sufficient conditions for…

Machine Learning · Computer Science 2022-09-28 Stefano Calzavara , Lorenzo Cazzaro , Claudio Lucchese , Federico Marcuzzi

Grounding has been argued to be a crucial component towards the development of more complete and truly semantically competent artificial intelligence systems. Literature has divided into two camps: While some argue that grounding allows for…

Computation and Language · Computer Science 2023-10-19 Timothee Mickus , Elaine Zosa , Denis Paperno

An inductive inference system for proving validity of formulas in the initial algebra $T_{\mathcal{E}}$ of an order-sorted equational theory $\mathcal{E}$ is presented. It has 20 inference rules, but only 9 of them require user interaction;…

Logic in Computer Science · Computer Science 2024-05-07 Jose Meseguer

We give a brief account of the modal logic of the generic multiverse, which is a bimodal logic with operators corresponding to the relations "is a forcing extension of" and "is a ground model of". The fragment of the first relation is…

Logic · Mathematics 2012-08-28 Joel David Hamkins , Benedikt Löwe

We consider entailment problems involving powerful constraint languages such as frontier-guarded existential rules in which we impose additional semantic restrictions on a set of distinguished relations. We consider restricting a relation…

Logic in Computer Science · Computer Science 2022-02-18 Antoine Amarilli , Michael Benedikt , Pierre Bourhis , Michael Vanden Boom

The AI community is increasingly putting its attention towards combining symbolic and neural approaches, as it is often argued that the strengths and weaknesses of these approaches are complementary. One recent trend in the literature are…

Artificial Intelligence · Computer Science 2021-10-12 Emile van Krieken , Erman Acar , Frank van Harmelen

Ontological representations of qualities, dispositions, and roles have been refined over the past decade, clarifying subtle distinctions in life science research. After articulating a widely-used characterization of these entities within…

Artificial Intelligence · Computer Science 2024-05-02 Michael Rabenberg , Carter Benson , Federico Donato , Yongqun He , Anthony Huffman , Shane Babcock , John Beverley

We study weighted composition operators acting between Fock spaces. The following results are obtained: (1) Criteria for the boundedness and compactness; (2) Characterizations of compact differences and essential norm; (3) Complete…

Complex Variables · Mathematics 2017-04-13 Pham Trong Tien , Le Hai Khoi

The classical belief revision framework, as proposed by Alchourron, Gardenfors, and Makinson, involves the revision of a theory based on eight postulates. In this paper, we focus on the exploration of a revision theory grounded in quantum…

Quantum Physics · Physics 2024-05-31 Heng Zhou , Yongjun Wang , Baoshan Wang , Jian Yan , Xiaoyang Wang

This paper develops a process-based account of scientific explanation that reconceives grounding in terms of stabilisation. Grounding theories capture hierarchical dependence but lack criteria for when explanations remain adequate under…

History and Philosophy of Physics · Physics 2026-01-05 Jonathon Sendall

Developing neural architectures that are capable of logical reasoning has become increasingly important for a wide range of applications (e.g., natural language processing). Towards this grand objective, we propose a symbolic reasoning…

Computation and Language · Computer Science 2022-10-25 Jianyi Zhang , Yiran Chen , Jianshu Chen