English
Related papers

Related papers: Inquisitive Team Semantics of LTL

200 papers

We evaluate LLMs' language understanding capacities on simple inference tasks that most humans find trivial. Specifically, we target (i) grammatically-specified entailments, (ii) premises with evidential adverbs of uncertainty, and (iii)…

Computation and Language · Computer Science 2024-04-12 Victoria Basmov , Yoav Goldberg , Reut Tsarfaty

We present the logic IBV, which is an intuitionistic version of BV, in the sense that its restriction to the MLL connectives is exactly IMLL, the intuitionistic version of MLL. For this logic we give a deep inference proof system and show…

Logic in Computer Science · Computer Science 2026-04-27 Matteo Acclavio , Lutz Strassburger

This paper proposes new semantics for nondeterministic program execution, replacing the standard relational semantics for propositional dynamic logic (PDL). Under these new semantics, program execution is represented as fundamentally…

Logic in Computer Science · Computer Science 2018-03-23 Adam Bjorndahl

There is a growing interest on formal methods-based robotic planning for temporal logic objectives. In this work, we extend the scope of existing synthesis methods to hyper-temporal logics. We are motivated by the fact that important…

Robotics · Computer Science 2020-04-30 Yu Wang , Siddhartha Nalluri , Miroslav Pajic

Although large language models (LLMs) have demonstrated remarkable performance, the lack of transparency in their inference logic raises concerns about their trustworthiness. To gain a better understanding of LLMs, we conduct a detailed…

Computation and Language · Computer Science 2024-07-26 Jie Ren , Qipeng Guo , Hang Yan , Dongrui Liu , Quanshi Zhang , Xipeng Qiu , Dahua Lin

Much of human communication depends on implication, conveying meaning beyond literal words to express a wider range of thoughts, intentions, and feelings. For models to better understand and facilitate human communication, they must be…

Computation and Language · Computer Science 2025-01-20 Shreya Havaldar , Hamidreza Alvari , John Palowitch , Mohammad Javad Hosseini , Senaka Buthpitiya , Alex Fabrikant

We establish a correspondence between (fragments of) $\mathcal{TEL}^\bigcirc$, a temporal extension of the $\mathcal{EL}$ description logic with the LTL operator $\bigcirc^k$, and some specific kinds of formal grammars, in particular,…

Logic in Computer Science · Computer Science 2025-08-04 Camille Bourgaux , Anton Gnatenko , Michaël Thomazo

Interactive Task Learning (ITL) concerns learning about unforeseen domain concepts via natural interactions with human users. The learner faces a number of significant constraints: learning should be online, incremental and few-shot, as it…

Computation and Language · Computer Science 2023-05-08 Jonghyuk Park , Alex Lascarides , Subramanian Ramamoorthy

We study dynamic changes of agents' observational power in logics of knowledge and time. We consider CTL*K, the extension of CTL* with knowledge operators, and enrich it with a new operator that models a change in an agent's way of…

Logic in Computer Science · Computer Science 2018-09-05 Aurèle Barrière , Bastien Maubert , Aniello Murano , Sasha Rubin

Hyperproperties are system properties that relate multiple execution traces and commonly occur when specifying information-flow and security policies. Logics like HyperLTL utilize explicit quantification over execution traces to express…

Logic in Computer Science · Computer Science 2025-12-30 Raven Beutner , Bernd Finkbeiner

In this paper we introduce a new logical foundation of SAND attack trees in intuitionistic linear logic. This new foundation is based on a new logic called the Attack Tree Linear Logic (ATLL). Before introducing ATLL we given several new…

Logic in Computer Science · Computer Science 2018-01-23 Harley Eades

Consider a community of scientists whose labs are each capable of conducting a different set of experiments. The scientists want to work together to confirm a new hypothesis, but to ensure blindness, their labs generally prohibit the…

Logic in Computer Science · Computer Science 2026-05-01 Siddharth Namachivayam

This paper surveys main and recent studies on temporal logics in a broad sense by presenting various logic systems, dealing with various time structures, and discussing important features, such as decidability (or undecidability) results,…

Logic in Computer Science · Computer Science 2013-08-06 Savas Konur

Defeasible logic is a rule-based nonmonotonic logic, with both strict and defeasible rules, and a priority relation on rules. We show that inference in the propositional form of the logic can be performed in linear time. This contrasts…

Artificial Intelligence · Computer Science 2009-09-29 Michael J. Maher

The present work aims to give a unity of logic via standard sequential, unpolarized games. Specifically, our vision is that there must be mathematically precise concepts of linear refinement and intuitionistic restriction of logic such that…

Logic · Mathematics 2019-12-17 Norihiro Yamada

We identify a subproblem of the model-checking problem for the epistemic \mu-calculus which is decidable. Formulas in the instances of this subproblem allow free variables within the scope of epistemic modalities in a restricted form that…

Computer Science and Game Theory · Computer Science 2013-10-28 Rodica Bozianu , Catalin Dima , Constantin Enea

This paper provides a novel metametaphysical approach to quantum indeterminacy. More specifically, it argues that bivalent quantum logic can successfully account for this kind of indeterminacy, given the non-truth-functional character of…

History and Philosophy of Physics · Physics 2025-01-28 Claudio Calosi , Iulian D. Toader

Zero-shot learning (ZSL) aims to recognize unseen classes by aligning images with intermediate class semantics, like human-annotated concepts or class definitions. An emerging alternative leverages Large-scale Language Models (LLMs) to…

Computer Vision and Pattern Recognition · Computer Science 2025-05-07 Zihan Ye , Shreyank N Gowda , Shiming Chen , Yaochu Jin , Kaizhu Huang , Xiaobo Jin

In temporal logics, a central question is about the choice of modalities and their relative expressive power, in comparison to the complexity of decision problems such as satisfiability. In this tutorial, we will illustrate the study of…

Logic in Computer Science · Computer Science 2017-03-08 Kamal Lodaya , Paritosh K. Pandya

Information-flow policies prescribe which information is available to a given user or subsystem. We study the problem of specifying such properties in reactive systems, which may require dynamic changes in information-flow restrictions…

Logic in Computer Science · Computer Science 2021-05-06 Ezio Bartocci , Thomas Ferrère , Thomas A. Henzinger , Dejan Nickovic , Ana Oliveira da Costa
‹ Prev 1 8 9 10 Next ›