2573 search results - page 124 / 515 » Combinations of Modal Logics |
128
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
In a data word or a data tree each position carries a label from a finite alphabet and a data value from an infinite domain. Over data words we consider the logic LTL↓ 1(F), th...
160
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
Agents that must reach agreements with other agents need to reason about how their preferences, judgments, and beliefs might be aggregated with those of others by the social choic...
174
click to vote
FDTC
2010
Springer
15 years 2 months ago
2010
Springer
Fault injections constitute a major threat to the security of embedded systems. The errors in the cryptographic algorithms have been shown to be extremely dangerous, since powerful...
121
click to vote
CSL
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Graded path quantifiers have been recently introduced and investigated as a useful framework for generalizing standard existential and universal path quantifiers in the b...
120
click to vote
AIML
2004
15 years 5 months ago
2004
We are going to show that the standard notion of Kripke completeness is the strongest one among many provably distinct algebraically motivated completeness properties, some of whic...