An Abstract Reachability Approach by Combining HOL Induction and Multiway Decision Graphs

In this paper, we provide a necessary infrastructure to define an abstract state exploration in the HOL theorem prover. Our infrastructure is based on a deep embedding of the Multiway Decision Graphs (MDGs) theory in HOL. MDGs generalize Reduced Ordered Binary Decision Diagrams (ROBDDs) to represent and manipulate a subset of first-order logic formulae. The MDGs embedding is based on the logical formulation of an MDG as Directed Formulae (DF). Then, the MDGs operations are defined and the correctness pro...     

一类基于小波框架的采样子空间

采样定理是现代信息理论与技术的基本工具,具有采样性质的信号具有比较完美的信息重构形式.Walter 和 Zhou 将古典信号的采样定理发展到小波子空间.发展了基于小波框架的数字信号的采样定理与方法.提出并回答了信息理论中的一个基本问题:一个能量有限的数字信号,是否具有采样定理的形式.以小波框架为工具给出了具有采样性质的数字信号的刻画;对于一个给定的采样子空间,给出了该子空间的信号的表示形式;特别是给出了一大类新的具有采样性质的数字信号空间.应用实例表明,从理论和实践上对于数据信息的采样和重构是有意义的,是对以往相关结果的有效改进.     

一种基于中国剩余定理的数字指纹体制

数字指纹技术可以追踪盗版拷贝的来源,在版权保护方面具有很重要的作用,受到越来越广泛的关注.本文提出了一种基于中国剩余定理的数字指纹体制,避免使用一般的安全多方计算协议,该方案不仅具有较好的实现效率,而且还能确定性地跟踪叛逆者.     

函数S-粗集与规律F-隐藏

函数单向S-粗集(Function one direction singular rough sets)是用R-函数等价类定义的,函数是个规律;函数单向S-粗集具有规律特征、动态特征.利用函数单向S-粗集,给出规律F-隐藏概念,提出规律的F-隐藏定理,隐藏识别准则,给出规律的F-隐藏的应用.规律的F-隐藏是函数S-粗集中的一个新的应用研究方向,函数S-粗集是信息规律研究中的一个新理论与新工具.     

A robust test of uncertain linear systems

In this paper, it is shown that for low-order uncertain systems, there is no need to calculate all the minimum and maximum values of the coefficients for a perturbed system which is expressed in terms of polynomials and hence no need to formulate and test all the four Kharitonov＇s polynomials. Furthermore, for higher-order systems such as n ≥ 5, the usual four Kharitonov＇s polynomials need not be tested initially for sufficient condition of perturbed systems; rather, the necessary condition can be checked before going for sufficient condition. In order to show the effectiveness of the proposed method, numerical examples are shown and computational efficiency is highlighted.     

基于消点法的几何自动推理系统实现

为了实现几何自动推理的可读性证明,并提高推理效率,介绍了一个基于消点法的可构造性几何命题自动推理系统的设计与实现。该系统提供作图的方式接受用户的几何命题前提条件的输入,可以对初等几何中的大部分可构造性几何问题进行自动证明和求解,并生成可读的证明步骤,大大方便了初高等几何教育和相关研究者的需要。     

.NET平台下故障树分析技术的实现及应用

故障树分析是一种自上而下的方法,通过对可能造成系统故障的硬件、软件、环境、人为因素进行分析,分析得出故障原因的各种可能组合方式,由总体至部分,按树状结构,逐层细化的一种分析方法.开发了故障树分析工具,提供了对规范化故障树定性的割集计算、简化等功能,提出了基于容斥定理的定量化顶事件概率简化计算方法,可满足企业对部件级元件进行故障详细分析的需求.还给出了所开发的系统实现界面,系统已在某企业中得到了具体的应用.     

An auxiliary theorem for stability analysis in the presence of interval-valued parameters

A theorem which helps to determine the boundary of the image of an interval inR ⁿ under a differentiable mapping,F:R ⁿ C, is expounded. Examples illustrating the application of the theorem are given.     

The liberalized δ-rule in free variable semantic tableaux

In this paper we have a closer look at one of the rules of the tableau calculus presented by Fitting [4], called the -rule. We prove that a modification of this rule, called the ⁺-rule, which uses fewer free variables, is also sound and complete. We examine the relationship between the ⁺-rule and variations of the -rule presented by Smullyan [9]. This leads to a second proof of the soundness of the ⁺-rule. An example shows the relevance of this modification for building tableau-based theorem provers.     

A new methodology for query answering in default logics via structure-oriented theorem proving

We present a new approach to query answering in default logics. The basic idea is to treat default rules as classical implications along with some qualifying conditions restricting the use of such rules while query answering. We accomplish this by taking advantage of the conception of structure-oriented theorem proving provided by Bibel's connection method. We show that the structure-sensitive nature of the connection method allows for an elegant characterization of proofs in default logic. After introducing our basic method for query answering in default logics, we present a corresponding algorithm and describe its implementation. Both the algorithm and its implementation are obtained by slightly modifying an existing algorithm and an existing implementation of the standard connection method. In turn, we give a couple of refinements of the basic method that lead to conceptually different algorithms. The approach turns out to be extraordinarily qualified for implementations by means of existing automated theorem proving techniques. We substantiate this claim by presenting implementations of the various algorithms along with some experimental analysis.Even though our method has a general nature, we introduce it in the first part of this paper with the example of constrained default logic. This default logic is tantamount to a variant due to Brewka, and it coincides with Reiter's default logic and a variant due to ukaszewicz on a large fragment of default logic. Accordingly, our exposition applies to these instances of default logic without any modifications.