| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Michael Fisher Michael Fisher, Alexei Lisitsa : Monodic ASMs and Temporal Verification. Abstract State Machines 2004 : 95-110 Rafael H. Bordini , Michael Fisher, Carmen Pardavila , Michael Wooldridge : Model checking agentspeak. AAMAS 2003 : 409-416 Anatoli Degtyarev , Michael Fisher, Boris Konev : Monodic Temporal Resolution. CADE 2003 : 397-411 Rafael H. Bordini , Michael Fisher, Carmen Pardavila , Willem Visser , Michael Wooldridge : Model Checking Multi-Agent Programs with CASP. CAV 2003 : 110-113 Boris Konev , Anatoli Degtyarev , Michael Fisher: Handling Equality in Monodic Temporal Resolution. LPAR 2003 : 214-228 Clare Dixon , Cláudia Nalon , Michael Fisher: Tableaux for Temporal Logics of Knowledge: Synchronous Systems of Perfect Recall or No Learning. TIME 2003 : 62-71 Boris Konev , Anatoli Degtyarev , Clare Dixon , Michael Fisher, Ullrich Hustadt : Towards the Implementation of First-Order Temporal Resolution: the Expanding Domain Case. TIME 2003 : 72-82 Mark d'Inverno , Michael Luck , Michael Fisher, Chris Preist : Foundations and Applications of Multi-Agent Systems, UKMAS Workshop 1996-2000, Selected Papers Springer 2002 Michael Fisher, Chiara Ghidini : The abc of rational agent modelling. AAMAS 2002 : 849-856 Michael Wooldridge , Michael Fisher, Marc-Philippe Huget , Simon Parsons : Model checking multi-agent systems with MABLE. AAMAS 2002 : 952-959 Michael Fisher, Chiara Ghidini , Benjamin Hirsch : Organising Logic-Based Agents. FAABS 2002 : 15-27 Michael Fisher, Chiara Ghidini : Agents with Bounded Temporal Resources. Foundations and Applications of Multi-Agent Systems 2002 : 169-184 M. Carmen Fernández Gago , Michael Fisher, Clare Dixon : Algorithms for Guiding Clausal Temporal Resolution. KI 2002 : 235-252 James Brotherston , Anatoli Degtyarev , Michael Fisher, Alexei Lisitsa : Searching for Invariants Using Temporal Resolution. LPAR 2002 : 86-101 Anatoli Degtyarev , Michael Fisher, Boris Konev : A Simplified Clausal Resolution Procedure for Propositional Linear-Time Temporal Logic. TABLEAUX 2002 : 85-99 Clare Dixon , Michael Fisher, Alexander Bolotov : Clausal resolution in a logic of rational agency. Artif. Intell. 139 (1): 47-89 (2002) Brandon Bennett , Clare Dixon , Michael Fisher, Ullrich Hustadt , Enrico Franconi , Ian Horrocks , Maarten de Rijke : Combinations of Modal Logics. Artif. Intell. Rev. 17 (1): 1-20 (2002) Alexander Bolotov , Michael Fisher, Clare Dixon : On the Relationship between [ohgr]-automata and Temporal Logic Normal Forms. J. Log. Comput. 12 (4): 561-581 (2002) Anatoli Degtyarev , Michael Fisher, Alexei Lisitsa : Equality and Monodic First-Order Temporal Logic. Studia Logica 72 (2): 147-156 (2002) Anatoli Degtyarev , Michael Fisher: Towards First-Order Temporal Resolution. KI/ÖGAI 2001 : 18-32 Ullrich Hustadt , Clare Dixon , Renate A. Schmidt , Michael Fisher, John-Jules Ch. Meyer , Wiebe van der Hoek : Reasoning about agents in the KARO framework. TIME 2001 : 206-213 Michael Fisher, Clare Dixon , Martin Peim : Clausal temporal resolution. ACM Trans. Comput. Log. 2 (1): 12-56 (2001) Michael Fisher: Direct Execution of Agent Specifications. FAABS 2000 : 163 Ullrich Hustadt , Clare Dixon , Renate A. Schmidt , Michael Fisher, John-Jules Ch. Meyer , Wiebe van der Hoek : Verification within the KARO Agent Theory. FAABS 2000 : 33-47 Ullrich Hustadt , Clare Dixon , Renate A. Schmidt , Michael Fisher: Normal Forms and Proofs in Combined Modal and Temporal Logics. FroCos 2000 : 73-87 Clare Dixon , Michael Fisher: Resolution-Based Proof for Multi-Modal Temporal Logics of Knowledge. TIME 2000 : 69-78 Michael Fisher, Chiara Ghidini : Programming Resource-Bounded Deliberative Agents. IJCAI 1999 : 200-205 Alexander Bolotov , Clare Dixon , Michael Fisher: Clausal Resolution for CTL * . MFCS 1999 : 137-148 Alexander Bolotov , Michael Fisher: A clausal resolution method for CTL branching-time temporal logic. J. Exp. Theor. Artif. Intell. 11 (1): 77-93 (1999) Michael Fisher: Representing Abstract Agent Architectures. ATAL 1998 : 227-241 R. I. Scott , Michael Fisher, John A. Keane : Parallel Temporal Tableaux. Euro-Par 1998 : 852-861 Clare Dixon , Michael Fisher: The Set of Support Strategy in Temporal Resolution. TIME 1998 : 113-120 Clare Dixon , Michael Fisher, Michael Wooldridge : Resolution for Temporal Logics of Knowledge. J. Log. Comput. 8 (3): 345-372 (1998) Michael Wooldridge , Clare Dixon , Michael Fisher: A Tableau-Based Proof Method for Temporal Logics of Knowledge and Belief. Journal of Applied Non-Classical Logics 8 (3): (1998) Marco Mulder , Jan Treur , Michael Fisher: Agent Modelling in METATEM and DESIRE. ATAL 1997 : 193-207 Adam Kellett , Michael Fisher: Concurrent METATEM as a Coordination Language. COORDINATION 1997 : 418-421 Michael Fisher: Implementing BDI-like Systems by Direct Execution. IJCAI (1) 1997 : 316-321 Michael Fisher, Michael Wooldridge : Distributed Problem-Solving as Concurrent Theorem Proving. MAAMAW 1997 : 128-140 Clare Dixon , Michael Fisher: Tableaux for Synchronous Systems of Knowledge and Time with Interactions. SCAI 1997 : 28-39 Adam Kellett , Michael Fisher: Automata Representations for Concurrent METATEM. TIME 1997 : 12-19 Alexander Bolotov , Michael Fisher: A Resolution Method For CTL Branching-Time Temporal Logic. TIME 1997 : 20-27 Michael Fisher, Michael Wooldridge : On the Formal Specification and Verification of Multi-Agent Systems. Int. J. Cooperative Inf. Syst. 6 (1): 37-66 (1997) Michael Fisher: A Normal Form for Temporal Logics and its Applications in Theorem-Proving and Execution. J. Log. Comput. 7 (4): 429-456 (1997) Michael Fisher: If Z Is the Answer, What Could the Question Possibly Be? ATAL 1996 : 65-66 Michael Fisher, Michael Wooldridge , Clare Dixon : A Resolution-Based Proof Method for Temporal Logics of Knowledge and Belief. FAPR 1996 : 178-192 Michael Fisher: Temporal Semantics for Concurrent Metatem. J. Symb. Comput. 22 (5/6): 627-648 (1996) Michael Fisher, Richard Owens : Executable Modal and Temporal Logics, IJCAI '93, Workshop, Chambéry, France, August 28, 1993, Proceedings Springer 1995 Howard Barringer , Michael Fisher, Dov M. Gabbay , Graham Gough , Richard Owens : METATEM: An Introduction. Formal Asp. Comput. 7 (5): 533-549 (1995) Michael Fisher: Representing and Executing Agent-Based Systems. ECAI Workshop on Agent Theories, Architectures, and Languages 1994 : 307-323 Michael Wooldridge , Michael Fisher: A Decision Procedure for a Temporal Belief Logic. ICTL 1994 : 317-331 Clare Dixon , Michael Fisher, Howard Barringer : A Graph-Based Approach to Resolution in Temporal Logic. ICTL 1994 : 415-429 Michael Fisher: A Survey of Concurrent METATEM - the Language and its Applications. ICTL 1994 : 480-505 Michael Fisher, Michael Wooldridge : Specifying and Verifying Distributed Intelligence Systems. EPIA 1993 : 13-28 Michael Fisher, Richard Owens : An Introduction to Executable Modal and Temporal Logics. Executable Modal and Temporal Logics 1993 : 1-20 Michael Fisher: Towards a Semantics for Concurrent METATEM. Executable Modal and Temporal Logics 1993 : 86-102 Michael Fisher: Concurrent METATEM - A Language for Modelling Reactive Systems. PARLE 1993 : 185-196 Michael Fisher: A Normal Form for First-Order Temporal Formulae. CADE 1992 : 370-384 Michael Wooldridge , Michael Fisher: A First-Order Branching Time Logic of Multi-Agent System. ECAI 1992 : 234-238 Michael Fisher, Richard Owens : From the Past to the Future: Executing Temporal Logic Programs. LPAR 1992 : 369-380 Michael Fisher: A Model Checker for Linear Time Temporal Logic. Formal Asp. Comput. 4 (3): 299-319 (1992) Michael Fisher: A Resolution Method for Temporal Logic. IJCAI 1991 : 99-104 Howard Barringer , Michael Fisher, Dov M. Gabbay , Anthony Hunter : Meta-Reasoning in Executable Temporal Logic. KR 1991 : 40-49 Howard Barringer , Michael Fisher, Graham Gough : Fair SMG and Linear Time Model Checking. Automatic Verification Methods for Finite State Systems 1989 : 133-150 Howard Barringer , Michael Fisher, Dov M. Gabbay , Graham Gough , Richard Owens : METATEM: A Framework for Programming in Temporal Logic. REX Workshop 1989 : 94-129 1 [ 1 ] [ 2 ] [ 3 ] [ 14 ] [ 17 ] 2 [ 48 ] 3 [ 24 ] [ 36 ] [ 37 ] [ 47 ] [ 49 ] 4 [ 61 ] [ 63 ] 5 [ 51 ] 6 [ 45 ] [ 46 ] [ 50 ] [ 51 ] [ 58 ] [ 60 ] [ 62 ] 7 [ 14 ] [ 20 ] [ 26 ] [ 31 ] [ 32 ] [ 33 ] [ 37 ] [ 39 ] [ 40 ] [ 41 ] [ 43 ] [ 44 ] [ 47 ] [ 48 ] [ 49 ] [ 52 ] [ 58 ] [ 59 ] 8 [ 48 ] 9 [ 1 ] [ 3 ] [ 17 ] 10 [ 52 ] 11 [ 38 ] [ 53 ] [ 54 ] [ 56 ] 12 [ 1 ] [ 2 ] [ 17 ] 13 [ 54 ] 14 [ 41 ] [ 44 ] 15 [ 48 ] 16 [ 55 ] 17 [ 3 ] 18 [ 40 ] [ 41 ] [ 44 ] [ 48 ] [ 58 ] 19 [ 34 ] 20 [ 25 ] [ 29 ] 21 [ 50 ] [ 58 ] [ 60 ] [ 62 ] 22 [ 46 ] [ 51 ] [ 64 ] 23 [ 57 ] 24 [ 41 ] [ 44 ] 25 [ 30 ] 26 [ 59 ] 27 [ 1 ] [ 6 ] [ 11 ] [ 17 ] [ 18 ] 28 [ 61 ] [ 63 ] 29 [ 55 ] 30 [ 43 ] 31 [ 57 ] 32 [ 48 ] 33 [ 40 ] [ 41 ] [ 44 ] 34 [ 34 ] 35 [ 30 ] 36 [ 61 ] 37 [ 7 ] [ 12 ] [ 15 ] [ 20 ] [ 23 ] [ 27 ] [ 31 ] [ 32 ] [ 55 ] [ 61 ] [ 63 ] 38 [ 57 ]  ©2004 Association for Computing Machinery |
