网络坦克作战系统基于MAS的决策过程分析与研究

网络坦克作战系统的决策过程是一个群组决策过程.系统决策过程实质上是各组成部分协作进行问题求解的过程.基于多Agent系统(MAS)的网络坦克作战系统决策是系统中多个Agent面向作战任务进行协作问题求解的过程.运用MAS技术对系统的决策过程进行了分析,提出了系统基于MAS的群组决策基本框架,给出了分布式的系统决策结构,并对决策过程进行了设计和详细分析.MAS协作规划有利于系统的群组决策.     

MAS及其相关概念

1 引言现实世界存在大量分布系统,MAS(多Agent系统)结构为其提供了一条研究途径,网络及多处理机的硬件研究成果为其实现提供了必要的支持。 MAS系统由多个智能体(Agent)组成,每一个Agent又是一个自治计算实体,具有目标、知识和能力。我们为什么要研究MAS?首先MAS优于仅由单     

敏捷供应链协同决策体系中MAS的结构与设计

根据敏捷供应链管理过程中决策活动的特点，阐述了敏捷供应链协同决策体系中引入Agent的原因，讨论了多Agent系统(MAS)在敏捷供应链协同决策体系中的应用，研究了MAS的组成结构，建立了敏捷供应链协同决策体系中上层Agent联邦的功能组成，并提出了一种基于Java bean组件技术和面向Agent设计的MAS的设计方法。最后，介绍了MAS在敏捷供应链协同商务系统中的应用。     

基于MAS的通信指挥分布式智能GDSS开发研究

该文在分析通信指挥决策特点的基础上,结合通信指挥决策的体系、流程和内容,立足面向功能的Agent设计思想,构建了多Agent系统（MAS）共同实现通信指挥的决策功能,给出了基于MAS的通信指挥分布式智能群体决策支持系统（GDSS）的系统体系结构、水平体系结构、逻辑体系结构的各部分组成及功能,并对系统实现的协同机制、驱动方式、裁决模式和知识学习等关键技术进行了探讨。     

基于MAS的群体决策支持系统结构研究

具有分布式和并行性的群体决策支持系统(GDSS)是决策支持系统(DSS)的发展趋势.由于Multi-Agent 系统(MAS)与GDSS之间的相似性,基于Multi-Agent系统的GDSS研究成为热点研究领域.针对目前基于MultiAgent系统的GDSS研究中多Agent采用集中式结构、决策任务的结构化要求等局限性,本文提出了一种基于Multi-Agent系统的群体决策支持系统通用结构框架,系统中的各Agent是相互独立自主的,通过相互合作实现决策任务.文中详细描述了系统各组成部分的功能及相互关系,同时采用BNF范式进行了形式化定义.本文设计的系统为GDSS的进一步深入研究提供了一条新的有效途径.     

MAS系统的问题求解能力分析

本文用状态空间搜索模型分析了多Agent系统(MAS)的问题求解能力，认为MAS系统中Agent之间知识的组合应用和对问题搜索方向的交互和决策是影响MAS系统问题求解能力的主要原因，在状态空间搜索模型下可以将Agent间知识的组合应用表达为不同Agent的搜索路径的组合，而Agent对搜索方向的判断是基于启发式信息做出的，从而为形式化分析MAS系统的性能建立了通用的模型．本文以A*算法为例探讨了可采纳算法下多Agent合作求解效果与Agent的知识和启发信息之间的关系，指出只有在一定条件下MAS系统才会获得更好的解题能力．本文还对非可采纳算法下MAS系统性能分析方法提出了初步看法．     

分布式智能故障诊断模型的MAS实现研究

该文分析了基于MAS的分布式智能故障诊断方法和过程,提出并实现了一种任务分解的Agent诊断系统结构及原型系统。在某企业安全监控系统的应用中,该模型能快速、准确地进行故障成因分析,并给出合理的、建设性的决策意见。     

基于MAS的企业GDSS设计

由于企业决策支持系统GDSS的分布性和协同性,采用基于多层次MAS的企业GDSS可提高决策效率、缩短决策周期。本文讨论了以多重层次结构设计的系统的通信方式、总体结构、功能划分、动态特性,设计了基于多个agent群的企业GDSS结构模型,分析了各agent群的结构和实现,最后给出了系统的实现过程。     

从数据挖掘到机会／征兆发现

机会发现以及时发现动态确定性系统中能够对决策产生显著影响的事件为目标，是2000年以来智能信息处理研究领域中一个新兴的研究方向。本文根据机会发现的研究目标，提出了机会／征兆发现的概念。机会／征兆发现与数据挖掘和知识发现具有天然的联系，本文对机会／征兆发现与数据挖掘（知识发现）的联系与区别进行了讨论，并对文本机会／征兆发现进行了概述。     

