Abstract. First-order temporal logic is a concise and powerful notation, withmany potential applications in both Computer Science and Artificial Intelligence. While the full logic is highly complex, recent work on monodic first-order tem-poral logics has identified important enumerable and even decidable fragments including the guarded fragment with equality. In this paper, we specialise themonodic resolution method to the guarded monodic fragment with equality and first-order temporal logic over expanding domains. We introduce novel resolu-tion calculi that can be applied to formulae in the normal form associated with the clausal resolution method, and state correctness and completeness results. 1 Introduction First-order temporal logic (FOTL) is a powerful notation with many applications informal methods. Unfortunately, this power leads to high complexity, most notably the lack of recursive axiomatisations for general FOTL. Recently, significant work has beencarried out in defining monodi
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.