A theory,implementation and applications of human-like understanding

Operation logic is a formal logic with well-defined formulas as semantic language clauses and with modus ponens rules as a method of reasoning. Operation logic can be implemented on any database management system (as the so-called OLS) having a universal general knowledge database and enabling understanding of data stored in the database. Semantic language clauses have necessary and sufficient properties for being able to describe any process in the world. Semantic language is the deepest level of any natural language, the level of data storing, understanding and reasoning. OLS can be a tool for studying implementation possibilities of human-like consciousness, for building artificial experts and artificial encyclopedias and for constructing semantic mathematical theories of anthropoecosystems (which is such an exact theory that qualitative information can be used with meaning completely defined by the user). In the paper the theory (and complete information enabling implementation) is presented for human-like understanding, topic-focus division of clauses, for human-like problem solving (program synthesis and verification) and for semantic mathematical analyses. Many examples are presented.     

Extending possibilistic logic over Gödel logic

In this paper we present several fuzzy logics trying to capture different notions of necessity (in the sense of possibility theory) for Gödel logic formulas. Based on different characterizations of necessity measures on fuzzy sets, a group of logics with Kripke style semantics is built over a restricted language, namely, a two-level language composed of non-modal and modal formulas, the latter, moreover, not allowing for nested applications of the modal operator N. Completeness and some computational complexity results are shown.     

On specifications,subset types and interpretation of proposition in type theory

In this paper we discuss some practical aspects of using type theory as a programming and specification language, where the viewpoint is to use it not only as a basis for program synthesis but also as a programming language with a programming logic allowing us to do ordinary verification.The subset type has been added to type theory in order to avoid irrelevant information in programs. We give an example of a proof which illustrates the problems that may occur if the subset type is used in specifications when we have the standard interpretation of propositions as types. Harrop-formulas and Squash are then discussed as solutions to these problems. It is argued that they are not acceptable from a practical point of view.An extension of the theory to include the two new judgment forms:A is a proposition, andA is true, is then given and explained in terms of the old theory. The logical constants are no longer identified with the corresponding type theoretical constants, but propositions are interpreted as Gödel formulas, which allow us to introduce and justify logical rules similar to rules for classical logic. The interpretation is extended to include predicates defined by using reflections of the ordinary definition of Gödel formulas in a type of small propositions.The programming example is then revisited and stronger elimination rules are discussed.     

计量逻辑学的基本思想和研究综述

介绍计量逻辑学的形成、特点及其与模糊逻辑的异同。关于命题逻辑的计量化理论,针对不同的系统论述了真度理论和相似度理论,特别是介绍了作者提出的命题逻辑系统L*以及与其配套的R0代数理论和完备性定理。介绍了逻辑理论在逻辑度量空间中的发散度和相容的理论以及三种近似推理模式。回顾了谓词逻辑计量化的进程和有待解决的问题。提出了模态逻辑和模型检验的计量化问题以及有待进一步探讨的几个研究课题。     

A simple logic for reasoning about incomplete knowledge

The semantics of modal logics for reasoning about belief or knowledge is often described in terms of accessibility relations, which is too expressive to account for mere epistemic states of an agent. This paper proposes a simple logic whose atoms express epistemic attitudes about formulae expressed in another basic propositional language, and that allows for conjunctions, disjunctions and negations of belief or knowledge statements. It allows an agent to reason about what is known about the beliefs held by another agent. This simple epistemic logic borrows its syntax and axioms from the modal logic KD. It uses only a fragment of the S5 language, which makes it a two-tiered propositional logic rather than as an extension thereof. Its semantics is given in terms of epistemic states understood as subsets of mutually exclusive propositional interpretations. Our approach offers a logical grounding to uncertainty theories like possibility theory and belief functions. In fact, we define the most basic logic for possibility theory as shown by a completeness proof that does not rely on accessibility relations.     

模型论逻辑与理论计算机科学

近年来，逻辑中语义的思想与方法在理论计算机科学的许多分支中的渗透与应用，已愈来愈受重视．作为语义方法的逻辑基础，（一阶）模型论是研究（一阶）逻辑的语法构造与语义属性之间联系的一门数理逻辑的分支；而模型论逻辑（又称广义模型论）则是在抽象逻辑的框架中，用模型论的方法研究各种扩充逻辑系统的异、同及相互关系．本文从抽象逻辑的观点出发．介绍模型论中与计算机科学（ＣＳ）密切相关的若干概念及其应用．特别是广义的有限模型论，它在ＣＳ的刺激下于８０年代形成并急速发展起来，已在数据库、计算复杂性以及形式语言与自动机等理论中取得突出成果或重大的应用．     

