Declarative Programs with Implicit Implications
Declarative Programs with Implicit Implications
复制标题
具有隐含含义的声明式程序
DOI：
10.1109/tkde.2002.1019217
复制
发表时间：
2002
期刊：
影响因子：
--
通讯作者：
Ekawit Nantajeewarawat
中科院分区：
文献类型：
--
作者：
V. Wuwongse;Ekawit Nantajeewarawat
在分类学信息存在的情况下，解释域中的原子之间往往存在隐含。提出了一个通用的框架，用于讨论关于这种隐含的声明性程序的适当语义。首先假设隐式蕴涵可以是预定的，并由解释域上的预序表示。在每个解释必须符合隐式蕴涵的约束条件下，描述了声明性程序的适当的模型论语义及其相应的定点语义。在Kostler等人(1993年)S关于包含不动点的基础上，证明了在假定隐含关系为偏序的情况下，应用直接结果算子可以更有效地确定程序的意义，该算子只涉及解释域子集的简化表示，基本上只由其最大元素组成。
In the presence of taxonomic information, there often exists implicit implication among atoms in an interpretation domain. A general framework is proposed for the discussion of an appropriate semantics for declarative programs with respect to such implicit implication. It is first assumed that the implicit implication can be predetermined and represented by a preorder on the interpretation domain. Under the consequent constraint that every interpretation must conform to the implicit implication, an appropriate model-theoretic semantics as well as its corresponding fixpoint semantics for declarative programs is described. Based on Kostler et al.'s (1993) foundation of fixpoint with subsumption, it is shown that, it the implicit-implication relation is, in addition, assumed to be a partial order, then the meaning of a program can be determined more efficiently by application of an immediate-consequence operator which involves only reduced representations, basically consisting only of their maximal elements, of subsets of the interpretation domain.