Towards the implementation of first-order temporal resolution: the expanding domain case
Towards the implementation of first-order temporal resolution: the expanding domain case
复制标题
实现一阶时间分辨率:扩展域情况
DOI:
--
复制
发表时间:
2003
期刊:
影响因子:
--
通讯作者:
U. Hustadt
中科院分区:
文献类型:
--
作者:
B. Konev;A. Degtyarev;C. Dixon;Michael Fisher;U. Hustadt
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.