Funnel control for fully actuated systems under a fragment of signal temporal logic specifications

Temporal logics have lately proven to be a valuable tool for various control applications by providing a rich specification language. Existing temporal logic-based control strategies discretize the underlying dynamical system in space and/or time. We will not use such an abstraction and consider continuous-time systems under a fragment of signal temporal logic specifications by using the associated robust semantics. In particular, this paper provides computationally-efficient funnel-based feedback control laws for a class of systems that are, in a sense, feedback equivalent to single integrator systems, but where the dynamics are partially unknown for the control design so that some degree of robustness is obtained. We first leverage the transient properties of a funnel-based feedback control strategy to maximize the robust semantics of some atomic temporal logic formulas. We then guarantee the satisfaction for specifications consisting of conjunctions of such atomic temporal logic formulas with overlapping time intervals by a suitable switched control system. The result is a framework that satisfies temporal logic specifications with a user-defined robustness when the specification is satisfiable. When the specification is not satisfiable, a least violating solution can be found. The theoretical findings are demonstrated in simulations of the nonlinear Lotka–Volterra equations for predator–prey models.     

Strategies and simulations in a semantic framework

By means of several examples of structural operational semantics for a variety of languages, we justify the importance and interest of using the notions of strategies and simulations in the semantic framework provided by rewriting logic and implemented in the Maude metalanguage. On the one hand, we describe a basic strategy language for Maude and show its application to CCS, the ambient calculus, and the parallel functional language Eden. On the other hand, we show how the concept of stuttering simulation can be used inside Maude to show that a stack machine correctly implements the operational semantics of a simple functional language.     

标准序列逻辑系统S_3中公式的概率真度理论

利用势为3的非均匀概率空间的无穷乘积在三值标准序列逻辑系统中引入了公式的概率真度概念,证明了全体公式的概率真度值之集在[0,1]中没有孤立点;利用概率真度定义了概率相似度和伪距离,进而建立了概率逻辑度量空间,证明了该空间中没有孤立点,为三值命题的近似推理理论提供了一种可能的框架.     

Infinitary S5-Epistemic Logic

It is known that a theory in S5-epistemic logic with several agents may have numerous models. This is because each such model specifies also what an agent knows about infinite intersections of events, while the expressive power of the logic is limited to finite conjunctions of formulas. We show that this asymmetry between syntax and semantics persists also when infinite conjunctions (up to some given cardinality) are permitted in the language. We develop a strengthened S5-axiomatic system for such infinitary logics, and prove a strong completeness theorem for them. Then we show that in every such logic there is always a theory with more than one model.     

Mining information from time series in the form of sentences of natural language

The goal of this paper is to provide a more detailed explanation of the principles how special formulas that characterize properties of trend of time series can be formed and how they are interpreted. Then we show how these formulas can be used in a tectogrammatical tree that construes special sentences of natural language, using which information on behavior of time series is provided. We also outline the principles of mining this information. The last part is devoted to application of the theory of intermediate quantifiers to mining summarized information on time series also in sentences of natural language.     

中介模态逻辑——形式系统及语义

本文构造中介模态逻辑,给出三个系统MT,MS₄和MS₅,它们分别是经典模态逻辑T,S₄,S₅的扩展.我们取中介集合论作为元语言研究它们的语义问题,并且证明这三个系统的可靠性定理与完备性定理.     

Abstract Logics, Logic Maps, and Logic Homomorphisms

What is a logic? Which properties are preserved by maps between logics? What is the right notion for equivalence of logics? In order to give satisfactory answers we generalize and further develop the topological approach of [4] and present the foundations of a general theory of abstract logics which is based on the abstract concept of a theory. Each abstract logic determines a topology on the set of theories. We develop a theory of logic maps and show in what way they induce (continuous, open) functions on the corresponding topological spaces. We also establish connections to well-known notions such as translations of logics and the satisfaction axiom of institutions [5]. Logic homomorphisms are maps that behave in some sense like continuous functions and preserve more topological structure than logic maps in general. We introduce the notion of a logic isomorphism as a (not necessarily bijective) function on the sets of formulas that induces a homeomorphism between the respective topological spaces and gives rise to an equivalence relation on abstract logics. Therefore, we propose logic isomorphisms as an adequate and precise notion for equivalence of logics. Finally, we compare this concept with another recent proposal presented in [2]. This research was supported by the grant CNPq/FAPESB 350092/2006-0.     

Fuzzy inequational logic

