𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Point algebras for temporal reasoning: Algorithms and complexity

✍ Scribed by Mathias Broxvall; Peter Jonsson

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
447 KB
Volume
149
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

✦ Synopsis

We investigate the computational complexity of temporal reasoning in different time models such as totally-ordered, partially-ordered and branching time. Our main result concerns the satisfiability problem for point algebras and point algebras extended with disjunctions-for these problems, we identify all tractable subclasses. We also provide a number of additional results; for instance, we present a new time model suitable for reasoning about systems with a bounded number of unsynchronized clocks, we investigate connections with spatial reasoning and we present improved algorithms for deciding satisfiability of the tractable point algebras.

πŸ“œ SIMILAR VOLUMES

Preface Algebraic models and MV-algebras
Preface Algebraic models and MV-algebras for fuzzy reasoning
✍ A. Gisolfi; S. Sessa πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 55 KB

## Preface Algebraic models and MV-algebras for fuzzy reasoning This special issue moves from the last trends of mathematical research in fuzzy logic from its unlimited ground of applications, especially in the field of many-valued reasoning. It is well known that fuzzy logic is the logic of the "

A Structure Theorem for Free Temporal Al
A Structure Theorem for Free Temporal Algebras
✍ Francisco M. GarcΓ­a Olmedo; Antonio J. RodrΓ­guez Salas πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 394 KB

## Abstract In this paper an algebraic version for temporal algebras of the logical filtrations for modal and temporal logics is analysed. A structure theorem for free temporal algebras and also some results with regard to the variety of temporal algebras are obtained.

Random selection algorithms for spatial
Random selection algorithms for spatial and temporal sampling
✍ John A. Byers πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 961 KB

Seven BASIC programs are presented that use algorithms for selection of treatments and samples in spatial and temporal contexts. Program (1) takes a natural sequence of samples (such as logs cut from a tree trunk) and divides them into groups (equal to the number of samples divided by treatments), a