Temporal logics in AI: Semantical and ontological considerations

✍ Scribed by Yoav Shoham

• Publisher: Elsevier Science
• Year: 1987
• Tongue: English
• Weight: 808 KB
• Volume: 33
• Category: Article
• ISSN: 0004-3702
• DOI: 10.1016/0004-3702(87)90052-x

✦ Synopsis

One way to represent temporal m]ormatton m a logtcal Jormahsm ts by assocgatmg "'proposttton types" wtth ttme pomts or ttme mtervals The way this ts usually done m A1 zs by "retrying" propostttons, so that what otherwise would have been formulas actually appear as arguments to some "predwate," say TRUE, as m TRUE(t 1, t 2, COLOR(HOUSE, RED)) This way ume is referred to exphcaly, whde retaining tts special notational and conceptual status

We examine this method by looking closely at two of the more mfluenttal formahsms featuring retried proposmons, those of Allen and McDermott We show that these do not have completely clear semanucs, and that they make some unfortunate and unnecessary ontologwal commttments Finally, we present a new formahsm and demonstrate that tt does not suffer from these dtsadvantages