Sciweavers

1283 search results - page 108 / 257
» A Survey on Temporal Logics
Sort
View
DLT
2010
15 years 7 months ago
Around Dot Depth Two
It is known that the languages definable by formulae of the logics FO2[<,S], 2[<,S], LTL[F,P,X,Y] are exactly the variety DAD. Automata for this class are not known, nor is i...
Kamal Lodaya, Paritosh K. Pandya, Simoni S. Shah
NECO
2008
116views more  NECO 2008»
15 years 6 months ago
A (Somewhat) New Solution to the Variable Binding Problem
To perform automatic, unconscious inference, the human brain must solve the "binding problem" by correctly grouping properties with objects. Temporal binding models like...
Leon Barrett, Jerome Feldman, Liam Mac Dermed
PODC
1990
ACM
15 years 10 months ago
Half-Order Modal Logic: How to Prove Real-Time Properties
Abstract. We introduce a novel extension of propositional modal logic that is interpreted over Kripke structures in which a value is associated with every possible world. These val...
Thomas A. Henzinger
APAL
2005
125views more  APAL 2005»
15 years 6 months ago
Dynamic topological logic
Dynamic Topological Logic provides a context for studying the confluence of the topological semantics for S4, based on topological spaces rather than Kripke frames; topological dy...
Philip Kremer, Grigori Mints
CONCUR
2006
Springer
15 years 8 months ago
Model Checking Quantified Computation Tree Logic
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
Arend Rensink