...
首页> 外文期刊>Engineering Applications of Artificial Intelligence >Fuzzy conditional temporal problems: Strong and weak consistency
【24h】

Fuzzy conditional temporal problems: Strong and weak consistency

机译:模糊条件时间问题:强弱一致性

获取原文
获取原文并翻译 | 示例
           

摘要

In real life scenarios there is often the need for modeling conditional plans where external events determine the actual execution sequence. Conditional temporal problems (CTPs) have addressed such a need by extending the classical temporal constraint models with conditions on the occurrence of some events. Preferences are also a key aspect in many temporal reasoning tasks, since they allow for modeling in a natural way desires and different satisfaction levels. In this paper, we generalize CTPs to CTPPs by adding fuzzy preferences to the temporal constraints and by allowing fuzzy thresholds for the occurrence of some events. This allows us to generalize the conditions: events are allowed to determine not only which variables are executed, but also the preferences associated to their execution time. We consider two consistency notions (that is, strong and weak) and we provide their corresponding testing algorithms. We show that the complexity of these algorithms is not larger than their classical counterparts for CTPs. We also compare CTPPs with STPPUs, another temporal framework with uncertainty and preferences, by providing a polynomial mapping from STPPUs to CTPPs which allows to identify a strong theoretical connection among the two formalisms. Finally, we describe a tool to define CTPPs and to test if they are strongly or weakly consistent.
机译:在现实生活中,经常需要对条件计划进行建模,其中外部事件决定了实际的执行顺序。条件时态问题(CTP)通过使用一些事件发生的条件扩展经典时态约束模型来满足这种需求。偏好也是许多时间推理任务中的关键方面,因为它们允许以自然的方式对欲望和不同的满意度进行建模。在本文中,我们通过向时间约束添加模糊偏好并允许某些事件发生的模糊阈值,将CTP泛化为CTPP。这使我们可以概括条件:允许事件不仅确定要执行哪些变量,还可以确定与它们的执行时间相关的首选项。我们考虑两个一致性概念(即强和弱),并提供它们相应的测试算法。我们表明,这些算法的复杂性不比CTP的经典算法大。通过提供从STPPU到CTPP的多项式映射,我们还可以将CTPP与STPPU(具有不确定性和偏好的另一个时间框架)进行比较,从而确定两种形式主义之间的牢固理论联系。最后,我们描述了一种定义CTPP并测试其强弱一致性的工具。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号