English
Related papers

Related papers: Thou Shalt is not You Will

200 papers

The paper studies problems of satisfiability, decidability and admissibility of inference rules, conceptions of knowledge and agent's knowledge in non-transitive temporal linear logic LTL(Past,m). We find algorithms solving mentioned…

Logic in Computer Science · Computer Science 2014-06-12 Vladimir Rybakov

We investigate the limitations of random trials when the cause of interest is confounded with the effect by formalizing a counterfactual policy-space where the agent's natural predilection is input to a soft-intervention.

Artificial Intelligence · Computer Science 2022-06-07 Erik Skalnes

The temporal aspect is a significant dimension of our reality. We notice the challenge that large language models (LLMs) face when engaging in temporal reasoning. Our preliminary experiments show that methods involving the generation of…

Computation and Language · Computer Science 2024-11-05 Xingxuan Li , Liying Cheng , Qingyu Tan , Hwee Tou Ng , Shafiq Joty , Lidong Bing

We present a multi-modal action logic with first-order modalities, which contain terms which can be unified with the terms inside the subsequent formulas and which can be quantified. This makes it possible to handle simultaneously time and…

Artificial Intelligence · Computer Science 2007-05-23 Camilla Schwind

In this paper, we provide more evidence for the contention that logical consequence should be understood in normative terms. Hartry Field and John MacFarlane covered the classical case. We extend their work, examining what it means for an…

Logic in Computer Science · Computer Science 2014-02-20 Julio Lemos

Counterfactual reasoning has emerged as a crucial technique for generalizing the reasoning capabilities of large language models (LLMs). By generating and analyzing counterfactual scenarios, researchers can assess the adaptability and…

Artificial Intelligence · Computer Science 2026-02-17 Shuai Yang , Qi Yang , Luoxi Tang , Yuqiao Meng , Nancy Guo , Jeremy Blackburn , Zhaohan Xi

Defeasible logics provide several linguistic features to support the expression of defeasible knowledge. There is also a wide variety of such logics, expressing different intuitions about defeasible reasoning. However, the logics can only…

Logic in Computer Science · Computer Science 2021-02-16 Guido Governatori , Michael J. Maher

Modal logic is a paradigm for several useful and applicable formal systems in computer science. It generally retains the low complexity of classical propositional logic, but notable exceptions exist in the domains of description, temporal,…

Logic in Computer Science · Computer Science 2016-09-15 Davide Bresolin , Emilio Muñoz-Velasco , Guido Sciavicco

This paper investigates the extension of lattice-based logics into modal languages. We observe that such extensions admit multiple approaches, as the interpretation of the necessity operator is not uniquely determined by the underlying…

Logic in Computer Science · Computer Science 2025-10-01 Alfredo R. Freire , Manuel A. Martins

We introduce and investigate a family of consequence relations with the goal of capturing certain important patterns of data-driven inference. The inspiring idea for our framework is the fact that data may reject, possibly to some degree,…

Logic · Mathematics 2024-08-23 Paolo Baldi , Esther Anna Corsi , Hykel Hosni

In this paper we propose a many-valued temporal conditional logic. We start from a many-valued logic with typicality, and extend it with the temporal operators of the Linear Time Temporal Logic (LTL), thus providing a formalism which is…

Logic in Computer Science · Computer Science 2024-09-17 Mario Alviano , Laura Giordano , Daniele Theseider Dupré

We discuss representing and reasoning with knowledge about the time-dependent utility of an agent's actions. Time-dependent utility plays a crucial role in the interaction between computation and action under bounded resources. We present a…

Artificial Intelligence · Computer Science 2013-03-26 Eric J. Horvitz , Geoffrey Rutledge

Ontologies formalise how the concepts from a given domain are interrelated. Despite their clear potential as a backbone for explainable AI, existing ontologies tend to be highly incomplete, which acts as a significant barrier to their more…

Artificial Intelligence · Computer Science 2021-05-12 Steven Schockaert , Yazmín Ibáñez-García , Víctor Gutiérrez-Basulto

Metric Temporal Logic, $\mtlfull$ is amongst the most studied real-time logics. It exhibits considerable diversity in expressiveness and decidability properties based on the permitted set of modalities and the nature of time interval…

Logic in Computer Science · Computer Science 2013-11-28 Khushraj Madnani , Shankara Narayanan Krishna , Paritosh K. Pandya

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

I consider the following generic scenario: an abstract model M of some 'real' system is only partially presented, or partially known to us, and we have to ensure that the actual system satisfies a given specification, formalised in some…

Logic in Computer Science · Computer Science 2020-12-24 Valentin Goranko

Much of the recent work developing formal methods techniques to specify or learn the behavior of autonomous systems is predicated on a belief that formal specifications are interpretable and useful for humans when checking systems. Though…

Artificial Intelligence · Computer Science 2023-05-30 Ho Chit Siu , Kevin Leahy , Makai Mann

Contextuality and nonlocality are non-classical properties exhibited by quantum statistics whose implications profoundly impact both foundations and applications of quantum theory. In this paper we provide some insights into logical…

Quantum Physics · Physics 2021-08-11 Leonardo Santos , Barbara Amaral

While large language models are able to retain vast amounts of world knowledge seen during pretraining, such knowledge is prone to going out of date and is nontrivial to update. Furthermore, these models are often used under temporal…

Computation and Language · Computer Science 2024-03-06 Michael J. Q. Zhang , Eunsol Choi

In the literature, two powerful temporal logic formalisms have been proposed for expressing information flow security requirements, that in general, go beyond regular properties. One is classic, based on the knowledge modalities of…

Logic in Computer Science · Computer Science 2014-09-10 Laura Bozzelli , Bastien Maubert , Sophie Pinchinat