Compiling Ai Engineering Models For Probabilistic Inference
KI'11: Proceedings of the 34th Annual German conference on Advances in artificial intelligence(2011)
摘要
In engineering domains, AI decision making is often confronted with problems that lie at the intersection of logic-based and probabilistic reasoning. A typical example is the plan assessment problem studied in this paper, which comprises the identification of possible faults and the computation of remaining success probabilities based on a system model. In addition, AI solutions to such problems need to be tailored towards the needs of engineers. This is being addressed by the recently developed high-level, expressive modeling formalism called probabilistic hierarchical constraint automata (PHCA).This work introduces a translation from PHCA models to statistical relational models, which enables a wide array of probabilistic reasoning solutions to be leveraged, e.g., by grounding to problem-specific Bayesian networks. We illustrate this approach for the plan assessment problem, and compare it to an alternative logic-based approach that translates the PHCA models to lower-level logic models and computes solutions by enumerating most likely hypotheses. Experimental results on realistic problem instances demonstrate that the probabilistic reasoning approach is a promising alternative to the logic-based approach.
更多查看译文
关键词
PHCA model,plan assessment problem,alternative logic-based approach,logic-based approach,probabilistic hierarchical constraint automaton,probabilistic reasoning,probabilistic reasoning approach,probabilistic reasoning solution,realistic problem instance,AI decision making,Compiling AI engineering model,probabilistic inference
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要