Sciweavers

169 search results - page 11 / 34
» Temporalization of Probabilistic Propositional Logic
Sort
View
104
Voted
TOCL
2011
87views more  TOCL 2011»
14 years 7 months ago
The tractability of model checking for LTL: The good, the bad, and the ugly fragments
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the s...
Michael Bauland, Martin Mundhenk, Thomas Schneider...
97
Voted
IJCAI
2007
15 years 1 months ago
Tractable Temporal Reasoning
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
Clare Dixon, Michael Fisher, Boris Konev
FLAIRS
2003
15 years 1 months ago
On the Computational Complexity of Spatio-Temporal Logics
Recently, a hierarchy of spatio-temporal languages based on the propositional temporal logic PTL and the spatial languages RCC-8, BRCC-8 and S4u has been introduced. Although a nu...
David Gabelaia, Roman Kontchakov, Agi Kurucz, Fran...
VL
2007
IEEE
125views Visual Languages» more  VL 2007»
15 years 6 months ago
Visual Reasoning by Generalized Interval-values and Interval Temporal Logic
Interval-valued computation is an unconventional computing paradigm. It is an idealization of classical 16-, 32-, 64- etc. bit based computations. It represents data as specific ...
Benedek Nagy, Sándor Vályi
121
Voted
JAIR
1998
163views more  JAIR 1998»
15 years 2 days ago
A Temporal Description Logic for Reasoning about Actions and Plans
A class of interval-based temporal languages for uniformly representing and reasoning about actions and plans is presented. Actions are represented by describing what is true whil...
Alessandro Artale, Enrico Franconi