• DocumentCode
    3202003
  • Title

    About the temporal decrease of sets

  • Author

    Heinemann, Bernhard

  • Author_Institution
    Fachbereich Inf., Fern Univ., Hagen, Germany
  • fYear
    2001
  • fDate
    2001
  • Firstpage
    234
  • Lastpage
    239
  • Abstract
    This paper is about a simple general framework for modelling decrease. We provide an extension of propositional linear time temporal logic with operators expressing `next-time´ and `henceforth´, by a modality that quantifies over the points of some set X. This set changes in the course of time; actually X is assumed to shrink little by little. We develop an appropriate logical language, give a sound and complete axiomatization of the set of validities, and prove decidability of this set. Moreover the computational complexity of the logic is determined
  • Keywords
    computational complexity; decidability; temporal logic; axiomatization; computational complexity; decidability; general framework; logical language; propositional linear time temporal logic; temporal decrease of sets; Computer science; Concrete; Logic;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Temporal Representation and Reasoning, 2001. TIME 2001. Proceedings. Eighth International Symposium on
  • Conference_Location
    Cividale del Friuli
  • Print_ISBN
    0-7695-1107-4
  • Type

    conf

  • DOI
    10.1109/TIME.2001.930722
  • Filename
    930722