Formalizing and using persistency

  • Authors:
  • Thomas Guckenbiehl

  • Affiliations:
  • Fraunhofer-Institute of Information and Data Processing, Karlsruhe, FRG

  • Venue:
  • IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
  • Year:
  • 1991

Quantified Score

Hi-index 0.00

Visualization

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 approaches lack formality. In this paper their way of reasoning about persistency is reconstructed as inference rules that combine appropriate time-boxes with standard resolution. In many cases Burckert's Constrained Resolution may be used. More complex examples may be handled by a new inference rule, called Persistency Resolution. An analysis of this rule leads to a more general notion of persistency.