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.     

SATCHMORE: SATCHMO with RElevancy

We introduce a relevancy detection algorithm to be used in conjunction with the SATCHMO prover. The version of SATCHMO considered here is essentially a bidirectional prover, utilizing Prolog (back chaining) on Horn clauses and forward chaining on non-Horn clauses. Our extension, SATCHMORE (SATCHMO with RElevancy), addresses the major weakness of SATCHMO: the uncontrolled use of forward chaining. By marking potentially relevant clause head literals, and then requiring that all the head literals be marked relevant (be totally relevant) before a clause is used for forward chaining, SATCHMORE is able to guide the use of these rules. Furthermore, the relevancy testing is performed without extending the proof search beyond what is done in SATCHMO. A simple implementation of the extended SATCHMO can be written in Prolog. We describe our relevancy testing approach, present the implementation, prove soundness and completeness, and provide examples that demonstrate the power of relevancy testing.This research was partially supported by NSF Grants IRI-8805696 and CCR-9116203. This paper is a major revision of Wilson and Loveland (1989).     

A Ramsey theorem in Boyer-Moore logic

We use the Boyer-Moore Prover, Nqthm, to verify the Paris-Harrington version of Ramsey's theorem. The proof we verify is a modification of the one given by Ketonen and Solovay. The theorem is not provable in Peano Arithmetic, and one key step in the proof requires ₀ induction.Author supported by NSF Grant DMS-9100665.     

基于特勒根定理的风场送出线路新型纵联保护

双馈风机和永磁直驱风机广泛应用于陆上风电场。受控制策略影响,送出线路故障时风场侧故障特性与同步机电源差异显著,使传统纵联保护性能下降。特勒根定理建立于基尔霍夫电压、电流定律,仅与电路拓扑结构有关,对含线性/非线性、时变/时不变元件的电路均能适用。将特勒根定理应用到陆上风场送出系统,建立了满足定理应用要求的线路故障拓扑结构图。以此为基础,分析了能够区分内、外部故障的特征量,提出了一种基于故障前后线路两端电压电流的新型纵联保护动作判据。利用风场多个故障案例的录波数据和基于PSCAD的仿真数据对所提判据进行验证及对比分析,证明了所提纵联保护方法的优越性和可行性。     

分数阶时滞非线性多智能体系统的自适应控制

针对分数阶多智能体系统中存在时滞和非线性特性, 时滞往往会引起控制系统的性能下降甚至出现系统 不稳定等问题, 提出了一种含时滞非线性的分数阶多智能体系统自适应控制方法. 对于多智能体系统的控制协议, 设计了基于领导者和相邻智能体状态信息的自适应控制协议, 减小了过大常数控制增益带来的能源浪费. 对于一 致性, 利用图论基础、分数阶Halanay不等式稳定性定理、Kronecker积和Schur补引理, 获得了分数阶时滞非线性多 智能体系统的LMI一致性条件. 仿真结果验证了本文算法的正确性和有效性. 由于整数阶系统是分数阶系统的特殊 形式, 本文结论可以直接推广到整数阶多智能体系统中.     

基于区域划分和余弦定理的DV-Hop算法改进

针对传统距离向量-跳段定位算法(Distance Vector-Hop,DV-HOP)存在的节点密度分布不均引起误差比较大的问题,根据DV-Hop算法特性,采用余弦定理,证明节点密度越大所得定位坐标越准确,使用余弦定理减少在节点密度过大时因空间角度导致节点路径曲折过多而引起的误差,同时提出一种区域划分的改进算法,减少在节点密度较小区域的误差;利用接收信号强度指示(Received Signal Strength Indicator,RSSI)对跳数进行量化分级处理,改善实际距离与计算出的距离相差过大的情况;最后采用最小二乘法估计未知节点坐标。仿真表明,所提出的算法与传统的DV-Hop算法相比,误差有一定的减少。     

Bayes Theorem Based Virtual Machine Scheduling for Optimal Energy Consumption

