β-PSML语言中的混合推理算法

    The Existential Entailment Algorithm of β-Problem Solver Markup Language

    • 摘要: 研究了由描述逻辑和Horn子句组成的β-PSML语言逻辑基础的理论问题,给出了基于可确定描述逻辑的混合推理算法.在无递归情况下,β-PSML语言中单步的Horn子句推理需要由一个更为复杂的推理步骤所取代,称这个推理步骤为β-PSML语言中的混合推理.β-PSML语言中的混合推理问题可以描述为:通过结合Horn子句的前件与描述逻辑的术语是否可以推导出Horn子句集中一些Horn子句的前件.

       

      Abstract: Problem Solver Markup Language constructed by combining OWL and Horn clauses are studied. The existential entailment algorithm for the decidable description logic is described. In a nonrecursive case,it is shown that a single step of applying a Horn clause needs to be replaced by a more sophisticated reasoning step in β-PSML. This step is isolated and referred to as existential entailment. The existential entailment problem is to decide whether the antecedent of a Horn clause,together with a description logic terminology,logically entail the disjunction of the antecedents of a set of Horn clauses.

       

    /

    返回文章
    返回