共查询到20条相似文献,搜索用时 46 毫秒
1.
自动推理是人工智能的一个重要研究方向,基于归结原理的自动推理因易于在计算机上实现而得到广泛研究。语义归结是对归结原理的一种改进,它利用限制参与归结子句类型和归结文字顺序的方法来提高推理效率。为了提高基于格蕴涵代数的格值逻辑的α-归结原理的效率,将语义归结策略应用于α-归结原理。首先给出了格值一阶逻辑系统中的α-语义归结概念和α-语义归结演绎概念,接着讨论了格值一阶逻辑系统的α-语义归结方法,并证明了其可靠性和条件完备性,最后通过实例说明了其有效性。 相似文献
2.
3.
归结原理(resolution principle)是计算机自动推理的重要原理之一.将XML加入到使用归结原理的证明过程中,利用XML结构与语义自描述的特性,简化归结过程的计算机实现,并给出相应基于XML的算法. 相似文献
4.
归结原理(resolution principle)是计算机自动推理的重要原理之一。将XML加入到使用归结原理的证明过程中,利用XML结构与语义自描述的特性,简化归结过程的计算机实现,并给出相应基于XML的算法。 相似文献
5.
6.
7.
8.
9.
给出了格值命题逻辑系统L9P(X)上的放缩原理和放缩归结原理,基于放缩归结原理,给出了一种判断L9P(X)上子句集S为M-可满足的自动推理算法(这里M为L9上的中界元),并证明了其可靠性和完备性。 相似文献
10.
语义归结、锁归结、线性归结是三种重要的关于归结原理的改进。本文给出如下结果:语义归结和锁归结在某种条件下是相容的;语义归结和线性归结是不相容的;线性归结和锁归结在某种条件下是相容的。显然,任意两种归结的相容方法是对原来两种归结方法的进一步改进。 相似文献
11.
12.
13.
14.
Peter Baumgartner 《Journal of Automated Reasoning》1996,16(3):241-319
We present a new transformation method by which a given Horn theory is transformed in such a way that resolution derivations can be carried out which are both linear (in the sense of Prologs SLD-resolution) and unit-resulting (i.e the resolvents are unit clauses). This is not trivial since although both strategies alone are complete, their naïve combination is not. Completeness is recovered by our method through a completion procedure in the spirit of Knuth-Bendix completion, however with different ordering criteria. A powerful redundancy criterion helps to find a finite system quite often. The transformed theory can be used in combination with linear calculi such as e.g. (theory) model elimination to yield sound, complete and efficient calculi for full first order clause logic over the given Horn theory. As an example application, our method discovers a generalization of the well-known linear paramodulation calculus for the combined theory of equality and strict orderings. The method has been implemented and has been tested in conjunction with a model elimination theorem prover. 相似文献
15.
The relation between generalized resolution and NC-resolution is discussed.The proof of the completeness of NC linear resolution is then given.The incompleteness of NC lock resolution is also presented,thus the conclusion in [3] of “a simple completeness-preserving restriction” is shown to be wrong. 相似文献
16.
Omar Benjelloun Hector Garcia-Molina David Menestrina Qi Su Steven Euijong Whang Jennifer Widom 《The VLDB Journal The International Journal on Very Large Data Bases》2009,18(1):255-276
We consider the entity resolution (ER) problem (also known as deduplication, or merge–purge), in which records determined
to represent the same real-world entity are successively located and merged. We formalize the generic ER problem, treating
the functions for comparing and merging records as black-boxes, which permits expressive and extensible ER solutions. We identify
four important properties that, if satisfied by the match and merge functions, enable much more efficient ER algorithms. We
develop three efficient ER algorithms: G-Swoosh for the case where the four properties do not hold, and R-Swoosh and F-Swoosh
that exploit the four properties. F-Swoosh in addition assumes knowledge of the “features” (e.g., attributes) used by the
match function. We experimentally evaluate the algorithms using comparison shopping data from Yahoo! Shopping and hotel information
data from Yahoo! Travel. We also show that R-Swoosh (and F-Swoosh) can be used even when the four match and merge properties
do not hold, if an “approximate” result is acceptable. 相似文献
17.
多分辨率仿真中一致性问题研究 总被引:2,自引:0,他引:2
在多分辨率仿真中,当不同级别分辨率实体交互时会出现一致性问题,它的产生是由于建模人员还没有找到一种很好的方法,去描述同一实体在多个分辨率级别间的相互关系而导致的,即使在同一分辨级别中也可能发生不一致性问题,分析了目前建模方法存在的问题,提出了解决一致性问题的CM方法,CM方法主张使用多分辨率实体(MRE)的概念来替代聚合实体(AE)和解聚实体(DE),以一致的方式在指定的分辨率级别描述被仿真的对象,当有请求时,及时提供任意级别的属性绑定,建立了映射函数和一致性模型,较好地解决了属性集数据的识别,时间的一致性和映射一致性等关键问题。 相似文献
18.
19.
This note settles the complexity of the single genotype resolution problem showing it is NP-complete. This solves an open problem raised by P. Bonizzoni, G.D. Vedova, R. Dondi, and J. Li. The same proof also gives an alternative and simpler reduction of the NP-hardness of Maximum Resolution problem. 相似文献
20.
Juan Luis Esteban 《Information Processing Letters》2003,87(6):295-300
We show that the Player-Adversary game of Pudlák and Impagliazzo [A lower bound for DLL algorithms for k-SAT, in: Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 128-136] played over CNF propositional formulas gives an exact characterization of the space needed in treelike resolution refutations. This characterization is purely combinatorial and independent of the notion of resolution. We use this characterization to give for the first time a separation between the space needed in treelike and general resolution. 相似文献