We present a logic for reasoning about graded inequalities which generalizes the ordinary inequational logic used in universal algebra. The logic deals with atomic predicate formulas of the form of inequalities between terms and formalizes their semantic entailment and provability in graded setting which allows to draw partially true conclusions from partially true assumptions. We follow the Pavelka approach and define general degrees of semantic entailment and provability using complete residuated lattices as structures of truth degrees. We prove the logic is Pavelka-style complete. Furthermore, we present a logic for reasoning about graded if–then rules which is obtained as particular case of the general result.     

Categorical abstract algebraic logic categorical algebraization of first-order logic without terms

An algebraization of multi-signature first-order logic without terms is presented. Rather than following the traditional method of choosing a type of algebras and constructing an appropriate variety, as is done in the case of cylindric and polyadic algebras, a new categorical algebraization method is used: The substitutions of formulas of one signature for relation symbols in another are treated in the object language. This enables the automatic generation via an adjunction of an algebraic theory. The algebras of this theory are then used to algebraize first-order logic.Partially supported by National Science Foundation grant CCR - 9593168     

Logic and invariant theory IV. Invariants and syzygies in combinatorial geometry

Previous work has recast the invariant theory of projective geometry in terms of first order logic. This approach is applied to two categories connected with combinatorial projective geometry and coordinatized combinatorial pregeometries to characterize those invariant formulas (capable of expressing geometric properties) in terms of the language of brackets or determinants. The axioms for the theory of coordinatized pregeometries in this language are presented and conclusions drawn about the significance of identities or syzygies in the study of combinatorial geometry.     

基于形式概念的对象粒的属性逻辑公式描述

基于形式概念在属性集上建立逻辑语言系统,证明基于形式概念的基本对象粒描述定理,讨论合取原子属性逻辑公式所描述对象粒的性质,提出一个求解描述对象粒的属性逻辑公式的算法。     

Autonomy,Controllability, and Extension Modules

The so‐called behavioral approach to systems theory, developed by Willems, provides a unified framework for the mathematical treatment of linear systems. In the behavioral context, a linear system is nothing but the solution space of a linear system of (partial) difference or differential equations. For simplicity, the coefficients are supposed to be constant. Oberst proved a duality theorem that builds upon an earlier result of Palamodov. It says that for certain signal spaces of interest, e.g., the smooth functions or the distributions, the solutions spaces of linear systems of partial differential equations, are dual to certain polynomial modules associated to them. Then the solution space and the module contain the same information, and algebraic properties of the module translate to analytic properties of the solution space. Powerful tools from commutative algebra may be used to derive them. As a prominent example, we study two properties that lie at the very heart of systems and control theory: autonomy and controllability. We summarize the characterizations given by several authors, and unify them in the language of extension modules, an algebraic concept which yields a full classification of these systems theoretic notions.     

A semantic hierarchy for intuitionistic logic

Brouwer’s views on the foundations of mathematics have inspired the study of intuitionistic logic, including the study of the intuitionistic propositional calculus and its extensions. The theory of these systems has become an independent branch of logic with connections to lattice theory, topology, modal logic, and other areas. This paper aims to present a modern account of semantics for intuitionistic propositional systems. The guiding idea is that of a hierarchy of semantics, organized by increasing generality: from the least general Kripke semantics on through Beth semantics, topological semantics, Dragalin semantics, and finally to the most general algebraic semantics. While the Kripke, topological, and algebraic semantics have been extensively studied, the Beth and Dragalin semantics have received less attention. We bring Beth and Dragalin semantics to the fore, relating them to the concept of a nucleus from pointfree topology, which provides a unifying perspective on the semantic hierarchy.     

On weakening the Deduction Theorem and strengthening Modus Ponens

This paper studies, with techniques of Abstract Algebraic Logic, the effects of putting a bound on the cardinality of the set of side formulas in the Deduction Theorem, viewed as a Gentzen‐style rule, and of adding additional assumptions inside the formulas present in Modus Ponens, viewed as a Hilbert‐style rule. As a result, a denumerable collection of new Gentzen systems and two new sentential logics have been isolated. These logics are weaker than the positive implicative logic. We have determined their algebraic models and the relationships between them, and have classified them according to several standard criteria of Abstract Algebraic Logic. One of the logics is protoalgebraic but neither equivalential nor weakly algebraizable, a rare situation where very few natural examples were hitherto known. In passing we have found new, alternative presentations of positive implicative logic, both in Hilbert style and in Gentzen style, and have characterized it in terms of the restricted Deduction Theorem: it is the weakest logic satisfying Modus Ponens and the Deduction Theorem restricted to at most 2 side formulas. The algebraic part of the work has lead to the class of quasi‐Hilbert algebras, a quasi‐variety of implicative algebras introduced by Pla and Verdú in 1980, which is larger than the variety of Hilbert algebras. Its algebraic properties reflect those of the corresponding logics and Gentzen systems. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)