Towards Efficient Belief Update for Planning-Based Web Service Composition
Towards Efficient Belief Update for Planning-Based Web Service Composition
复制标题
实现基于规划的 Web 服务组合的高效信念更新
DOI：
10.3233/978-1-58603-891-5-558
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
J. Hoffmann
中科院分区：
文献类型：
--
作者：
J. Hoffmann
在“功能级别”上，语义Web服务(SWS)的描述类似于计划操作符，具有相对于本体的前提条件和效果；本体提供了形式化的词汇表和底层领域的公理化。编写这样的SWS类似于规划。有效地做到这一点的一个关键障碍是处理本体论公理，它充当状态约束。计算一个动作的结果涉及框架和分支问题，并对应于信念更新。这类更新的复杂性促使人们寻找易处理的类。在这里，我们研究一个具有实际意义的类，因为它涉及许多常用的本体公理，特别是涉及其他已知的可处理类没有处理的属性基数上界。我们给出了一个只在相对不关键的参数上是指数型的更新计算；我们也给出了一个在该参数中是多项式的近似更新。
At the “functional level”, Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology provides the formal vocabulary and an axiomatisation of the underlying domain. Composing such SWS is similar to planning. A key obstacle in doing so effectively is handling the ontology axioms, which act as state constraints. Computing the outcome of an action involves the frame and ramification problems, and corresponds to belief update. The complexity of such updates motivates the search for tractable classes. Herein we investigate a class that is of practical relevance because it deals with many commonly used ontology axioms, in particular with attribute cardinality upper bounds which are not handled by other known tractable classes. We present an update computation that is exponential only in a comparatively uncritical parameter; we present an approximate update which is polynomial in that parameter as well.