This paper outlines the necessity of the knowledge representation for the geometrical shapes （KRGS）. We advocate that KRGS for being powerful must contain at least three major components, namely （1） fu...This paper outlines the necessity of the knowledge representation for the geometrical shapes （KRGS）. We advocate that KRGS for being powerful must contain at least three major components, namely （1） fuzzy logic scheme; （2） the machine learning technique; and （3） an integrated algebraic and logical reasoning. After arguing the need for using fuzzy expressions in spatial reasoning, then inducing the spatial graph generalized and maximal common part of the expressions is discussed. Finally, the integration of approximate references into spatial reasoning using absolute measurements is outlined. The integration here means that the satisfiability of a fuzzy spatial expression is conducted by both logical and algebraic reasoning.展开更多
语义Web模糊知识的表示和应用常常涉及模糊隶属度比较,但现有描述逻辑的模糊扩展缺乏描述模糊隶属度比较的能力.提出支持模糊隶属度比较和描述逻辑ALCN(attributive concept description language with complements and number restrict...语义Web模糊知识的表示和应用常常涉及模糊隶属度比较,但现有描述逻辑的模糊扩展缺乏描述模糊隶属度比较的能力.提出支持模糊隶属度比较和描述逻辑ALCN(attributive concept description language with complements and number restriction)概念构造子的扩展模糊描述逻辑FCALCN(fuzzy comparable ALCN).FCALCN引入新的原子概念形式以支持模糊隶属度比较.给出FCALCN的推理算法,证明了在空TBox约束下FCALCN的推理问题复杂性是多项式空间完全的.FCALCN能够表达语义Web上涉及模糊隶属度比较的复杂模糊知识并实现对它们的推理.展开更多
扩展模糊描述逻辑是对描述逻辑的一种模糊扩展,支持对复杂模糊知识的表示和推理,但该逻辑缺乏支持术语公理约束的推理算法.提出扩展模糊描述逻辑EFALCR+(extended fuzzy attributive concept description language with complements and...扩展模糊描述逻辑是对描述逻辑的一种模糊扩展,支持对复杂模糊知识的表示和推理,但该逻辑缺乏支持术语公理约束的推理算法.提出扩展模糊描述逻辑EFALCR+(extended fuzzy attributive concept description language with complements and transitive roles)的受限TBox(terminological box)描述术语公理,给出受限TBox约束下的EFALCR+推理算法,并对该算法进行优化,证明优化后的算法是正确完备的,时间复杂性不超过指数,最后证明受限TBox约束下的EFALCR+推理问题是指数时间完全问题.优化算法的最坏时间复杂性已达到该问题推理算法的复杂度下界,是实现术语公理约束下模糊知识库推理的有效算法.展开更多
It is well known that there exists a tight connection between nonmonotonic reasoning and conditional implication. Many researchers have investigated it from various angles. Among th em, C.Boutilier and P.Lamarre hav...It is well known that there exists a tight connection between nonmonotonic reasoning and conditional implication. Many researchers have investigated it from various angles. Among th em, C.Boutilier and P.Lamarre have shown that some conditional implication may b e regarded as the homology of different nonmonotonic consequence relations. In t his paper, based on the plausibility space introduced by Friedman and Halpern, w e characterize the condition logic in which conditional implication is nonmonoto nic, and this result characterizes the conditional implication which may be rega rded as the corresponding object in Meta language for nonmonotonic inference rel ations.展开更多
文摘This paper outlines the necessity of the knowledge representation for the geometrical shapes （KRGS）. We advocate that KRGS for being powerful must contain at least three major components, namely （1） fuzzy logic scheme; （2） the machine learning technique; and （3） an integrated algebraic and logical reasoning. After arguing the need for using fuzzy expressions in spatial reasoning, then inducing the spatial graph generalized and maximal common part of the expressions is discussed. Finally, the integration of approximate references into spatial reasoning using absolute measurements is outlined. The integration here means that the satisfiability of a fuzzy spatial expression is conducted by both logical and algebraic reasoning.
文摘语义Web模糊知识的表示和应用常常涉及模糊隶属度比较,但现有描述逻辑的模糊扩展缺乏描述模糊隶属度比较的能力.提出支持模糊隶属度比较和描述逻辑ALCN(attributive concept description language with complements and number restriction)概念构造子的扩展模糊描述逻辑FCALCN(fuzzy comparable ALCN).FCALCN引入新的原子概念形式以支持模糊隶属度比较.给出FCALCN的推理算法,证明了在空TBox约束下FCALCN的推理问题复杂性是多项式空间完全的.FCALCN能够表达语义Web上涉及模糊隶属度比较的复杂模糊知识并实现对它们的推理.
文摘扩展模糊描述逻辑是对描述逻辑的一种模糊扩展,支持对复杂模糊知识的表示和推理,但该逻辑缺乏支持术语公理约束的推理算法.提出扩展模糊描述逻辑EFALCR+(extended fuzzy attributive concept description language with complements and transitive roles)的受限TBox(terminological box)描述术语公理,给出受限TBox约束下的EFALCR+推理算法,并对该算法进行优化,证明优化后的算法是正确完备的,时间复杂性不超过指数,最后证明受限TBox约束下的EFALCR+推理问题是指数时间完全问题.优化算法的最坏时间复杂性已达到该问题推理算法的复杂度下界,是实现术语公理约束下模糊知识库推理的有效算法.
文摘It is well known that there exists a tight connection between nonmonotonic reasoning and conditional implication. Many researchers have investigated it from various angles. Among th em, C.Boutilier and P.Lamarre have shown that some conditional implication may b e regarded as the homology of different nonmonotonic consequence relations. In t his paper, based on the plausibility space introduced by Friedman and Halpern, w e characterize the condition logic in which conditional implication is nonmonoto nic, and this result characterizes the conditional implication which may be rega rded as the corresponding object in Meta language for nonmonotonic inference rel ations.
