Probabilistic Quantitative Temporal Constraints:Representing,Reasoning,and Query Answering
Probabilistic Quantitative Temporal Constraints:Representing, Reasoning, and Query Answering作者机构:Dipartimento di Scienze e Innovazione TecnologicaUniversity of Eastern PiedmontAlessandria 15121 Istituto Tecnico Commerciale SommeillerTorino 10129
出 版 物:《Journal of Electronic Science and Technology》 (电子科技学刊(英文版))
年 卷 期:2018年第16卷第1期
页 面:1-10页
核心收录:
学科分类:070208[理学-无线电物理] 07[理学] 0702[理学-物理学]
基 金:partially supported by Istituto Nazionale diAlta Matematica(INdAM)
主 题:Artificial intelligence(AI) probabilities query answering quantitative temporal constraints temporal reasoning
摘 要:In many applications and domains,temporal constraints between actions, and their probabilities play an important role. We propose the first approach in the literature coping with probabilistic quantitative constraints. To achieve such a challenging goal, we extend the widely used simple temporal problem(STP) framework to consider ***,we propose i) a formal representation of probabilistic quantitative constraints, ii) an algorithm,based on the operations of intersection and composition,for the propagation of such temporal constraints, and iii) facilities to support query answering on a set of such constraints. As a result, we provide users with the first homogeneous method supporting the treatment(representing,reasoning,and querying) of probabilistic quantitative constraints, as required by many applications and domains.