基于MAS的农业专家系统平台的研究

针对农业领域知识的分布性、易更新性、可重用性等特点,将MAS理论和技术应用到农业专家系统平台的开发中,提出了基于MAS的农业专家系统平台的结构,并讨论了实现该平台的一些关键技术.本系统平台的研究将加速Agent的实现与应用;同时会降低开发农业专家系统的成本,最终使农业专家系统更好地为农业、农村、农民服务.     

Logic of knowledge and discovery via interacting agents - Decision algorithm for true and satisfiable statements

In this paper we study logical properties of the operation chance discovery (CD) via structures based on special Kripke/Hintikka models. These models use as bases partially ordered sets of indexes (indexes of steps in a computation, or ones indicating time points in a time flow), and clusters of states associated to each index. The language chosen to build the logical formulas includes modal/temporal operations, operations for the agents’ knowledge, local and global operations for CD, operation of local common knowledge, and an operation for chance of discovery via agents’ interactions. We introduce and study a logic (of knowledge and discovery via interaction of agents), LDK_a, which is defined by semantics, as the set of all formulas that are valid in all suggested models. The paper provides an algorithm to recognize logical laws (and satisfiable formulas) of LDK_a. The algorithm replaces a formula with a rule in a special, so-called reduced normal form, and, then it verifies the validity of this rule in specific models of exponential size in the size of the rule. We show that the problem of computing the true logical laws of LDK_a is decidable.     

一种基于Büchi自动机的LTL程序模型检测方法

时序逻辑程序的形式化验证对提高程序的正确性具有重要意义。基于自动机的理论,用标签转移系统（S）表示程序的行为,用时序逻辑公式（F）描述程序的性质,构建相应的Büchi自动机,从而证明形式化公式SF是否可满足。     

Generalizations of the Continuous Logic

An order logic is studied, i.e., a generalization of the continuous logic to the case in an arbitrary argument of order r is determined instead of the operations of determination of maximum (disjunction) and minimum (conjunction). The new operation is expressed as a superposition of disjunctions and conjunctions of the continuous logic. Different classes of logical determinants—numeric characteristics of matrices that can be expressed through the operations of the continuous logic—are studied. Order determinants that are the generalizations of order logic operations to arguments in matrix form are studied. Determinants with different types of constraints on matrix subsets defining the matrix characteristic are described. For logical determinants, the properties that partly resemble the properties of algebraic determinants and computation formulas based on the operations of continuous logic are described. A predicate decision algebra generalizing the continuous logic to modeling of discontinuous functions is elaborated. A hybrid logic algebra is generalized to hybrid (continuous and discrete) variables. A logical arithmetic algebra, which includes continuous logical operations along with the four arithmetical operations, is described. A complex logic algebra in which the carrier set C is a field of complex numbers is developed. For all these logical algebras, main laws are formulated and their similarity to and distinction from the laws of the continuous logic are described. Generalizations of continuous logic operations as operations over matrices and random and interval variables are investigated. Their fields of application are described.     

A spatial logic for concurrency—II

We present a modal logic for describing the spatial organization and the behavior of distributed systems. In addition to standard logical and temporal operators, our logic includes spatial operations corresponding to process composition and name hiding, and a fresh name quantifier. In Part I of this work we study the fundamental semantic properties of our logic; the focus of the present Part II is on proof theory. The main contributions are a sequent-based proof system for our logic, and a proof of cut-elimination for its first-order fragment.     

随机模糊环境下的命题逻辑真度理论*

在实单位区间[0,1]具有一定概率分布的基础上,引入命题逻辑公式的随机模糊意义下的真度概念,指出随机真度是已有文献中各种命题逻辑真度的共同推广.利用随机模糊真度定义公式间的随机模糊相似度,导出全体公式集上的一种伪距离——随机模糊逻辑伪距离,证明在随机模糊逻辑伪距离空间无孤立点.利用概率论中的积分收敛定理,证明一个关于随机模糊真度的极限定理.研究已有各种真度之间的联系.证明随机逻辑伪距离空间中逻辑运算的连续性,并将概率逻辑学基本定理推广至多值命题逻辑.在随机逻辑伪距离空间中提出2种不同类型的近似推理模式并应用于实际问题的近似推理.     

G-逻辑及其归结推理

