Order:
  1.  46
    A Tableau-Based Proof Method for Temporal Logics of Knowledge and Belief.Michael Wooldridge, Clare Dixon & Michael Fisher - 1998 - Journal of Applied Non-Classical Logics 8 (3):225-258.
    ABSTRACT In this paper we define two logics, KLn and BLn, and present tableau-based decision procedures for both. KLn is a temporal logic of knowledge. Thus, in addition to the usual connectives of linear discrete temporal logic, it contains a set of unary modal connectives for representing the knowledge possessed by agents. The logic BLn is somewhat similar; it is a temporal logic that contains connectives for representing the beliefs of agents. In addition to a complete formal definition of the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  2.  13
    Using temporal logics of knowledge for specification and verification—a case study.Clare Dixon - 2006 - Journal of Applied Logic 4 (1):50-78.
  3.  17
    Tableaux for logics of time and knowledge with interactions relating to synchrony.Clare Dixon, Cláudia Nalon & Michael Fisher - 2004 - Journal of Applied Non-Classical Logics 14 (4):397-445.
    The paper describes tableaux based proof methods for temporal logics of knowledge allowing non-trivial interaction axioms between the modal and temporal components, namely those of synchrony and no learning and synchrony and perfect recall. The interaction axioms allow the description of how knowledge evolves over time and makes reasoning in such logics theoretically more complex. Such logics can be used to specify systems that involve the knowledge of processes or agents and which change over time, for example agent based systems, (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  4.  8
    Alternating automata and temporal logic normal forms.Clare Dixon, Alexander Bolotov & Michael Fisher - 2005 - Annals of Pure and Applied Logic 135 (1-3):263-285.
    We provide a translation from SNFPLTL, a normal form for propositional linear time temporal logic, into alternating automata on infinite words, and vice versa. We show this translation has the property that the set of SNFPLTL clauses is satisfiable if and only if the alternating automaton has an accepting run. As there is no direct method known for checking the non-emptiness of alternating automata, the translation to SNFPLTL, together with a temporal proof on the resulting SNFPLTL clauses, provides an indirect (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  5.  6
    Clausal resolution in a logic of rational agency.Clare Dixon, Michael Fisher & Alexander Bolotov - 2002 - Artificial Intelligence 139 (1):47-89.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6.  16
    Deductive temporal reasoning with constraints.Clare Dixon, Boris Konev, Michael Fisher & Sherly Nietiadi - 2013 - Journal of Applied Logic 11 (1):30-51.