格值一阶逻辑系统LF(X)中带广义量词的不确定性推理

讨论格值一阶逻辑系统LF(X)中带广义量词的不确定性推理规则,和FMP、FMT规则。为研究带广义量词的归结自动推理作准备,也为研究语言值逻辑推理提供一阶逻辑系统的基础平台。     

格值一阶逻辑系统LF（X）中带广义量词的α-归结原理

讨论格值一阶逻辑系统LF(X)中带广义量词的α-归结,证明了带广义量词的Herbrand-定理,为格值一阶逻辑系统中带广义量词的不确定性自动推理作了理论的准备.     

LF(X)中带广义量词的可靠性定理

讨论一阶格值逻辑系统LF（X）中带广义量词的语法推理，同时证明了LF（X）中带广义量词的可靠性定理，作为应用我们对带广义量词的一些推理规则作了语法的证明。     

含有全称量词、存在量词的不等式成立问题的转化策略

函数的最值以及含参数的函数的单调性与不等式恒成立的结合一直是高考命题的热点,特别是课改教材中引入了全称量词、存在量词等知识点之后,这一热点有持续高热之势.由于全称量词与存在量词的差异,对不等式两侧函数最值的要求也体现出了差异,     

区间值合作对策的广义区间Shapley值

研究区间Shapley值通常对区间值合作对策的特征函数有较多约束,本文研究没有这些约束条件的区间值合作对策,以拓展区间Shapley值的适用范围。首先,本文指出广义H-差在减法与加法运算中存在的问题,进而提出了一种改进的广义H-差,称为扩展的广义H-差。然后,基于扩展的广义H-差,定义了区间值合作对策的广义区间Shapley值,并用区间有效性、区间对称性、区间哑元性和区间可加性等四条公理刻画了该广义区间Shapley值。同时,证明了该值的存在性与唯一性,而且得到了该值的一些性质。研究表明,任意的区间值合作对策的广义区间Shapley值都存在。最后,以算例说明该广义区间Shapley值的可行性与实用性。     

模糊支付合作博弈的广义Shapley函数

基于广义H-差研究了收益是模糊数的合作博弈的广义Shapley函数。首先,对广义H-差的运算做了合理的假设,并以此为基础,给出了区间值合作博弈的广义区间Shapley值的定义和公理体系。然后,根据模糊数与其截集的关系,给出了模糊支付合作博弈的广义Shapley函数的表达式,并用广义有效性、广义哑元性、广义对称性、广义可加性等四条公理刻画了该广义Shapley函数。同时,给出了广义Shapley函数的存在性条件,证明了广义Shapley函数的存在性与唯一性。并且发现,任意的区间值合作博弈的广义区间Shapley值都存在,任意的收益为中心三角模糊数的合作博弈的广义Shapley函数也都存在。另外,本文指出了不能直接利用α—截集博弈的广义区间Shapley值通过集合套理论构造广义Shapley函数。     

广义次似凸集值优化的鞍点定理

讨论广义次似凸集值优化的鞍点定理.给出广义次似凸集值映射的两个性质.定义广义次似凸集值优化的Fritz-John鞍点和Kuhn-Tucker鞍点.获得一系列广义次似凸集值优化的鞍点定理.     

广义次似凸集值优化的对偶定理

我们讨论了广义次似凸集值优化的对偶定理.首先,我们给出了广义次似凸集值优化的对偶问题.其次,我们给出了广义次似凸集值优化的对偶定理.最后,我们考虑了广义次似凸集值优化问题的标量化对偶,并给出了一系列对偶定理.     

基于结构元理论的广义模糊权值网络中心度分析

针对现有权值网络中心度测量要么只关注边数,要么只关注权值的问题,提出了一个基于结构元的模糊权值网络中心度的测量方法。运用模糊结构元理论解析表达了广义模糊权值网络程度中心度、广义模糊权值网络亲密中心度和广义模糊权值网络中间性中心度;并结合算例验证了基于结构元理论的广义模糊权值网络中心度测量方法的可行性,展示了结果的丰富性。     

广义函数的集值导数

本文应用广义函数的调和表示,引进了一维广义函数的集值导数,并给出了连续函数的集值导数的几种等价定义.局部Lipschitz函数的集值导数同Clarke定义的广义梯度一致;广义函数在一点附近是Lipschitz 函数之充要条件是它在该点的集值导数是有限的.当广义函数在某点的集值导数不同时包含+∞和-∞时,它的广义导函数在该点的某邻域上是Radon测度.利用一阶集值导数,给出了连续函数的逆函数存在定理;应用高阶集值导数,得到了广义函数取极值的两种非常一般的充分条件.广义函数在一个开区间上成为凸函数的充要条件是它在该区间内每点处的二阶集值导数都包含在[0,+∞]之中.于是,本文建立起一元非可微函数的一套令人满意的微分理论.     

A generalized time quantifier approach to approximate reasoning