This paper proposes an algorithm for scheduling Virtual Machines (VM) with energy saving strategies in the physical servers of cloud data centers. Energy saving strategy along with a solution for productive resource utilization for VM deployment in cloud data centers is modeled by a combination of “Virtual Machine Scheduling using Bayes Theorem” algorithm (VMSBT) and Virtual Machine Migration (VMMIG) algorithm. It is shown that the overall data center’s consumption of energy is minimized with a combination of VMSBT algorithm and Virtual Machine Migration (VMMIG) algorithm. Virtual machine migration between the active physical servers in the data center is carried out at periodical intervals as and when a physical server is identified to be under-utilized. In VM scheduling, the optimal data centers are clustered using Bayes Theorem and VMs are scheduled to appropriate data center using the selection policy that identifies the cluster with lesser energy consumption. Clustering using Bayes rule minimizes the number of server choices for the selection policy. Application of Bayes theorem in clustering has enabled the proposed VMSBT algorithm to schedule the virtual machines on to the physical server with minimal execution time. The proposed algorithm is compared with other energy aware VM allocations algorithms viz. “Ant-Colony” optimization-based (ACO) allocation scheme and “min-min” scheduling algorithm. The experimental simulation results prove that the proposed combination of ‘VMSBT’ and ‘VMMIG’ algorithm outperforms other two strategies and is highly effective in scheduling VMs with reduced energy consumption by utilizing the existing resources productively and by minimizing the number of active servers at any given point of time.     

Efficient conditional probability theorem and importance sampling-based methods for global reliability sensitivity analysis

Global reliability sensitivity (GRS) analysis can measure the effect of random inputs on failure probability (FP). To efficiently solve GRS, two conditional probability theorem (CPT)-based methods are proposed by combining adaptive Kriging (AK) with importance sampling (IS) (CPT-AK-IS) and combining AK with Meta-IS (CPT-AK-Meta-IS) respectively. Firstly, differentiation approximation and CPT are used to convert the estimation of conditional probability density function (PDF), which is required by the existing Bayes theorem-based methods, into that of a series of probabilities. Secondly, GRS can be directly estimated by the failure samples of IS, while the existing Bayes theorem methods based on IS need to transform the failure samples of IS into those of original PDF. Both the first and second strategies can reduce the computational complexity of solving GRS. Thirdly, by selecting a suitable differentiation interval with a proposed adaptive strategy, the estimation of a series of probabilities can be accurately completed as a byproduct of one IS based simulation for solving FP without additional computational cost. Finally, by introducing AK into IS and Meta-IS, it can reduce the number of evaluating performance function and the size of candidate sample pool simultaneously. These novelties are sufficiently verified by the presented examples.     

双枝模糊集(Ⅲ)

提出双枝模糊集Ｓ的理论,本课题是［Ⅰ,Ⅱ］研究的继续．在单枝模糊集理论（Ｌ．Ａ．ＺａｄｅｈＦｕｚｚｙＳｅｔＴｈｅｏｒｙ）研究中,由于引进λ－截集Ｓλ的概念,便产生了单枝模糊集的并－普通分解定理［３］,交－普通分解定理［４］．［Ⅰ,Ⅱ］提出了双枝模糊集Ｓ,由于引进了λ－截集Ｓλ的概念,便产生了双枝模糊集Ｓ的并－普通分解定理,交－普通分解定理．人们自然提出这样的问题：双枝模糊集可以分解成若干个普通集Ｓλ;双枝模糊集Ｓ是否能分解成若干个模糊集Ｓα？本文的研究说明：双枝模糊集Ｓ可以分解成若干个模糊集Ｓα．（一个单枝模糊集Ａ也可以分解成若干个模糊集Ａα,但是在单枝模糊集理论中没有被人们去研究．）本文给出Ｓ的α－嵌入集Ｓα的概念,提出Ｓ的α－嵌入定理,Ｓ的α－嵌入模糊分解定理．