The Community for Technology Leaders
Temporal Representation and Reasoning, International Syposium on (2003)
Cairns, Queensland, Australia
July 8, 2003 to July 10, 2003
ISSN: 1530-1311
ISBN: 0-7695-1912-1
pp: 72
Boris Konev , University of Liverpool
Anatoli Degtyarev , King's College London
Clare Dixon , University of Liverpool
Michael Fisher , University of Liverpool
Ullrich Hustadt , University of Liverpool
First-order temporal logic is a concise and powerful notation, with many potential applications in both Computer Science and Artificial Intelligence. While the full logic is highly complex, recent work on monodic first-order temporal logics has identified important enumerable and even decidable fragments. In this paper, we develop a clausal resolution method for the monodic fragment of first-order temporal logic over expanding domains. We first define a normal form for monodic formulae and then introduce novel resolution calculi that can be applied to formulae in this normal form. We state correctness and completeness results for the method. We illustrate the method on a comprehensive example. The method is based on classical first-order resolution and can, thus, be efficiently implemented.

B. Konev, M. Fisher, U. Hustadt, C. Dixon and A. Degtyarev, "Towards the Implementation of First-Order Temporal Resolution: the Expanding Domain Case," Temporal Representation and Reasoning, International Syposium on(TIME), Cairns, Queensland, Australia, 2003, pp. 72.
97 ms
(Ver 3.3 (11022016))