首页> 外文期刊>Advances in Distributed Computing And Artificial Intelligence Journal >Relationships between Specified and Underspecified Quantification by the Theory of Acyclic Recursion
【24h】

Relationships between Specified and Underspecified Quantification by the Theory of Acyclic Recursion

机译:通过非循环递归理论指定和未指定量化之间的关系

获取原文
       

摘要

The paper introduces a technique for representing quantifier relations that can have different scope order depending on context. The technique is demonstrated by classes of terms denoting relations, where each of the arguments of a relation term is bound by a different quantifier. We represent a formalization of linking quantifiers with the corresponding argument slots that they bind, across lambda-abstractions and reduction steps. The purpose of the technique is to represent underspecified order of quantification, in the absence of a context and corresponding information about the order. Furthermore, it is used to represent subclasses of larger classes of relations depending on order of quantification or specific relations.
机译:本文介绍了一种表示量词关系的技术,该量词关系可以根据上下文具有不同的作用域顺序。表示关系的术语类别证明了该技术,其中关系术语的每个参数都由不同的量词约束。我们通过lambda抽象和归约步骤来表示链接量词及其绑定的相应参数槽的形式化。该技术的目的是在没有上下文和有关该顺序的相应信息的情况下,代表量化指标的不足。此外,根据量化顺序或特定关系,它用于表示较大关系类型的子类。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号