English
Related papers

Related papers: Model-theoretic Characterizations of Existential R…

200 papers

When we speak, write or listen, we continuously make predictions based on our knowledge of a language's grammar. Remarkably, children acquire this grammatical knowledge within just a few years, enabling them to understand and generalise to…

Computation and Language · Computer Science 2024-11-26 Jaap Jumelet

Large language models (LLMs) are a promising venue for natural language understanding and generation tasks. However, current LLMs are far from reliable: they are prone to generate non-factual information and, more crucially, to contradict…

Machine Learning · Computer Science 2024-04-22 Diego Calanzone , Stefano Teso , Antonio Vergari

Ontologies and automated reasoning are the building blocks of the Semantic Web initiative. Derivation rules can be included in an ontology to define derived concepts, based on base concepts. For example, rules allow to define the extension…

Artificial Intelligence · Computer Science 2011-11-02 Anastasia Analyti , Grigoris Antoniou , Carlos Viegas Damásio , Gerd Wagner

Existential rules have been proposed for representing ontological knowledge, specifically in the context of Ontology- Based Data Access. Entailment with existential rules is undecidable. We focus in this paper on conditions that ensure the…

Artificial Intelligence · Computer Science 2014-07-28 Jean-François Baget , Fabien Garreau , Marie-Laure Mugnier , Swan Rocher

We introduce some new logics of imperfect information by adding atomic formulas corresponding to inclusion and exclusion dependencies to the language of first order logic. The properties of these logics and their relationships with other…

Logic · Mathematics 2011-06-14 Pietro Galliani

A class of interval-based temporal languages for uniformly representing and reasoning about actions and plans is presented. Actions are represented by describing what is true while the action itself is occurring, and plans are constructed…

Artificial Intelligence · Computer Science 2011-05-30 A. Artale , E. Franconi

Syntactic Transformer language models aim to achieve better generalization through simultaneously modeling syntax trees and sentences. While prior work has been focusing on adding constituency-based structures to Transformers, we introduce…

Computation and Language · Computer Science 2024-07-25 Yida Zhao , Chao Lou , Kewei Tu

A modelling language is described which is suitable for the correlation of information when the underlying functional model of the system is incomplete or uncertain and the temporal dependencies are imprecise. An efficient and incremental…

Artificial Intelligence · Computer Science 2013-02-08 John Bigham

Modal logics are widely used in multi-agent systems to reason about actions, abilities, norms, or epistemic states. Combined with description logic languages, they are also a powerful tool to formalise modal aspects of ontology-based…

Logic in Computer Science · Computer Science 2023-07-25 Tiziano Dalmonte , Andrea Mazzullo , Ana Ozaki , Nicolas Troquard

Language enables humans to share knowledge, reason about the world, and pass on strategies for survival and innovation across generations. At the heart of this process is not just the ability to communicate but also the remarkable…

Computation and Language · Computer Science 2026-02-25 Jan Philip Wahle

Several queries and scores have recently been proposed to explain individual predictions over ML models. Given the need for flexible, reliable, and easy-to-apply interpretability methods for ML models, we foresee the need for developing…

Artificial Intelligence · Computer Science 2021-11-16 Marcelo Arenas , Daniel Baez , Pablo Barceló , Jorge Pérez , Bernardo Subercaseaux

Dependently typed programming languages have become increasingly relevant in recent years. They have been adopted in industrial strength programming languages and have been extremely successful as the basis for theorem provers. There are…

Programming Languages · Computer Science 2024-04-09 Christophe Scholliers

Relation-changing modal logics are extensions of the basic modal logic that allow changes to the accessibility relation of a model during the evaluation of a formula. In particular, they are equipped with dynamic modalities that are able to…

Logic in Computer Science · Computer Science 2016-09-15 Carlos Areces , Raul Fervari , Guillaume Hoffmann , Mauricio Martel

The categorical models of the differential lambda-calculus are additive categories because of the Leibniz rule which requires the summation of two expressions. This means that, as far as the differential lambda-calculus and differential…

Logic in Computer Science · Computer Science 2024-02-14 Thomas Ehrhard

Artificial intelligence and machine learning algorithms have become ubiquitous. Although they offer a wide range of benefits, their adoption in decision-critical fields is limited by their lack of interpretability, particularly with textual…

Machine Learning · Computer Science 2023-01-27 Diego Antognini

We study the interaction of views, queries, and background knowledge in the form of existential rules. The motivating questions concern monotonic determinacy of a query using views w.r.t. rules, which refers to the ability to recover the…

Databases · Computer Science 2024-07-23 Michael Benedikt , Stanislav Kikot , Johannes Marti , Piotr Ostropolski-Nalewaja

This paper investigates the inherent knowledge in language models from the perspective of epistemological holism. The purpose of this paper is to explore whether LLMs exhibit characteristics consistent with epistemological holism. These…

Computation and Language · Computer Science 2024-03-20 Minsu Kim , James Thorne

A well-established and fundamental insight in database theory is that negation (also known as complementation) tends to make queries difficult to process and difficult to reason about. Many basic problems are decidable and admit practical…

Databases · Computer Science 2012-03-02 Vince Barany , Balder ten Cate , Martin Otto

We introduce Language World Models, a class of language-conditional generative model which interpret natural language messages by predicting latent codes of future observations. This provides a visual grounding of the message, similar to an…

Computation and Language · Computer Science 2020-02-25 Alexander I. Cowen-Rivers , Jason Naradowsky

Regular synchronization languages can be used to define rational relations of finite words, and to characterize subclasses of rational relations, like automatic or recognizable relations. We provide a systematic study of the decidability of…

Formal Languages and Automata Theory · Computer Science 2024-02-14 Christof Löding , Sarah Winter