Welcome to D
SIGMOD 2003
PODS 2003
SIGMOD-RECOR
ADBIS
CIDR 2003
CIKM 2003
DASFAA 2003
Data Enginee
DEBS
DMKD 2003
DOLAP 2003
DPDJ 2003
ER
GIS 2003
Hypertext 20
ICDE 2003
ICDM 2003
ICDT 2003
JCDL 2003
KRDB 2003
MIR 2003
MIS 2003
MMDB 2003
RIDE 2003
SBBD 2003
SIGIR 2003
SIGIR-FORUM
SIGKDD 2003
SIGKDD-EXP
SSDBM 2003
TIME 2003
TODS
VLDB 2003
VLDB Journal
WIDM 2003
About DiSC 2
Editorial Bo
Acknowledgem
DiSC 2004 Pr
ADVIS
DiSC'04 Feed
DiSC'04 Site
Search DiSC'
<<<Author Index>>>
Copyright No

Clare Dixon

Papers on DiSC'04


Tableaux for Temporal Logics of Knowledge: Synchronous Systems of Perfect Recall or No Learning

Towards the Implementation of First-Order Temporal Resolution: the Expanding Domain Case

Publications


Note: Links lead to the DBLP on the Web.

Clare Dixon

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

M. Carmen Fernández Gago , Michael Fisher , Clare Dixon: Algorithms for Guiding Clausal Temporal Resolution. KI 2002 : 235-252

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)

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)

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

Alexander Bolotov , Clare Dixon: Resolution for Branching Time Temporal Logics: Applying the Temporal Resolution Rule. TIME 2000 : 163-172

Clare Dixon, Michael Fisher : Resolution-Based Proof for Multi-Modal Temporal Logics of Knowledge. TIME 2000 : 69-78

Alexander Bolotov , Clare Dixon, Michael Fisher : Clausal Resolution for CTL * . MFCS 1999 : 137-148

Clare Dixon: Removing irrelevant information in temporal resolution proofs. J. Exp. Theor. Artif. Intell. 11 (1): 95-121 (1999)

Clare Dixon, Michael Fisher : The Set of Support Strategy in Temporal Resolution. TIME 1998 : 113-120

Clare Dixon: Temporal Resolution Using a Breadth-First Search Algorithm. Ann. Math. Artif. Intell. 22 (1-2): 87-115 (1998)

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)

Clare Dixon, Michael Fisher : Tableaux for Synchronous Systems of Knowledge and Time with Interactions. SCAI 1997 : 28-39

Clare Dixon: Temporal Resolution: Removing Irrelevant Information. TIME 1997 : 4-11

Clare Dixon: Search Strategies for Resolution in Temporal Logics. CADE 1996 : 673-687

Michael Fisher , Michael Wooldridge , Clare Dixon: A Resolution-Based Proof Method for Temporal Logics of Knowledge and Belief. FAPR 1996 : 178-192

Clare Dixon: Temporal Resolution: A Breadth-First Search Approach. TIME 1996

Clare Dixon, Michael Fisher , Howard Barringer : A Graph-Based Approach to Resolution in Temporal Logic. ICTL 1994 : 415-429

1 [ 1 ]

2 [ 20 ]

3 [ 12 ] [ 14 ] [ 19 ] [ 21 ]

4 [ 23 ]

5 [ 1 ] [ 3 ] [ 6 ] [ 7 ] [ 8 ] [ 10 ] [ 12 ] [ 13 ] [ 15 ] [ 16 ] [ 17 ] [ 18 ] [ 19 ] [ 20 ] [ 21 ] [ 22 ] [ 23 ] [ 24 ]

6 [ 20 ]

7 [ 22 ]

8 [ 16 ] [ 18 ]

9 [ 20 ]

10 [ 15 ] [ 16 ] [ 18 ] [ 20 ] [ 23 ]

11 [ 23 ]

12 [ 16 ] [ 18 ]

13 [ 24 ]

14 [ 17 ]

15 [ 20 ]

16 [ 15 ] [ 16 ] [ 18 ]

17 [ 3 ] [ 7 ] [ 8 ]




©2004 Association for Computing Machinery