首页> 外文OA文献 >On modal expansions of t-norm based logics with rational constants
【2h】

On modal expansions of t-norm based logics with rational constants

机译:基于有理常数的基于t范数的逻辑的模态展开

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

[eng] According to Zadeh, the term “fuzzy logic” has two different meanings: wide and narrow. In a narrow sense it is a logical system which aims a formalization of approximate reasoning, and so it can be considered an extension of many-valued logic. However, Zadeh also says that the agenda of fuzzy logic is quite different from that of traditional many-valued logic, as it addresses concepts like linguistic variable, fuzzy if-then rule, linguistic quantifiers etc. Hájek, in the preface of his foundational book Metamathematics of Fuzzy Logic, agrees with Zadeh’s distinction, but stressing that formal calculi of many-valued logics are the kernel of the so-called Basic Fuzzy logic (BL), having continuous triangular norms (t-norm) and their residua as semantics for the conjunction and implication respectively, and of its most prominent extensions, namely Lukasiewicz, Gödel and Product fuzzy logics. Taking advantage of the fact that a t-norm has residuum if, and only if, it is left-continuous, the logic of the left-continuous t-norms, called MTL, was soon after introduced. On the other hand, classical modal logic is an active field of mathematical logic, originally introduced at the beginning of the XXth century for philosophical purposes, that more recently has shown to be very successful in many other areas, specially in computer science. That are the most well-known semantics for classical modal logics. Modal expansions of non-classical logics, in particular of many-valued logics, have also been studied in the literature. In this thesis we focus on the study of some modal logics over MTL, using natural generalizations of the classical Kripke relational structures where propositions at possible words can be many-valued, but keeping classical accessibility relations. In more detail, the main goal of this thesis has been to study modal expansions of the logic of a left-continuous t-norm, defined over the language of MTL expanded with rational truth-constants and the Monteiro-Baaz Delta-operator, whose intended (standard) semantics is given by Kripke models with crisp accessibility relations and taking the unit real interval [0, 1] as set of truth-values. To get complete axiomatizations, already known techniques based on the canonical model construction are uses, but this requires to ensure that the underlying (propositional) fuzzy logic is strongly standard complete. This constraint leads us to consider axiomatic systems with infinitary inference rules, already at the propositional level. A second goal of the thesis has been to also develop and automated reasoning software tool to solve satisfiability and logical consequence problems for some of the fuzzy logic modal logics considered. This dissertation is structured in four parts. After a gentle introduction, Part I contains the needed preliminaries for the thesis be as self-contained as possible. Most of the theoretical results are developed in Parts II and III. Part II focuses on solving some problems concerning the strong standard completeness of underlying non-modal expansions. We first present and axiomatic system for the non-nodal propositional logic of a left-continuous t-norm who makes use of a unique infinitary inference rule, the “density rule”, that solves several problems pointed out in the literature. We further expand this axiomatic system in order to also characterize arbitrary operations over [0, 1] satisfying certain regularity conditions. However, since this axiomatic system turn out to be not well-behaved for the modal expansion, we search for alternative axiomatizations with some particular kind of inference rules (that will be called conjunctive). Unfortunately, this kind of axiomatization does not necessarily exist for all left-continuous t-norms (in particular, it does not exist for the Gödel logic case), but we identify a wide class of t-norms for which it works. This “well-behaved” t-norms include all ordinal sums of Lukasiewiczand Product t-norms. Part III focuses on the modal expansion of the logics presented before. We propose axiomatic systems (which are, as expected, modal expansions of the ones given in the previous part) respectively strongly complete with respect to local and global Kripke semantics defined over frames with crisp accessibility relations and worlds evaluated over a “well-behaved” left-continuous t-norm. We also study some properties and extensions of these logics and also show how to use it for axiomatizing the possibilistic logic over the very same t-norm. Later on, we characterize the algebraic companion of these modal logics, provide some algebraic completeness results and study the relation between their Kripke and algebraic semantics. Finally, Part IV of the thesis is devoted to a software application, mNiB-LoS, who uses Satisfability Modulo Theories in order to build an automated reasoning system to reason over modal logics evaluated over BL algebras. The acronym of this applications stands for a modal Nice BL-logics Solver. The use of BL logics along this part is motivated by the fact that continuous t-norms can be represented as ordinal sums of three particular t-norms: Gödel, Lukasiewicz and Product ones. It is then possible to show that these t-norms have alternative characterizations that, although equivalent from the point of view of the logic, have strong differences for what concerns the design, implementation and efficiency of the application. For practical reasons, the modal structures included in the solver are limited to the finite ones (with no bound on the cardinality).
机译:[eng]根据Zadeh的说法,“模糊逻辑”一词具有两种不同的含义:宽和窄。从狭义上讲,它是旨在近似推理形式化的逻辑系统,因此可以认为它是多值逻辑的扩展。但是,扎德(Zadeh)也说,模糊逻辑的议程与传统的多值逻辑议程完全不同,因为它处理了诸如语言变量,模糊if-then规则,语言量词等概念。哈耶克(Hájek)在其基础书的序言中模糊逻辑的元数学与扎德(Zadeh)的观点是一致的,但他强调,多值逻辑的形式计算是所谓的基本模糊逻辑(BL)的核心,具有连续的三角范式(t-norm)及其残差作为语义分别是合取和蕴涵,以及其最突出的扩展,即Lukasiewicz,Gödel和乘积模糊逻辑。利用t范数在且仅当它是左连续的时才具有残差的事实,不久之后引入了称为MTL的左连续t范数的逻辑。另一方面,古典模态逻辑是数学逻辑的活跃领域,最初是在20世纪初出于哲学目的而引入的,最近在许多其他领域,特别是在计算机科学领域,已经证明是非常成功的。这是经典模态逻辑最著名的语义。非古典逻辑,尤其是多值逻辑的模态展开,也在文献中进行了研究。在本文中,我们将重点研究MTL上的一些模态逻辑,使用经典Kripke关系结构的自然概括,其中可能单词的命题可以是多值的,但要保持经典的可及性关系。更详细地讲,本论文的主要目标是研究左连续t范式的逻辑的模态展开,该模态展开是在用有理真常数和Monteiro-Baaz Delta运算符展开的MTL语言上定义的预期的(标准)语义由具有清晰可访问性关系的Kripke模型给出,并将单位实际间隔[0,1]作为一组真值。为了获得完整的公理化,使用了基于规范模型构造的已知技术,但这需要确保基本的(命题)模糊逻辑是完全标准的。这种限制导致我们考虑在命题级别上具有不定式推理规则的公理系统。论文的第二个目标是开发和自动化推理软件工具,以解决所考虑的某些模糊逻辑模态逻辑的可满足性和逻辑后果问题。本文分为四个部分。在进行了简要介绍之后,第一部分包含了必要的预备知识,以使论文尽可能独立。大多数理论结果是在第二部分和第三部分中提出的。第二部分着重解决一些有关基础非模式扩展的强标准完整性的问题。我们首先提出一种左连续t范式的非节点命题逻辑的公理系统,该系统使用独特的无限式推理规则“密度规则”,解决了文献中指出的几个问题。我们还扩展了这个公理系统,以便还表征满足某些规则性条件的[0,1]上的任意操作。但是,由于这种公理系统对于模式扩展而言表现不佳,因此我们使用某些特定类型的推理规则(称为合取词)来寻找其他公理化。不幸的是,这种公理化不一定适用于所有左连续的t范数(特别是对于Gödel逻辑情况并不存在),但是我们确定了适用于它的一类广泛的t范数。该“行为良好”的t范数包括Lukasiewiczand产品t范数的所有序数和。第三部分重点介绍了前面介绍的逻辑的模态扩展。我们提出公理系统(正如预期的那样,是前一部分中的模态扩展),分别针对在具有清晰可及性关系的框架上定义的局部和全局Kripke语义以及在“行为良好”的情况下评估的世界,分别有很强的完整性左连续t范数。我们还研究了这些逻辑的一些性质和扩展,并展示了如何使用它在完全相同的t范数上对可能逻辑进行公理化。稍后,我们将表征这些模态逻辑的代数伴侣,提供一些代数完整性结果,并研究其Kripke与代数语义之间的关系。最后,论文的第四部分致力于软件应用mNiB-LoS,他使用可满足性模理论来构建自动推理系统,以对在BL代数上评估的模态逻辑进行推理。此应用程序的首字母缩写表示模态Nice BL逻辑求解器。连续t范数可以表示为三个特定t范数的序数和:Gödel,Lukasiewicz和Product范本,因此沿这部分使用BL逻辑。这样就可以证明这些t范数具有替代特征,尽管从逻辑的角度来看,这些特征是等效的,但在涉及应用程序的设计,实现和效率方面却存在很大差异。出于实际原因,求解器中包含的模态结构仅限于有限的模态结构(对基数没有限制)。

著录项

  • 作者

    Vidal Wandelmer Amanda;

  • 作者单位
  • 年度 2015
  • 总页数
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号