Resolution for Temporal Logics of Knowledge

@article{Dixon1998ResolutionFT,
  title={Resolution for Temporal Logics of Knowledge},
  author={Clare Dixon and Michael Fisher and Michael Wooldridge},
  journal={J. Log. Comput.},
  year={1998},
  volume={8},
  pages={345-372}
}
A resolution based proof system for a temporal logic of knowledge is p re ented and shown to be correct. Such logics are useful for proving properties of distribut ed and multi-agent systems. Examples are given to illustrate the proof system. An extension of th e basic system to the multimodal case is given and illustrated using the ‘muddy children problem’. 

Resolution-based proof for multi-modal temporal logics of knowledge

  • C. DixonMichael Fisher
  • Philosophy
    Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000
  • 2000
This paper presents a resolution method for propositional temporal logic combined with multi-modal S5 and illustrates its use on examples.

Resolution in a Logic of Rational Agency

A resolution based proof system for a Temporal Logic of Possible Belief is presented and justified. This logic represents a combination of the branching-time temporal logic CTL and the modal logic

Clausal resolution in a logic of rational agency

Tableaux for temporal logics of knowledge: synchronous systems of perfect recall or no learning

  • C. DixonC. NalonMichael Fisher
  • Philosophy, Computer Science
    10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings.
  • 2003
The paper describes tableaux based proof methods for temporal logics of knowledge allowing interaction axioms between the modal and temporal components that allow the description of how knowledge evolves over time and makes reasoning in such logics theoretically more complex.

Complete Axiomatizations for Reasoning about Knowledge and Branching Time

The paper considers the system constraints of synchrony, perfect recall and unique initial states, which give rise to interaction axioms, and develops a language based on the temporal logic CTL*, interpreted with respect to a version of the bundle semantics.

Translating Temporal Epistemic Logics to Monodic First- Order Temporal Logic

This paper presents a translation from temporal logics of knowledge into the monodic fragment of rst-order temporal logic in order to use an existent implementation of a theorem-prover for mondic rSt- order temporal logic called TeMP, so problems specied in temporal logic of knowledge could be tested automatically.

Clausal Resolution for Logics of Time and Knowledge with Synchrony and Perfect Recall

This paper presents a resolution system for a temporal logic of knowledge admitting such interactions and considers the particular interaction that captures synchronous systems with perfect recall.

Tableaux for logics of time and knowledge with interactions relating to synchrony

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

Implementing Temporal Logics: Tools for Execution and Proof (Tutorial Paper)

An overview of a selection of tools for execution and proof based on temporal logic, and outline both the general techniques used and problems encountered in implementing them.
...

References

SHOWING 1-10 OF 51 REFERENCES

A Decision Method for Temporal Logic Based on Resolution

A decision method for linear temporal logic is presented, first converted into a normal form formula containing restricted nesting of temporal operators and tested for satisfiability by using four crucial operations — Unwinding Resolution, SKIP and deletion of persistent eventual terms.

Modal Theorem Proving

The first-order resolution rule for classical logic is modified to handle quantifiers directly and this new resolution rule enables us to extend the authors' propositional systems to complete first- order systems.

A Resolution-Based Proof Method for Temporal Logics of Knowledge and Belief

This paper defines two logics, KLn and BLn, and presents resolution-based proof methods for both, and defines a family of resolution rules used, to deal with the interactions between the various operators of the logics.

A Resolution Method for Temporal Logic

The resolution method is based on classical resolution, but incorporates a temporal resolution rule that can be implemented efficiently using a graph-theoretic approach.

The complexity of propositional linear temporal logics

The complexity of satisfiability and determination of truth in a particular finite structure are considered for different propositional linear temporal logics. It is shown that these problems are

Search Strategies for Resolution in Temporal Logics

This paper gives and evaluates the algorithms for a fully automated temporal resolution theorem prover, and proposes different algorithms on which to base an implementation.

Resolution-Based Calculi for Modal and Temporal Logics

A technique is presented which provides a means to develop resolution-based calculi for (first-order) modal and temporal logics and an extraction of either suitable “simpler” background theories or logic-specific inference rules is presented.

Axioms for Knowledge and Time in Distributed Systems with Perfect Recall

A distributed system, possibly asynchronous, is said to have perfect recall if at all times each processor's state includes a record of all its previous states. The completeness of a propositional

A Decision Method for Linear Temporal Logic

A new decision method is defined for propositional temporal logic of programs to prove some properties of programs such as invariance or eventually because in this logic operators are defined that enable us to represent properties that are valid during all the development of the program or over some parts of the programs.

The complexity of propositional linear temporal logics

We consider the complexity of satisfiability and determination of truth in a particular finite structure for different propositional linear temporal logics. We show that both the above problems are
...