Tractable approximations for temporal constraint handling

作者：

摘要

Relation algebras have been used for various kinds of temporal reasoning. Typically the network satisfaction problem turns out to be NP-hard.

论文关键词：Network satisfaction problem,Relation algebra,Tractable,Approximation,Temporal constraints

论文评审过程：Received 4 May 1999, Revised 5 July 1999, Available online 2 August 2000.

论文官网地址：https://doi.org/10.1016/S0004-3702(99)00089-2