Formalizing and Using Persistency
Proceedings of the Twelfth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 105-109.
Abstract
In many formalizations of a changing world things do not change all the time but are persistent thoughout a time interval. Often this persistency is represented by facts refering to intervals int which are still valid if int is replaced by any subinterval int'. Approaches like episode propagation or Penberthy's temporal unification try to employ this property for efficient reasoning. However these approa~hes lack formality. In this paper their way of reasonmg about persistency is reconstructed as inference rules that combine appropriate timeboxes with standard resolution. In many cases BOrckert's Constrained Resolution may be used. ~ore complex examples may be handled by a new mference rule, called Persistency Resolution. An analysis of this rule leads to a more general notion of persistency.
@inproceedings{ijcai1991p16,
title = {Formalizing and Using Persistency},
author = {Guckenbiehl, Thomas},
booktitle = {Proceedings of the Twelfth International Joint Conference on
Artificial Intelligence, {IJCAI-91}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {John Mylopoulos and Ray Reiter},
pages = {105--109},
year = {1991},
month = {8},
note = {Automated Reasoning},
url = {https://ijcai.org/proceedings/1991/16},
}
TY - CPAPER TI - Formalizing and Using Persistency AU - Guckenbiehl, Thomas T2 - Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI-91 PB - International Joint Conferences on Artificial Intelligence PY - 1991 SP - 105 EP - 109 UR - https://ijcai.org/proceedings/1991/16 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
