English
Related papers

Related papers: When Do You Start Counting? Revisiting Counting an…

200 papers

Metric Temporal Logic (MTL) is a popular formalism to specify temporal patterns with timing constraints over the behavior of cyber-physical systems with application areas ranging in property-based testing, robotics, optimization, and…

Logic in Computer Science · Computer Science 2026-03-11 Dogan Ulus

The recent technique for estimating lower bounds of the prime counting function $\pi(x)=#\{p \leq x: p\text{ prime}\}$ by means of the irrationality measures $\mu(\zeta(s)) \geq 2$ of special values of the zeta function claims that $\pi(x)…

General Mathematics · Mathematics 2019-11-28 N. A. Carella

While there are many identities involving the Euler and Bernoulli numbers, they are usually proved analytically or inductively. We prove two identities involving Euler and Bernoulli numbers with combinatorial reasoning via up-down…

Combinatorics · Mathematics 2020-07-27 Arthur T. Benjamin , John Lentfer , Thomas C. Martinez

Linear Temporal Logic (LTL) is the standard specification language for reactive systems and is successfully applied in industrial settings. However, many shortcomings of LTL have been identified in the literature, among them the limited…

Logic in Computer Science · Computer Science 2021-04-30 Daniel Neider , Alexander Weinert , Martin Zimmermann

There are two natural and well-studied approaches to temporal ontology and reasoning: point-based and interval-based. Usually, interval-based temporal reasoning deals with points as a particular case of duration-less intervals. A recent…

Logic in Computer Science · Computer Science 2023-06-22 Willem Conradie , Salih Durhan , Guido Sciavicco

Large Language Models (LLMs) have shown impressive performance in mathematical reasoning tasks when guided by Chain-of-Thought (CoT) prompting. However, they tend to produce highly confident yet incorrect outputs, which poses significant…

Machine Learning · Computer Science 2025-06-11 Zhenjiang Mao , Artem Bisliouk , Rohith Reddy Nama , Ivan Ruchkin

Inference-time computation has emerged as a promising scaling axis for improving large language model reasoning. However, despite yielding impressive performance, the optimal allocation of inference-time computation remains poorly…

Machine Learning · Computer Science 2026-01-12 Parsa Mirtaheri , Ezra Edelman , Samy Jelassi , Eran Malach , Enric Boix-Adsera

In the wake of the recent resurgence of the Datalog language of databases, together with its extensions for ontological reasoning settings, this work aims to bridge the gap between the theoretical studies of DatalogMTL (Datalog extended…

Databases · Computer Science 2025-06-11 Luigi Bellomarini , Livia Blasi , Markus Nissl , Emanuel Sallinger

We consider the problem of counting the number of answers to a first-order formula on a finite structure. We present and study an extension of first-order logic in which algorithms for this counting problem can be naturally and conveniently…

Logic in Computer Science · Computer Science 2017-04-21 Hubie Chen , Stefan Mengel

Large Language Models (LLMs) are widely used for writing economic analysis reports or providing financial advice, but their ability to understand economic knowledge and reason about potential results of specific economic events lacks…

Computation and Language · Computer Science 2024-07-02 Yue Guo , Yi Yang

Warning: This paper contains a mistake, rendering the proof of the main theorem invalid. The logic of Bunched Implications (BI) combines both additive and multiplicative connectives, which include two primitive intuitionistic implications.…

Logic in Computer Science · Computer Science 2024-04-15 Alexander Gheorghiu , Simon Docherty , David Pym

Counting ad infinitum is the holographic observable to a statistical dynamics with finite states under independent repeated sampling. Entropy provides the infinitesimal probability for an observed frequency $\hat{\boldsymbol{\nu}}$ w.r.t. a…

Statistical Mechanics · Physics 2025-01-14 Hong Qian

Probabilistic argumentation allows reasoning about argumentation problems in a way that is well-founded by probability theory. However, in practice, this approach can be severely limited by the fact that probabilities are defined by adding…

Artificial Intelligence · Computer Science 2019-03-07 Nico Potyka

Hyperproperties are properties of sets of computation traces. In this paper, we study quantitative hyperproperties, which we define as hyperproperties that express a bound on the number of traces that may appear in a certain relation. For…

Logic in Computer Science · Computer Science 2019-06-03 Bernd Finkbeiner , Christopher Hahn , Hazem Torfah

This note is concerned with a formal analysis of the problem of non-monotonic reasoning in intelligent systems, especially when the uncertainty is taken into account in a quantitative way. A firm connection between logic and probability is…

Artificial Intelligence · Computer Science 2013-04-05 Hung-Trung Nguyen

Hyperproperties generalize trace properties by expressing relations between multiple computations. Hyperpropertes include policies from information-flow security, like observational determinism or non-interference, and many other system…

Logic in Computer Science · Computer Science 2021-07-27 Bernd Finkbeiner

We enhance elementary quantum mechanics with three simple postulates that enable us to define time observable. We discuss shortly justification of the new postulates and illustrate the concept with the detailed analysis of a delta function…

Quantum Physics · Physics 2008-02-03 Ph. Blanchard , A. Jadczyk

The concept of time mostly plays a subordinate role in finance and economics. The assumption is that time flows continuously and that time series data should be analyzed at regular, equidistant intervals. Nonetheless, already nearly 60…

Statistical Finance · Quantitative Finance 2024-06-12 James B. Glattfelder , Richard B. Olsen

We demonstrate that temporal observables, which are sensitive to a system's history (as opposed to its state), implicate entangled histories. We exemplify protocols for measuring such observables, and algorithms for predicting the…

Quantum Physics · Physics 2017-02-21 Jordan Cotler , Frank Wilczek

In this paper, we prove measurability of event for which a general continuous-time stochastic process satisfies continuous-time Metric Temporal Logic (MTL) formula. Continuous-time MTL can define temporal constrains for physical system in…

Logic in Computer Science · Computer Science 2024-08-07 Mitsumasa Ikeda , Yoriyuki Yamagata , Takayuki Kihara