面向对象知识库系统CAOBS／V1.2的设计与实现

文中介绍了一个面向对象知识库系统ＣＡＯＢＳ／Ｖ１．２。该系统是在一个面向对象数据库管理系统基础上进行开发的。我们重点研究了面向对象的知识表示、可视查询、问题的推理求解与知识的获取机制。在ＣＡＯＢＳ／Ｖ１．２系统中，问题推理求解采用基于事例的推理，辅之以基于规则的推理模式。我们还开发了一种新型的可视知识查询语言－ＶＫＱＬ，其查询的直观性和方便性均要强于传统的文本查询语言。文中论述了ＣＡＯＢＳ／Ｖ１．     

在VB程序中自动配置的ODBC数据源的方法

简要介绍了微软件ＯＤＢＣ数据库访问接口和利用ＶＢ语言在软件设计中通过ＡＤＯ数据访问对象、ＲＤＯ数据访问对象及Ｗｉｎｄｏｗｓ系统注册表操作技术,实现程序自动注册用户ＯＤＢＣ数据源的方法,解决了在数据管理软件安装过程中通过手动依次配置系统ＯＤＢＣ数据源的问题,同时也就在ＶＢ程序中如何在Ｗｉｎｄｏｗｓ系统注册表中建立自己的用户信息键与键值的设置与读取作了实例讲解。     

提高Visual Basic应用程序执行速度的途径

本文介绍采用Ｃ语言建立可供ＶＢ调用的连接库的方法，讨论了ＶＢ调用Ｃ语言时参数传递的一些问题。采用这种方式可以大幅度地提高用ＶＢ开发的应用程序的执行速度，并提高代码的复用率。     

多级流水线结构高层次VHDL语言行为模型的研究

建立数字系统的高层次ＶＨＤＬ语言行为模型,是应用ＶＨＤＬ语言及自动综合系统以自顶向下的方法进行大规模集成电路设计的基础,以ＲＩＳＣＳＰＡＲＣＭＢ８６９０１为例,讨论建立多级复杂流水线结构的ＶＨＤＬ语言高层次行为模型的方法,同时对相关问题进行分析。     

WINDOWS下多媒体MCI编程技术

多媒体控制接口ＭＣＩ提供了ＷＩＮＤＯＷＳ下开发多媒体应用的高层接口。本文讨论了在两种代表性语言ＢｏｒｌａｎｄＣ＋＋Ｖ３．１和Ｖｉｓｕａｌ ＢａｓｉｃＶ３．０下使用的编程方法，并给出了在Ｓｏｕｎｄ Ｂｌａｓｔｅｒ音频卡和Ｖｉｄｅｏ Ｂｌａｓｔｅｒ视频卡多媒体硬件上的编程实例。     

面向对象的通用数据库开发工具POWERBUILDER

利用面向对象程序设计及其开发工具设计编制软件已是九十年代软件开发的一大特征，本文从面向对象的程序设计的角度，剖析了ＣＬＩＥＮＴ／ＳＥＲＶＥＲ环境下的通用数据库开发工具ＰＯＷＥＲＢＵＩＬＤＥＲ的特点、基本结构及其开发数据库应用系统的方法。本文是介绍ＰＯＷＥＲＢＵＩＬＤＥＲ的引导性文章，有关的详细内容，将在后续文章中介绍。     

在VC5程序中应用CORBA对象实现分布式计算

针对ＶＣ５不支持ＣＯＲＢＡ标准分布式程序开发问题。本文巫理论上详细研究了ＣＯＲＢＡ标准体系结构与Ｄｅｌｐｈｉ实现的ＣＯＲＢＡ客户、服务器对象访问机理。从应用上具体指明了如何在Ｄｅｌｐｈｉ环境下创建ＣＯＲＢＡ客户、服务器对象与ＡｃｔｉｖｅＸ组件的编程步骤。最后举例说明在ＶＣ５中,如何开发基于ＣＯＲＢＡ标准分布式应用程序。     

VAX／VMS C语言与RDB数据库软接口

以ＶＡＸ／ＶＭＳ和ＲＤＢ数据库系统为基础，阐述通过预编译的方法实现ＶＡＸ／ＶＭＳ Ｃ程序设计语言与ＲＤＢ数据库系统之间的软件接口理论和技术问题，进而介绍了通过过程调用标准，即共享变量实现ＶＡＸ Ｃ与ＲＤＢ数据系统间软件接口的方法和原理。     

VB和AutoCAD间的数据通信技术

文中介绍了流行的Ｗｉｎｄｏｗｓ应用程序开发工具语言ＶＢ和流行的ＣＡＤ软件包ＡｕｔｏＣＡＤ间的三种数据通信技术,以实例详细地阐述了ＶＢ和ＡｕｔｏＣＡＤ间的ＡｃｔｉｖｅＸ接口技术,为以后ＶＢ程序员进行ＡｕｔｏＣＡＤ二次开发开放了ＡｕｔｏＣＡＤ的制定和开发模式,解决了ＶＢ和ＡｕｔｏＣＡＤ间数据接口的难题。     

QPSK调制与FEC差错控制在DVB系统中的应用

在简要介绍ＤＶＢ接收系统基本结构的基础上,分析了ＤＶＢ－Ｓ标准下数字卫星接收机呆变码率的ＱＰＳＫ解调和ＦＥＣ的差错控制技术,最后结合自行开发的ＤＶＢ数字卫星接收机对包含解调与ＦＥＣ功能的两种集成电路芯片了比较。     

On the soundness,completeness and applicability of the logic of knowledge and communicative commitments in multi-agent systems

