330 search results - page 7 / 66 » Open Problems in Logic and Games |
FOSSACS
2001
Springer
14 years 13 days ago
2001
Springer
Abstract. Among the branching-time temporal logics used for the specification and verification of systems, CTL+ , FCTL and ECTL+ are the most notable logics for which the precise...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
EUROCRYPT
2006
Springer
13 years 11 months ago
2006
Springer
We show that, in the ideal-cipher model, triple encryption (the cascade of three independently-keyed blockciphers) is more secure than single or double encryption, thereby resolvin...
TACAS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Failing model checking runs should be accompanied by appropriate error diagnosis information that allows the user to identify the cause of the problem. For branching time...
ATAL
2007
Springer
14 years 2 months ago
2007
Springer
This paper addresses the problem of recognizing policies given logs of battle scenarios from multi-player games. The ability to identify individual and team policies from observat...