使用类型化存在属性简化消极目标
Simplifying Negative Goals Using Typed Existence Properties
摘要：
提出了一种从消极目标中提取积极信息的方法。它利用谓词的参数之间的类型化存在属性来重写逻辑程序中的否定目标。类型化存在属性是函数依赖的一种泛化，因为输入值映射到固定数量的输出值。类型用于指定输入和输出值的域。给出了该简化方法的一个实现，并分析了其复杂性.实现的关键算法检查是否可以使用给定的类型化存在属性提取否定目标中的原子。有向图将原子与原子中出现的量化变量联系起来，并用于快速检索负目标中的原子，这些原子在提取其他原子后可能变得可提取。
英文摘要：
A method for extracting positive information from negative goals is proposed. It makes use of typed existence properties between arguments of a predicate to rewrite negative goals in a logic program. A typed existence property is a generalization of functional dependencies in that an input value maps to a fixed number of output values. Types are used to specify the domains of the input and output values. An implementation of the simplification method is presented and its complexity is analyzed. A key algorithm of the implementation checks if an atom in a negative goal can be extracted using a given typed existence property. A digraph links an atom to the quantified variables occurring in the atom and is used to quickly retrieve atoms in the negative goal that may become extractable after some other atom is extracted.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
