DeepAI AI Chat
Log In Sign Up

Possibilistic decreasing persistence

by   Dimiter Driankov, et al.

A key issue in the handling of temporal data is the treatment of persistence; in most approaches it consists in inferring defeasible confusions by extrapolating from the actual knowledge of the history of the world; we propose here a gradual modelling of persistence, following the idea that persistence is decreasing (the further we are from the last time point where a fluent is known to be true, the less certainly true the fluent is); it is based on possibility theory, which has strong relations with other well-known ordering-based approaches to nonmonotonic reasoning. We compare our approach with Dean and Kanazawa's probabilistic projection. We give a formal modelling of the decreasing persistence problem. Lastly, we show how to infer nonmonotonic conclusions using the principle of decreasing persistence.


page 1

page 2

page 3

page 4


Persistence Partial Matchings Induced by Morphisms between Persistence Modules

The notion of persistence partial matching, as a generalization of parti...

Probabilistic Causal Reasoning

Predicting the future is an important component of decision making. In m...

One Diamond to Rule Them All: Old and new topics about zigzag, levelsets and extended persistence

Extended and zigzag persistence were introduced more than ten years ago,...

On the Persistence of Higher-Order Interactions in Real-World Hypergraphs

A hypergraph is a generalization of an ordinary graph, and it naturally ...

Persistence Lenses: Segmentation, Simplification, Vectorization, Scale Space and Fractal Analysis of Images

A persistence lens is a hierarchy of disjoint upper and lower level sets...

Revisiting Graph Persistence for Updates and Efficiency

It is well known that ordinary persistence on graphs can be computed mor...

Control Frequency Adaptation via Action Persistence in Batch Reinforcement Learning

The choice of the control frequency of a system has a relevant impact on...