共查询到20条相似文献,搜索用时 60 毫秒
2.
“知识编译”这一术语是指:给出某知识K 和一个知识编译函数 C,将 C 作用于 K 得出编译知识 K';即:C(K)=K'。假设对完成某一信息处理任务 f,K'比 K 有效,即:f 是期望实现的某种功能,而且利用 K'实现 f 的某功能(以 f_k,表示)要优于利用 K 完成 f 的任何功能(以 f_k 表示)。由 f_k 与 f_k 实现的功能也许不同于 f 的功能。例如:f 是诊断某一设备的任务,K 是关于此设备的一个定性物理模型,C 的功能是将 K 转化为诊断知识 K'。换言之:K'比 K 更直接地将观察与故障相联系。只利用 K 得到一个诊断系统的实现过程为 f_k,而利用 K'的诊断系统实现过程为 f_k'。 相似文献
3.
超扩展规则是对扩展规则的扩充,基于超扩展规则能够求得任意两个非互补且不相互蕴含的子句所能扩展出极大项集的交集、差集和并集,并将所得结果以EPCCL(each pair of clauses contains complementary literals)理论的形式保存.基于超扩展规则的性质,本文提出了一种新的EPCCL理论编译算法:求交知识编译算法IKCHER(intersection approach to knowledge compilation based on hyper extension rule),该算法适合难解类SAT问题的知识编译,同时是一种可并行的知识编译算法.本文还研究了如何实现多个EPCCL理论的求交操作,证明了EPCCL理论的求交过程是可并行执行的,并设计了相应并行求交算法PIAE(parellel intersection of any number of EPCCL).通过对输入EPCCL理论对应普通子句集的利用,设计了一种高效的并行求交算法imp-PIAE(improvement of PIAE).基于上述算法本文还设计了两个并行知识编译算法P-IKCHER(IKCHER with PIAE)和impP-IKCHER(IKCHER withimp-PIAE),分别采用PIAE并行合并算法和imp-PUAE并行合并算法.最后,通过实验验证了大部分情况下IKCHER算法的编译质量是目前为止所有EPCCL理论编译器中最优的,P-IKCHER算法所使用的合并策略并没有起到加速的效果,反而使得编译效率和编译质量有所下降,而impP-IKCHER算法提高了IKCHER算法的编译效率,四核并行下最高可提高两倍. 相似文献
4.
知识库编译系统PROPS是我们在SUN工作站UNIX操作系统环境下研制的一个通用型知识处理系统,该系统不仅能够完成从知识库到C语言代码的编译工作,还允许用户决定目标C语言代码的构成并使用系统所提供的一系列命令来完成知识库的调试等工作。本文着重讨论该系统的功能、组成和关键技术,最后对该系统在数据库领域中的应用作了较为深入的探讨。 相似文献
5.
本文介绍了一种混合式 Prolog-DBMS 耦合技术,它既能保持解释方法和编译方法的优点,又能克服其缺点。这种技术使得随时使用关系数据库算子(比如连接算子)成为可能,同时避免了无用数据(即归结过程中不用的数据)的加载.最后,“历史”管理机制保证了同一数据不会被多次加载。 相似文献
6.
7.
基于知识库的知识发现结构研究 总被引:4,自引:0,他引:4
基于知识库的知识发现系统KDK(KnowledgeDiscoveryBasedonKnowledgebase)是直接从知识信息中提取潜在有用的、新颖的、未知的模式的过程,以解决目前知识爆炸而能提供给决策者有效的决策信息却矛盾很少。不同于KDD,KDK系统将直接作用于大型知识库的构建。该文讨论了KDK的描述性定义,给出了KDK的总体结构模型,及子系统描述。 相似文献
8.
大型知识库知识存储结构的研究及其在知识发现系统中的应用 总被引:1,自引:0,他引:1
在基于数据库和知识库的知识发现系统(KDD&K)的研究中,需对知识库中的重复、冗余、矛盾、循环的知识进行实时校验、修改,并能够发现知识短缺,指导KDD过程进行聚焦;在KDK过程中,需要找出有关联的知识组成的知识域以便于归纳、解释等具体应用需求,针对于此,该文提出了一种基于知识节点(属性)的图矩阵、二维链表、产生式规则的三级管理模式和数据存储结构,通过知识库管理系统(KBMS)实现了二层逻辑结构和一层物理结构的三层独立映射关系,大大压缩了知识的搜索空间。经在KDD&K原型系统中的具体应用,该知识库系统结构的定义以及相应的KBMS完全满足上述要求,并可推广至通用的大、中型知识库系统。 相似文献
9.
在基于扩展规则的知识编译算法的基础上提出了2种启发式策略:MCN策略和MO策略.MCN策略和MO策略利用子句集的信息分别选择相应子句和变量,减少扩展规则的使用次数,进而降低知识编译后目标子句集的规模.在此基础上,设计并实现了MCN_KCER,MO_KCER和MCN_MO_KCER算法.实验结果表明:2种启发式策略都可以大幅度减小编译后的子句集规模,同时使用它们的效果更为明显,经过编译后得到的子句集规模是原算法的1/3~1/39,从而大幅度提高之后的在线推理阶段的效率. 相似文献
10.
11.
提议对加权库进行分层,一方面符合人类的思维习惯,另一方面能够提高推理效率.首先说明现有的针对非分层加权库的编译方法也适用于编译分层加权库,但是,由于存在较多冗余信息而效率不高.提出一种新的编译方法,能够在编译过程中去除冗余信息,并提出两种优化技术提高时间效率.该方法与现有方法相同,当软约束权值改变时无需重新编译.选择ROBDD为目标语言,使用随机问题对该方法进行测试.结果表明:对于非分层加权库,该方法的空间效率高于已存在方法;对于分层加权库,该方法的时间和空间效率均高于已存在方法,且当层数越多时,该方法的效率越高. 相似文献
12.
Thibault Scott Consel Charles Lawall Julia L. Marlet Renaud Muller Gilles 《Higher-Order and Symbolic Computation》2000,13(3):161-178
Interpretation and run-time compilation techniques are increasingly important because they can support heterogeneous architectures, evolving programming languages, and dynamically-loaded code. Interpretation is simple to implement, but yields poor performance. Run-time compilation yields better performance, but is costly to implement. One way to preserve simplicity but obtain good performance is to apply program specialization to an interpreter in order to generate an efficient implementation of the program automatically. Such specialization can be carried out at both compile time and run time.Recent advances in program-specialization technology have significantly improved the performance of specialized interpreters. This paper presents and assesses experiments applying program specialization to both bytecode and structured-language interpreters. The results show that for some general-purpose bytecode languages, specialization of an interpreter can yield speedups of up to a factor of four, while specializing certain structured-language interpreters can yield performance comparable to that of an implementation in a general-purpose language, compiled using an optimizing compiler. 相似文献
13.
在扩展规则的基础上提出了可能性扩展规则。给出了基于可能性扩展规则的可能性逻辑推理方法,利用互补因子的概念来估价推理问题的复杂度。扩展了经典逻辑的蕴含可控制类和可满足可控制类的定义,提出了可能性蕴含可控制类、不一致性程度计算可控制类的概念。在可能性扩展规则的基础上提出了EPPCCCL(each pair of possibilistic clauses contains complementary literals)理论,并证明了该理论是在最优化形式蕴含可控制类和不一致性程度计算可控制类中的,可以作为可能性 相似文献
14.
Knowledge Compilation Using the Extension Rule 总被引:1,自引:0,他引:1
In this paper, we define a new class of tractable theories: EPCCL theories. Using EPCCL theories as a target language, we propose a new method for knowledge compilation. It is different from existing approaches in that both the compilation and the querying are based on the extension rule, a newly introduced inference rule. With our compilation method, arbitrary queries about the compiled knowledge base can be answered in linear time in the size of the compiled knowledge base. For some theories, the compilation can be done very efficiently, and the size of the compiled theory is small. Furthermore, our method suggests a new family of knowledge compilation methods. 相似文献
15.
J. William Murdock Ashok K. Goel Michael J. Donahoo Shamkant Navathe 《Journal of Intelligent Information Systems》2001,17(1):5-21
Generality and scale are important but difficult issues in knowledge engineering. At the root of the difficulty lie two challenging issues: how to accumulate huge volumes of knowledge and how to support heterogeneous knowledge and processing. One approach to the first issue is to reuse legacy knowledge systems, integrate knowledge systems with legacy databases, and enable sharing of the databases by multiple knowledge systems. We present an architecture called HIPED for realizing this approach. HIPED converts the second issue above into a new form: how to convert data accessed from a legacy database into a form appropriate to the processing method used in a legacy knowledge system. One approach to this reformed issue is to use method-specific compilation of data into knowledge. We describe an experiment in which a legacy knowledge system called INTERACTIVE KRITIK is integrated with an ORACLE database. The experiment indicates the computational feasibility of method-specific data-to-knowledge compilation. 相似文献
16.
该文在传统知识库系统的基础上,将本体论引入到知识库中。介绍了本体的起源及其在知识工程领域的发展,探讨了知识库系统中本体的定义和主要作用。然后,研究了知识库系统的构建方法,并以试题知识库系统为例介绍了它的应用。 相似文献
17.
Sylvie Coste-Marquis Pierre Marquis 《Annals of Mathematics and Artificial Intelligence》2004,42(4):399-442
In this paper, we investigate the extent to which knowledge compilation can be used to circumvent the complexity of skeptical inference from a stratified belief base (SBB). We first analyze the compilability of skeptical inference from an SBB, under various requirements concerning both the selection policy under consideration, the possibility to make the stratification vary at the on-line query answering stage and the expected complexity of inference from the compiled form. Not surprisingly, the results are mainly negative. However, since they concern the worst case situation only, they do not prevent a compilation-based approach from being practically useful for some families of instances. While many approaches to compile an SBB can be designed, we are primarily interested in those which take advantage of existing knowledge compilation techniques for classical inference. Specifically, we present a general framework for compiling SBBs into so-called C-normal SBBs, where C is any tractable class for clausal entailment which is the target class of a compilation function. Another major advantage of the proposed approach lies in the flexibility of the C-normal belief bases obtained, which means that changing the stratification does not require to re-compile the SBB. For several families of compiled SBBs and several selection policies, the complexity of skeptical inference is identified. Some tractable restrictions are exhibited for each policy. Finally, some empirical results are presented. 相似文献
18.
19.
地勘地质资料整理在现代矿产资源开采、地质工程建设过程中起到了非常重要的作用,直接关系着矿产资源开采质量、效率以及地质工程的安全可靠性,因此,企业应当加强重视。对地勘地质资料整理的重要性进行了分析,并在此基础上,就其整理方法及具体应用提出了一些观点和建议,以期为我国地勘地质行业的发展提供参考。 相似文献