In this paper, a rather expressive fuzzy temporal logic for linear time is introduced. First, this logic is a multivalued generalization (Lukasiewicz style) of a two-valued linear-time temporal logic based on, e.g., the “until” operator. Second, it is obtained by introducing a generalized time quantifier (a generalization of the partition operator investigated by Shen) applied to fuzzy time sets.In this fuzzy temporal logic, generalized compositional rules of inference, suitable for approximate reasoning in a temporal setting, are presented as valid formulas.Some medical examples illustrate our approach.     

Completeness and interpolation of almost‐everywhere quantification over finitely additive measures

We give an axiomatization of first‐order logic enriched with the almost‐everywhere quantifier over finitely additive measures. Using an adapted version of the consistency property adequate for dealing with this generalized quantifier, we show that such a logic is both strongly complete and enjoys Craig interpolation, relying on a (countable) model existence theorem. We also discuss possible extensions of these results to the almost‐everywhere quantifier over countably additive measures.     

Completeness theorem for topological class models

A topological class logic is an infinitary logic formed by combining a first-order logic with the quantifier symbols O and C. The meaning of a formula closed by quantifier O is that the set defined by the formula is open. Similarly, a formula closed by quantifier C means that the set is closed. The corresponding models are a topological class spaces introduced by Ćirić and Mijajlović (Math Bakanica 1990). The completeness theorem is proved. This research was supported by the Ministry of Science, Technology and Development, Republic of Serbia, through Mathematical Institute, under grant 144013.     

Vectorization hierarchies of some graph quantifiers

We give a sufficient condition for the inexpressibility of the k-th extended vectorization of a generalized quantifier in , the extension of first-order logic by all k-ary quantifiers. The condition is based on a model construction which, given two -equivalent models with certain additional structure, yields a pair of -equivalent models. We also consider some applications of this condition to quantifiers that correspond to graph properties, such as connectivity and planarity. Received: 15 October 1996     

格值命题逻辑系统L_(2n+1)P(X)中基于半正则广义文字的自动推理算法

在格值命题逻辑系统L2n+1P(X)上,提出了半正则的正广义文字和半正则的负广义文字的概念,进一步给出了半正则广义子句和半正则广义子句集的定义,详细地讨论了L2n+1P(X)上以中界元M为归结水平的半正则广义文字之间的M-归结性,最后,给出了L2n+1P(X)上基于半正则广义文字的归结水平为M的归结自动推理算法,并验证了其可靠性和完备性.     

关于GMP和GMT问题的最优解

进一步研究模糊推理的非模糊形式，在几个重要的逻辑系统中形式地讨论GMP(广义取式)和GMT(广义拒取式)问题的最优解。结果表明，GMP和GMT问题的三I解和一种新的三I解都是某种意义下的最优解。还讨论所给算法的还原性问题。     

THE FUNDAMENTAL THEOREM OF ULTRAPRODUCT IN PAVELKA'S LOGIC

In [This Zeitschrift 25 (1979), 45-52, 119-134, 447-464], Pavelka systematically discussed propositional calculi with values in enriched residuated lattices and developed a general framework for approximate reasoning. In the first part of this paper we introduce the concept of generalized quantifiers into Pavelka's logic and establish the fundamental theorem of ultraproduct in first order Pavelka's logic with generalized quantifiers. In the second part of this paper we show that the fundamental theorem of ultraproduct in first order Pavelka's logic is preserved under some direct product of lattices of truth values.     

On vectorizations of unary generalized quantifiers

Vectorization of a class of structures is a natural notion in finite model theory. Roughly speaking, vectorizations allow tuples to be treated similarly to elements of structures. The importance of vectorizations is highlighted by the fact that if the complexity class PTIME corresponds to a logic with reasonable syntax, then it corresponds to a logic generated via vectorizations by a single generalized quantifier (Dawar in J Log Comput 5(2):213–226, 1995). It is somewhat surprising, then, that there have been few systematic studies of the expressive power of vectorizations of various quantifiers. In the present paper, we consider the simplest case: the cardinality quantifiers C _S . We show that, in general, the expressive power of the vectorized quantifier logic ${{\rm FO}(\{{\mathsf C}_S^{(n)}\, | \, n \in \mathbb{Z}_+\})}$ is much greater than the expressive power of the non-vectorized logic FO(C _S ).     

A modal logic framework for reasoning about comparative distances and topology

We propose and investigate a uniform modal logic framework for reasoning about topology and relative distance in metric and more general distance spaces, thus enabling the comparison and combination of logics from distinct research traditions such as Tarski’s S4 for topological closure and interior, conditional logics, and logics of comparative similarity. This framework is obtained by decomposing the underlying modal-like operators into first-order quantifier patterns. We then show that quite a powerful and natural fragment of the resulting first-order logic can be captured by one binary operator comparing distances between sets and one unary operator distinguishing between realised and limit distances (i.e., between minimum and infimum). Due to its greater expressive power, this logic turns out to behave quite differently from both S4 and conditional logics. We provide finite (Hilbert-style) axiomatisations and ExpTime-completeness proofs for the logics of various classes of distance spaces, in particular metric spaces. But we also show that the logic of the real line (and various other important metric spaces) is not recursively enumerable. This result is proved by an encoding of Diophantine equations.