English
Related papers

Related papers: Intransitive Linear Temporal Logic, Knowledge from…

200 papers

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

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

In this paper we intend to study implications in their most general form, generalizing different classes of implications including the Heyting implication, sub-structural implications and weak strict implications. Following the topological…

Logic · Mathematics 2020-04-23 Amirhossein Akbar Tabatabai

Predicting the future is an important component of decision making. In most situations, however, there is not enough information to make accurate predictions. In this paper, we develop a theory of causal reasoning for predictive inference…

Artificial Intelligence · Computer Science 2013-04-10 Thomas L. Dean , Keiji Kanazawa

We introduce a two-dimensional metric (interval) temporal logic whose internal and external time flows are dense linear orderings. We provide a suitable semantics and a sequent calculus with axioms for equality and extralogical axioms. Then…

Logic · Mathematics 2019-03-15 Stefano Baratella , Andrea Masini

This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…

Logic in Computer Science · Computer Science 2025-09-03 Seth Bulin

This paper investigates the finite time stabilization problem for a class of nonlinear systems with unknown control directions and unstructured uncertainties. The unstructured uncertainties indicate that not only the parameters but also the…

Systems and Control · Electrical Eng. & Systems 2024-10-30 Shiqi Zheng , Shihao Wang , Xiang Chen , Yuanlong Xie

One of the most remarkable things about the human moral mind is its flexibility. We can make moral judgments about cases we have never seen before. We can decide that pre-established rules should be broken. We can invent novel rules on the…

The goal of this paper is to extend classical logic with a generalized notion of inductive definition supporting positive and negative induction, to investigate the properties of this logic, its relationships to other logics in the area of…

Logic in Computer Science · Computer Science 2009-09-25 Marc Denecker

We propose LeanLTL, a unifying framework for linear temporal logics in Lean 4. LeanLTL supports reasoning about traces that represent either infinite or finite linear time. The library allows traditional LTL syntax to be combined with…

Logic in Computer Science · Computer Science 2025-07-03 Eric Vin , Kyle A. Miller , Daniel J. Fremont

Interval temporal logics provide a natural framework for qualitative and quantitative temporal reason- ing over interval structures, where the truth of formulae is defined over intervals rather than points. In this paper, we study the…

Logic in Computer Science · Computer Science 2011-06-08 Davide Bresolin , Angelo Montanari , Pietro Sala , Guido Sciavicco

In this paper, we do three kinds of work. First, we recognize four notions of necessity and two notions of possibility related to time flow, namely strong/weak historical/temporal necessities, as well as historical/temporal possibilities,…

Computation and Language · Computer Science 2025-11-18 Fengkui Ju , Woxuan Zhou

We correct our proof of a theorem stating that satisfiability of frequency linear-time temporal logic is undecidable [TASE 2012].

Logic in Computer Science · Computer Science 2020-10-02 Benedikt Bollig , Normann Decker , Martin Leucker

We study elementary modal logics, i.e. modal logic considered over first-order definable classes of frames. The classical semantics of modal logic allows infinite structures, but often practical applications require to restrict our…

Logic in Computer Science · Computer Science 2012-10-10 Jakub Michaliszyn , Jan Otop , Piotr Witkowski

We investigate the decidability of model-checking logics of time, knowledge and probability, with respect to two epistemic semantics: the clock and synchronous perfect recall semantics in partially observed discrete-time Markov chains.…

Logic in Computer Science · Computer Science 2015-11-11 Ron van der Meyden , Manas K. Patra

Linear logic was conceived in 1987 by Girard and, in contrast to classical logic, restricts the usage of the structural inference rules of weakening and contraction. With this, atoms of the logic are no longer interpreted as truth, but as…

Logic in Computer Science · Computer Science 2021-10-04 Florian Chudigiewitsch

The Halpern-Shoham logic is a modal logic of time intervals. Some effort has been put in last ten years to classify fragments of this beautiful logic with respect to decidability of its satisfiability problem. We contribute to this effort…

Logic in Computer Science · Computer Science 2010-10-22 Jerzy Marcinkowski , Jakub Michaliszyn

In many situations humans have to reason with inconsistent knowledge. These inconsistencies may occur due to not fully reliable sources of information. In order to reason with inconsistent knowledge, it is not possible to view a set of…

Artificial Intelligence · Computer Science 2024-12-16 Nico Roos

Time series classification is a task of paramount importance, as this kind of data often arises in safety-critical applications. However, it is typically tackled with black-box deep learning methods, making it hard for humans to understand…

Machine Learning · Computer Science 2025-08-28 Irene Ferfoglia , Simone Silvetti , Gaia Saveri , Laura Nenzi , Luca Bortolussi

Hypertrace logic is a sorted first-order logic with separate sorts for time and execution traces. Its formulas specify hyperproperties, which are properties relating multiple traces. In this work, we extend hypertrace logic by introducing…

Logic in Computer Science · Computer Science 2025-10-15 Marek Chalupa , Thomas A. Henzinger , Ana Oliveira da Costa

There are many ways we can not know. Even in systems that we created ourselves, as, for example, systems in mathematical logic, Go\"edel and Tarski's theorems impose limits on what we can know. As we try to speak of the real world, things…

History and Philosophy of Physics · Physics 2020-06-04 André C. R. Martins
‹ Prev 1 4 5 6 7 8 10 Next ›