![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Tim French Tim French: Decidability of Propositionally Quantified Logics of Knowledge. Australian Conference on Artificial Intelligence 2003 : 352-363 Carsten Maple , Tim French, Marc Conrad : A Visual Formalism for Graphical User Interfaces based on State Transition Diagrams. IV 2003 : 183-188 Tim French: Quantified Propositional Temporal Logic with Repeating States. TIME 2003 : 155-165 Tim French: Decidability of Quantifed Propositional Branching Time Logics. Australian Joint Conference on Artificial Intelligence 2001 : 165-176 1 [ 3 ] 2 [ 3 ] ![]() ©2004 Association for Computing Machinery |