Benthem’s correspondence theory is one of the most important tools of the theory of modal logics developed in the last three decades. Correspondence theory, a subfield of the model theory, reflects a systematic study of relations between classes of frames and modal language. In this paper, we use correspondence theory for modal logics to solve a problem not addressed yet in the literature, namely the soundness and completeness of a logic combining two different, yet related modalities: agents’ knowledge and commitments. The paper proves the soundness and completeness of this logic called CTLKC⁺. This work is highly significant as it proves that combining the two agents’ modalities resulted in a consistent logic that can be used to design reliable systems. The methodology is as follows: we develop a set of reasoning postulates (axioms) that reflect the interaction between agents’ knowledge and social commitments in multi-agent system (MAS) using the CTLKC⁺ logic and correspond them to certain classes of frames. In particular, we first give a name, formalization and meaning for each postulate. Then, we correspond the postulates to certain classes of frames and provide the required proofs. Thereafter, we present a discussion that illustrates the importance of the proposed postulates in MASs using a concrete application example called the NetBill protocol taken from the business domain. Finally, we show how the postulates were addressed in the literature. The existence of such a correspondence allows us to prove that the logic generated by any subset of these postulates is sound and complete with respect to models that are based on the corresponding frames. The ultimate goal of this paper is to further assess the logic of knowledge and commitments (CTLKC⁺) from a new perspective (i.e., the soundness and completeness). Consequently, this work advances the literature of logics in MASs and closes a gap that has not been explored before.     

Expanding the propositional logic of a t-norm with truth-constants: completeness results for rational semantics

In this paper we consider the expansions of logics of a left-continuous t-norm with truth-constants from a subalgebra of the rational unit interval. From known results on standard semantics, we study completeness for these propositional logics with respect to chains defined over the rational unit interval with a special attention to the completeness with respect to the canonical chain, i.e. the algebra over $[0,1] \cap {{\mathbb{Q}}}In this paper we consider the expansions of logics of a left-continuous t-norm with truth-constants from a subalgebra of the rational unit interval. From known results on standard semantics, we study completeness for these propositional logics with respect to chains defined over the rational unit interval with a special attention to the completeness with respect to the canonical chain, i.e. the algebra over [0,1] ?\mathbbQ[0,1] \cap {{\mathbb{Q}}} where each truth-constant is interpreted in its corresponding rational truth-value. Finally, we study rational completeness results when we restrict ourselves to deductions between the so-called evaluated formulae.     

Elementary Definability and Completeness in General and Positive Modal Logic

The paper generalises Goldblatt's completeness proof for Lemmon–Scott formulas to various modal propositional logics without classical negation and without ex falso, up to positive modal logic, where conjunction and disjunction, andwhere necessity and possibility are respectively independent.Further the paper proves definability theorems for Lemmon–Scottformulas, which hold even in modal propositional languages without negation and without falsum. Both, the completeness theorem and the definability theoremmake use only of special constructions of relations,like relation products. No second order logic, no general frames are involved.     

Extending Hoare Logic with an Infinite While-Rule

In the paper we generalize the while-rule in Hoare calculus to an infinite one and then present a sufficient condition much weaker than the expressiveness for Cook‘2 relative completeness theorem with respect to our new axiomatic system.Using the extended Hoare calculus we can derive true Hoare formulas which contain while statements free of loop invariants.It is also pointed out that the weak condition is a first order property and therefore provides a possible approach to the characterization of relative completeness which is also a first order property.     

NKI中的本体、框架和逻辑理论

NKI(国家知识基础设施)是一个大规模知识库,它用框架来表示本体中的概念,用Hom逻辑程序作为自动推理.给出NKI中的本体、框架和逻辑理论的形式表示以及形式表示之间的转换,并证明如果将本体、框架和逻辑理论看作是3个范畴,则这些转换是这3个范畴之间的函子.这个结果保证了在NKI中,基于Horn逻辑程序的推理关于用本体和框架表示的知识库是正确的.     

一种新的模态归结

本文首先给出了一种标准子句的定义，在其基础上定义了命题模态逻辑系统Ｓ５的子句集的可归结形式。证明了任意模态Ｓ５子句集不可满足的充要条件为在其可归结形式上可归结出空子句。     

Completeness of type assignment in continuous lambda models

The completeness of Curry's rules for assigning type schemes to terms of the pure lambda-calculus has been proved by Hindley (1983) and Barendregt et al. (1983) using models of syntactic nature. A first result of this paper is a completeness proof with respect to the model P_ω (as asked by Scott (1976)). Moreover, an extension of Curry's system in which type schemes can be assigned to the fixed point combinator is introduced, together with a notion of type semantics for which it is proved sound and complete (answering a question of Scott (1980)). Also in this case, completeness is proved with respect to the model P_ω. All results also hold for the alternative notions of type semantics proposed by Hindley (1983) and Scott (1976, 1980).     

面向问题的软件开发协同建模工具的研究与实现

建模软件是辅助需求工程师分析的工具,在需求设计阶段必不可少。目前,很少有需求建模工具可以跨平台运行,支持在线多用户协同以及验证需求模型正确性和完整性等功能。鉴于问题框架方法在需求工程领域获得了较大关注,文中开发了一款用户体验较好、兼容多平台的计算机辅助问题框架建模软件。本研究解决了自动化校验问题图的正确性和完整性以及复杂问题图拆分等难题,实现了用户登录、云端数据库存储设计和多人协同建模和验证,从而构建了一个在线需求建模、共享和验证的平台。     

Standard completeness of Hájek basic logic and decompositions of BL-chains

The aim of this paper is to survey the tools needed to prove the standard completeness of Hájek Basic Logic with respect to continuous t-norms. In particular, decompositions of totally ordered BL-algebras into simpler components are considered in some detail.