共查询到17条相似文献,搜索用时 46 毫秒
1.
2.
3.
4.
关于strong形RUE-NRF归结的反倒欧阳丹彤,刘叙华(吉林大学计算机科学系长春130023)ACOUNTEREXAMPLEOFRUE-NRFRESOLUTIONINSTRONGFORM¥OuyangDantongandLiuXuhua(Depa... 相似文献
5.
6.
8.
9.
算子Fuzzy逻辑和λ—归结方法 总被引:6,自引:1,他引:6
本文提出了算子Fuzzy逻辑,并给出了这种逻辑系统中公式的一些简单性质,在算子Fuzzy逻辑中,提出了λ-恒真和λ-恒假的概念,提出了λ-归结方法。证明了:对于任一个λ-恒假公式,使用λ-归结方法,都可以在有限步内,给以判定。 相似文献
10.
本文针对广义归结原理实现时空间复杂度非常大的问题,通过实际分析广义归结方法实现时造成多余归结的实例,提出了几种优化方法,使系统的归结能力显著提高。 相似文献
11.
12.
13.
14.
命题模态归结的一种变型 总被引:1,自引:1,他引:1
本文给出了模态子句集的标准子句集概念,提出了一种基于标准子句集的模态归结方法的变型,称之为标准模态归结,证明了任意模态子句集恒假当且仅当存在从它的标准子句集出发,使用标准模态归结推出空子句的演绎,从而证明了对于不可满足标准子句集、标准模态归结是完备的,这种标准模态归结,揄规则简单、直观且容易实现。 相似文献
15.
This paper discusses the comparative evaluation of five well-known pronoun resolution algorithms conducted with the help of a purpose-built tool for consistent evaluation in anaphora resolution, termed the evaluation workbench. The workbench enables the evaluation and comparison of pronoun resolution algorithms on the basis of the same preprocessing tools and test data. The tool is controlled by the user who can conduct the evaluation according to a variety of parameters, with regard to the types of anaphors and the samples used for evaluation. The extensive comparative evaluation of the pronoun resolution algorithms showed that their performance was significantly lower than the figures reported in the original papers describing the algorithms. The evaluation study concluded that the main reason for this drop in performance is the fact that all algorithms operate in a fully automatic mode. 相似文献
16.
基于协商的冲突消解研究 总被引:21,自引:0,他引:21
魏宝刚 《小型微型计算机系统》1998,19(11):44-49
冲突消解是分布式人工智能(DAI)系统中主体协调的一个重要方面。在DAI系统中各主体的知识库可能存在着不完整性,不一致性,不相容性和不可约性等等,这些特性可能在协作过程中导致冲突。智能主体必须有一定的机制,用于识别和管理这些不一致性,以及消除由此而导致的冲突。本文分析定义了冲突的类型,并提出了协商冲突消解策略。 相似文献
17.
This paper reports our investigation of machine learning methods applied to anaphora resolution for biology texts, particularly paper abstracts. Our primary concern is the investigation of features and their combinations for effective anaphora resolution. In this paper, we focus on the resolution of demonstrative phrases and definite determiner phrases, the two most prevalent forms of anaphoric expressions that we find in biology research articles. Different resolution models are developed for demonstrative and definite determiner phrases. Our work shows that models may be optimized differently for each of the phrase types. Also, because a significant number of definite determiner phrases are not anaphoric, we induce a model to detect anaphoricity, i.e., a model that classifies phrases as either anaphoric or nonanaphoric. We propose several novel features that we call highlighting features , and consider their utility particularly for processing paper abstracts. The system using the highlighting features achieved accuracies of 78% and 71% for demonstrative phrases and definite determiner phrases, respectively. The use of the highlighting features reduced the error rate by about 10%. 相似文献