该文提出了一种粒-逻辑，简记为G-逻辑，并构造了这种逻辑的近似推理系统，定义了G-公式、G-子句和G-文字，提出了这种逻辑的G-归结方法．G-归结的完备性定理也被证明了．这种逻辑公式的结构是有序二元对，第一元是断言；第二元是对应于这个断言的可定义集或不可定义域集的近似集．这种逻辑是定义在信息系统IS=(U，A)上，所以其公式中的个体变量被赋予U上的实体．公式中的命题或谓词被解释为属性集A上的属性，因此命题或谓词的意义集是U上的一个子集、属性及其意义集一起构成的二元对，被称做一个基本粒(granule)．而这种基本粒被当做这种逻辑中的一个G-原子，用G逻辑联结词组合这些G-原子便得到这种逻辑中的G-公式．公式的可满足性是其相应断言的意义集不空．当这种公式的定义域集不可定义时，则可将它移到其定义域集的Rough下和上近似集上去讨论．G-逻辑的提出为经典逻辑的应用开辟了新途径，也为处理非规范知识提供了较好的理论工具．G-逻辑的运算涉及整体到局部的分解和局部到整体的合并，以此提供了AI中问题求解的新思路．G-逻辑也是Rough逻辑的新扩充，其真值概念及其运算都不同于经典逻辑，也不同于其它非标准逻辑．这种逻辑中的演算既是逻辑的，又是集合论的．于是当处理真值及其运算时适合使用逻辑方法；而处理归结中的文字合一时可用集合论方法，这样可避免复杂的文字合一计算．最后，用实例说明了这种逻辑的G-归结方法的可行性和有效性，并给出了G-逻辑中机器定理证明的相关定理，讨论了G-归结反演的完备性和完全性．     

谓词模态逻辑到对应物理论的翻译

对应物理论(counterpart theory)是一阶逻辑的一种理论.Lewis利用谓词模态逻辑到对应物理论的翻译来研究谓词模态逻辑的性质,但是Lewis的翻译存在把不可满足的公式翻译为可满足公式的情况针对这个问题,提出了一种扩展语义的谓词模态逻辑,建立了扩展语义后谓词模态逻辑模型与对应物理论模型的一一对应关系,并在此基础上建立了谓词模态逻辑到对应物理论的语义忠实语义满翻译(faithful and full translation),其可确保将谓词模态逻辑的可满足公式和不可满足公式分别翻译为对应物理论的可满足公式和不可满足公式.由对应物理论是可靠的、完备的一阶逻辑的理论且语义忠实语义满翻译保持可靠性和完备性,进一步证明了扩展语义的谓词模态逻辑也是可靠和完备的.     

Theory of （n） truth degrees of formulas in modal logic and a consistency theorem

The theory of (n) truth degrees of formulas is proposed in modal logic for the first time. A consistency theorem is obtained which says that the (n) truth degree of a modality-free formula equals the truth degree of the formula in two-valued propositional logic. Variations of (n) truth degrees of formulas w.r.t. n in temporal logic is investigated. Moreover, the theory of (n) similarity degrees among modal formulas is proposed and the (n) modal logic metric space is derived therefrom which contains the classical logic metric space as a subspace. Finally, a kind of approximate reasoning theory is proposed in modal logic. Supported by the National Natural Science Foundation of China (Grant Nos. 10331010 and 10771129), and the Foundation of 211 Construction of Shaanxi Normal University     

A modal proof theory for final polynomial coalgebras

An infinitary proof theory is developed for modal logics whose models are coalgebras of polynomial functors on the category of sets. The canonical model method from modal logic is adapted to construct a final coalgebra for any polynomial functor. The states of this final coalgebra are certain “maximal” sets of formulas that have natural syntactic closure properties.

The syntax of these logics extends that of previously developed modal languages for polynomial coalgebras by adding formulas that express the “termination” of certain functions induced by transition paths. A completeness theorem is proven for the logic of functors which have the Lindenbaum property that every consistent set of formulas has a maximal extension. This property is shown to hold if the deducibility relation is generated by countably many inference rules.

A counter-example to completeness is also given. This is a polynomial functor that is not Lindenbaum: it has an uncountable set of formulas that is deductively consistent but has no maximal extension and is unsatisfiable, even though all of its countable subsets are satisfiable.     

Hybridizing a Logical Framework

Logical connectives familiar from the study of hybrid logic can be added to the logical framework LF, a constructive type theory of dependent functions. This extension turns out to be an attractively simple one, and maintains all the usual theoretical and algorithmic properties, for example decidability of type-checking. Moreover it results in a rich metalanguage for encoding and reasoning about a range of resource-sensitive substructural logics, analagous to the use of LF as a metalanguage for more ordinary logics.This family of applications of the language, contrary perhaps to expectations of how hybridized systems are typically used, does not require the usual modal connectives box and diamond, nor any internalization of a Kripke accessibility relation. It does, however, make essential use of distinctively hybrid connectives: universal quantifiation over worlds, truth of a proposition at a named world, and local binding of the current world. This supports the claim that the innovations of hybrid logic have independent value even apart from their traditional relationship to temporal and alethic modal logics.