Results 291 to 300 of about 93,973 (331)
Some of the next articles are maybe not open access.
Journal of Automated Reasoning, 1989
Let T denote closure of the set of formulas of the form P \((term_ 1,...,term_ n)\) under operation of conjunction and temporal operators of some kind (f. E. operators ``always'', ``until'' and so on), and TR be the set of formulas (rules) of the form \(f_ 1 \&...\& f_ m\to f_{m+1}\), where \(f_ i\) belongs to T.
openaire +1 more source
Let T denote closure of the set of formulas of the form P \((term_ 1,...,term_ n)\) under operation of conjunction and temporal operators of some kind (f. E. operators ``always'', ``until'' and so on), and TR be the set of formulas (rules) of the form \(f_ 1 \&...\& f_ m\to f_{m+1}\), where \(f_ i\) belongs to T.
openaire +1 more source
Dynamic Epistemic Temporal Logic
2009We introduce a new type of arrow in the update frames (or "action models") of Dynamic Epistemic Logic in a way that enables us to reason about epistemic temporal dynamics in multi-agent systems that need not be synchronous. Since van Benthem and Pacuit (later joined by Hoshi and Gerbrandy) showed that standard Dynamic Epistemic Logic necessarily ...
Renne, B., Sack, Joshua, Yap, Audrey
openaire +2 more sources
Complexity of finite-variable fragments of propositional temporal and modal logics of computation
Theoretical Computer Science, 2022Михаил Рыбаков +1 more
exaly
Temporal logics in urban place-making: the case of refugee-background Ethiopians in Australia
Urban Geography, 2023Goshu Wolde Tefera
exaly