English
Related papers

Related papers: Possibilistic decreasing persistence

200 papers

This paper shows that the fuzzy temporal logic can model figures of thought to describe decision-making behaviors. In order to exemplify, some economic behaviors observed experimentally were modeled from problems of choice containing time,…

Artificial Intelligence · Computer Science 2019-02-18 José Cláudio do Nascimento

We give a decomposition of the posterior predictive variance using the law of total variance and conditioning on a finite dimensional discrete random variable. This random variable summarizes various features of modeling that are used to…

Methodology · Statistics 2022-09-02 Dean Dustin , Bertrand Clarke

The problem of Information Retrieval is, given a set of documents D and a query q, providing an algorithm for retrieving all documents in D relevant to q. However, retrieval should depend and be updated whenever the user is able to provide…

Information Retrieval · Computer Science 2007-05-23 Gianni Amati , Konstantinos Georgatos

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

Abductive reasoning aims to find plausible explanations for an event. This style of reasoning is critical for commonsense tasks where there are often multiple plausible explanations. Existing approaches for abductive reasoning in natural…

Computation and Language · Computer Science 2023-05-25 Wenting Zhao , Justin T. Chiu , Claire Cardie , Alexander M. Rush

Time series forecasting models are becoming increasingly prevalent due to their critical role in decision-making across various domains. However, most existing approaches represent the coupled temporal patterns, often neglecting the…

Machine Learning · Computer Science 2025-09-26 Jintao Zhang , Mingyue Cheng , Xiaoyu Tao , Zhiding Liu , Daoyu Wang

Defeasible statements are statements that are likely, or probable, or usually true, but may occasionally be false. Plausible reasoning makes conclusions from statements that are either facts or defeasible statements without using numbers.…

Artificial Intelligence · Computer Science 2026-04-22 David Billington

This paper studies axioms for nonmonotonic consequences from a semantics-based point of view, focusing on a class of mathematical structures for reasoning about partial information without a predefined syntax/logic. This structure is called…

Logic in Computer Science · Computer Science 2007-05-23 Guo-Qiang Zhang

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 settings from fact-checking to question answering, we frequently want to know whether a collection of evidence (premises) entails a hypothesis. Existing methods primarily focus on the end-to-end discriminative version of this task, but…

Computation and Language · Computer Science 2022-10-31 Kaj Bostrom , Zayne Sprague , Swarat Chaudhuri , Greg Durrett

A fundamental question in causal inference is whether it is possible to reliably infer manipulation effects from observational data. There are a variety of senses of asymptotic reliability in the statistical literature, among which the most…

Artificial Intelligence · Computer Science 2012-12-12 Jiji Zhang , Peter L. Spirtes

A generalization of fluctuation theorems in stochastic processes is proposed. The new theorem is written in terms of posterior probabilities, which are introduced via the Bayes theorem. In usual fluctuation theorems, a forward path and its…

Statistical Mechanics · Physics 2015-05-14 Jun Ohkubo

Recently, there has been considerable progress on designing algorithms with provable guarantees -- typically using linear algebraic methods -- for parameter learning in latent variable models. But designing provable algorithms for inference…

Machine Learning · Computer Science 2016-05-30 Sanjeev Arora , Rong Ge , Frederic Koehler , Tengyu Ma , Ankur Moitra

Non-parametric detrending or noise reduction methods are often employed to separate trends from noisy time series when no satisfactory models exist to fit the data. However, conventional detrending methods depend on subjective choices of…

Chaotic Dynamics · Physics 2017-03-29 James PL Tan

An ordinal view of independence is studied in the framework of possibility theory. We investigate three possible definitions of dependence, of increasing strength. One of them is the counterpart to the multiplication law in probability…

Artificial Intelligence · Computer Science 2013-02-28 Didier Dubois , Luis Farinas del Cerro , Andreas Herzig , Henri Prade

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

A central paradigm behind process semantics based on observability and testing is that the exact moment of occurring of an internal nondeterministic choice is unobservable. It is natural, therefore, for this property to hold when the…

Logic in Computer Science · Computer Science 2009-07-10 Sonja Georgievska , Suzana Andova

People often deviate from expected utility theory when making risky and intertemporal choices. While the effects of probabilistic risk and time delay have been extensively studied in isolation, their interplay and underlying theoretical…

Theoretical Economics · Economics 2025-04-10 Ho Ka Chan , Taro Toyoizumi

Certain renewal theorems are extended to the case that the rate of the renewal process goes to 0 and, more generally, to the case that the drift of the random walk goes to infinity. These extensions are motivated by and applied to the…

Statistics Theory · Mathematics 2013-11-12 Georgios Fellouris

The Collatz conjecture is explored using polynomials based on a binary numeral system. It is shown that the degree of the polynomials, on average, decreases after a finite number of steps of the Collatz operation, which provides a weak…

Number Theory · Mathematics 2019-05-22 Feng Pan , Jerry P. Draayer