Multi-modal knowledge graph inference via media convergence and logic rule

Media convergence works by processing information from different modalities and applying them to different domains.It is difficult for the conventional knowledge graph to utilise multi-media features because the introduction of a large amount of information from other modalities reduces the effectiveness of representation learning and makes knowledge graph inference less effective.To address the issue,an inference method based on Media Convergence and Rule-guided Joint Inference model(MCRJI)has been pro-posed.The authors not only converge multi-media features of entities but also introduce logic rules to improve the accuracy and interpretability of link prediction.First,a multi-headed self-attention approach is used to obtain the attention of different media features of entities during semantic synthesis.Second,logic rules of different lengths are mined from knowledge graph to learn new entity representations.Finally,knowledge graph inference is performed based on representing entities that converge multi-media features.Numerous experimental results show that MCRJI outperforms other advanced baselines in using multi-media features and knowledge graph inference,demonstrating that MCRJI provides an excellent approach for knowledge graph inference with converged multi-media features.

Completeness of bounded model checking temporal logic of knowledge

In order to find the completeness threshold which offers a practical method of making bounded model checking complete, the over-approximation for the complete threshold is presented. First, a linear logic of knowledge is introduced into the past tense operator, and then a new temporal epistemic logic LTLKP is obtained, so that LTLKP can naturally and precisely describe the system＇s reliability. Secondly, a set of prior algorithms are designed to calculate the maximal reachable depth and the length of the longest of loop free paths in the structure based on the graph structure theory. Finally, some theorems are proposed to show how to approximate the complete threshold with the diameter and recurrence diameter. The proposed work resolves the completeness threshold problem so that the completeness of bounded model checking can be guaranteed.

Reasoning about Epistemic Actions and Knowledge in Multi-Agent Systems Using Coq

In this paper, the authors outline a formal system for reasoning about agents＇ knowledge in knowledge games-a special type of multi-agent system. Knowledge games are card games where the agents＇ actions involve an exchange of information with other agents in the game. The authors＇ system is modeled using Coq-a formal proof management system. To the best of the authors＂ knowledge, there are no papers in which knowledge games are considered using a Coq proof assistant. The authors use the dynamic logic of common knowledge, where they particularly focus on the epistemic consequences of epistemic actions carried out by agents. The authors observe the changes in the system that result from such actions. Those changes that can occur in such a system that are of interest to the authors take the form of agents＇ knowledge about the state of the system, knowledge about other agents＇ knowledge, higher-order agents＇ knowledge and so on, up to common knowledge. Besides an axiomatic ofepistemic logic, the authors use a known axiomatization of card games that is extended with some new axioms that are required for the authors＇ approach. Due to a deficit in implementations grounded in theory that enable players to compute their knowledge in any state of the game, the authors show how the authors＇ approach can be used for these purposes.

Applying Logic Programming to Knowledge Discovery on the Internet

LP (Logic Programming) has been successfully applied to knowledge discovery in many fields. The execution of the LP is based on the evaluation of the first order predicate. Usually the information involved in the predicates are local and homogenous, thus the evaluation process is relatively simple. However, the evaluation process become much more complicated when applied to KDD on the Internet where the information involved in the predicates maybe heterogeneous and distributed over many different sits. Therefor, we try to attack the problem in a multi agent system's framework so that the logic program can be written in a site independent style and deal easily with heterogeneous represented information.

Fuzzy Logic Inference System for Managing Intensive Care Unit Resources Based on Knowledge Graph

With the rapid growth in the availability of digital health-related data,there is a great demand for the utilization of intelligent information systems within the healthcare sector.These systems can manage and manipulate this massive amount of health-related data and encourage different decision-making tasks.They can also provide various sustainable health services such as medical error reduction,diagnosis acceleration,and clinical services quality improvement.The intensive care unit(ICU)is one of the most important hospital units.However,there are limited rooms and resources in most hospitals.During times of seasonal diseases and pandemics,ICUs face high admission demand.In line with this increasing number of admissions,determining health risk levels has become an essential and imperative task.It creates a heightened demand for the implementation of an expert decision support system,enabling doctors to accurately and swiftly determine the risk level of patients.Therefore,this study proposes a fuzzy logic inference system built on domain-specific knowledge graphs,as a proof-of-concept,for tackling this healthcare-related issue.The system employs a combination of two sets of fuzzy input parameters to classify health risk levels of new admissions to hospitals.The proposed system implemented utilizes MATLAB Fuzzy Logic Toolbox via several experiments showing the validity of the proposed system.

Ontology-supported and XML-based knowledge description language

Differences in the structure and semantics of knowledge that is created and maintained by the various actors on the World Wide Web make its exchange and utilization a problematic task. This is an important issue facing organizations undertaking knowledge management initiatives. An XML-based and ontology-supported knowledge description language (KDL) is presented, which has three-tier structure (core KDL, extended KDL and complex KDL), and takes advantages of strong point of ontology, XML, description logics, frame-based systems. And then, the framework and XML based syntax of KDL are introduced, and the methods of translating KDL into first order logic (FOL) are presented. At last, the implementation of KDL on the Web is described, and the reasoning ability of KDL proved by experiment is illustrated in detail.

Belief and Knowledge Reasoning

Alternating-time Temporal Epistemic Logic (ATEL) which is an important kind of multi-agent cooperation logics only takes knowledge into account,but does not deal with belief of agents. By introducing three kinds of belief operators into ATEL,a new multi-agent cooperation logic named ATBKL (Alternating-time Temporal Belief and Knowledge Logic) was developed. A model checking algorithm was proposed. It is proved that the model checking complexity of ATBKL is the same as that of ATEL,i.e.,the presented logic is better for further study of multi-agent systems.

Knowledge Representation for the Geometrical Shapes

This paper outlines the necessity of the knowledge representation for the geometrical shapes （KRGS）. We advocate that KRGS for being powerful must contain at least three major components, namely （1） fuzzy logic scheme; （2） the machine learning technique; and （3） an integrated algebraic and logical reasoning. After arguing the need for using fuzzy expressions in spatial reasoning, then inducing the spatial graph generalized and maximal common part of the expressions is discussed. Finally, the integration of approximate references into spatial reasoning using absolute measurements is outlined. The integration here means that the satisfiability of a fuzzy spatial expression is conducted by both logical and algebraic reasoning.

Paradigms and Methodologies for Knowledge Building

A diversity of methodologies can be utilized for knowledge building in social sciences, particularly in education. Nevertheless, in order to give meaning to the research findings and progressively create theories, an awareness of the epistemological framework appears to be necessary. The aim of this article is to present the main epistemological paradigms and their coherent correspondence with respective ontologies and corresponding methodologies. This article supports and describes four paradigms or epistemological traditions: logic empiricism, constructivism, conceptualism or Aristotelian tradition, and phenomenology. Understanding the diverse possible epistemologies as well as the coherence with methodologies is a necessary step for presenting well-informed research. Knowledge building requires comparison, replication, generalization or integration of results in theories, and all these processes need the critical instance of the epistemological and methodological coherence. Additionally some concrete examples of methodologies have been detailed to illustrate the diversity of available ways of knowledge building in education. The Review of Educational Theory, as a new journal that aims to create a scientific community, will increase the research quality by enhancing the epistemological and methodological awareness of their pieces of research.

Computation Tree Logic Model Checking of Multi-Agent Systems Based on Fuzzy Epistemic Interpreted Systems

Model checking is an automated formal verification method to verify whether epistemic multi-agent systems adhere to property specifications.Although there is an extensive literature on qualitative properties such as safety and liveness,there is still a lack of quantitative and uncertain property verifications for these systems.In uncertain environments,agents must make judicious decisions based on subjective epistemic.To verify epistemic and measurable properties in multi-agent systems,this paper extends fuzzy computation tree logic by introducing epistemic modalities and proposing a new Fuzzy Computation Tree Logic of Knowledge(FCTLK).We represent fuzzy multi-agent systems as distributed knowledge bases with fuzzy epistemic interpreted systems.In addition,we provide a transformation algorithm from fuzzy epistemic interpreted systems to fuzzy Kripke structures,as well as transformation rules from FCTLK formulas to Fuzzy Computation Tree Logic(FCTL)formulas.Accordingly,we transform the FCTLK model checking problem into the FCTL model checking.This enables the verification of FCTLK formulas by using the fuzzy model checking algorithm of FCTL without additional computational overheads.Finally,we present correctness proofs and complexity analyses of the proposed algorithms.Additionally,we further illustrate the practical application of our approach through an example of a train control system.

A complete coalition logic of temporal knowledge for multi-agent systems

Coalition logic （CL） is one of the most influential logical formalisms for strategic abilities of multi-agent systems. CL can specify what a group of agents can achieve through choices of their actions, denoted by [C]φ to state that a group of agents C can have a strategy to bring about φ by collective actions, no matter what the other agents do. However, CL lacks the temporal dimension and thus can not capture the dynamic aspects of a system. Therefore, CL can not formalize the evolvement of rational mental attitudes of the agents such as knowledge, which has been shown to be very useful in specifications and verifications of distributed systems, and has received substantial amount of studies. In this paper, we introduce coalition logic of temporal knowledge （CLTK）, by incorporating a temporal logic of knowledge （Halpern and Vardi＇s logic of CKLn） into CL to equip CL with the power to formalize how agents＇ knowledge （individual or group knowledge） evolves over the time by coalitional forces and the temporal properties of strategic abilities as well. Furthermore, we provide an axiomatic system for CLTK and prove that it is sound and complete, along with the complexity of the satisfiability problem which is shown to be EXPTIME-complete.

Logical Object as a Basis of Knowledge Based Systems

This paper presents a framework called logical knowledge object (LKO),which is taken as a basis of the dependable development of knowledge based systems(KBSs). LKO combines logic programming and object-oriented programming paradigms, where objects are viewed as abstractions with states,constraints, behaviors and inheritance. The operational semantics defined in the style of natural semantics is simple and clear. A hybrid knowledge represen-tation amalgamating rule, frame, semantic network and blackboard is available for both most structured and flat knowledge. The management of knowledge bases has been formally specified. Accordingly, LKO is well suited for the formal representation of knowledge and requirements of KBSs. Based on the framework, verification techniques are also explored to enhance the analysis of requirement specifications and the validation of KBSs. In addition, LKO pro-vides a methodology for the development of KBSs, applying the concepts of rapid prototyping and top-down design to deal with changing and incomplete requirements, and to provide multiple abstract models of the domain, where formal methods might be used at each abstract level.

Socrates’ Avowals of Knowledge and the Epistemic Asymmetry of Values

Socrates,taken as the figure in Plato’s so-called early dialogues,famously professes to be ignorant,but the nature and the scope of his ignorance have long been intensely debated and still remain obscure.In this paper,I try to contribute to the relevant discussions by pointing out and interpreting a generally overlooked,yet essential feature of Socrates’avowals of knowledge:in most cases,what Socrates claims to know falls under the category of(what I call)negative,as opposed to positive,ethical knowledge.The distinction between positive ethical knowledge and negative ethical knowledge is as follows:the former involves either definitions of what the good and virtues are,or knowledge that certain particular facts are good and virtuous;the latter refers to the knowledge of what the good and virtues are not,or the knowledge that certain particular facts are bad and evil.It will be argued that Socrates only avows negative ethical knowledge because he recognizes an asymmetry between the knowledge of the good and that of the bad:one may know a fact about the bad without knowing the corresponding fact about the good,but not vice versa.This epistemic asymmetry shows that knowledge of the good is more epistemically demanding than that of the bad,and thus it sheds further light on the scope of Socrates’ignorance and his view of the good and virtue.

A retrospective of knowledge graphs

Information on the Internet is fragmented and presented in different data sources, which makes automatic knowledge harvesting and understanding formidable for ma- chines, and even for humans. Knowledge graphs have be- come prevalent in both of industry and academic circles these years, to be one of the most efficient and effective knowledge integration approaches. Techniques for knowledge graph construction can mine information from either structured, semi-structured, or even unstructured data sources, and fi- nally integrate the information into knowledge, represented in a graph. Furthermore, knowledge graph is able to organize information in an easy-to-maintain, easy-to-understand and easy-to-use manner. In this paper, we give a summarization of techniques for constructing knowledge graphs. We review the existing knowledge graph systems developed by both academia and industry. We discuss in detail about the process of building knowledge graphs, and survey state-of-the-art techniques for automatic knowledge graph checking and expansion via log- ical inferring and reasoning. We also review the issues of graph data management by introducing the knowledge data models and graph databases, especially from a NoSQL point of view. Finally, we overview current knowledge graph sys- tems and discuss the future research directions.

A programmable approach to revising knowledge bases

This paper presents a programmable approach to revising knowledge bases consisting of clauses. Some theorems and lemmas are shown in order to give procedures for generating maximally consistent subsets. Then a complete procedure and an incomplete procedure for generating the maximal consistent subsets are presented, and the correctness of the procedures is also shown. Furthermore, a way to implement knowledge base revision is presented, and a prototype system is introduced. Compared with related works, the main characteristic of our approach is that the approach can be implemented by a computer program.

THE IMPORTANCE OF MULTIMEDIA PRINCIPLE AND EMERGENCE PRINCIPLE FOR THE KNOWLEDGE CIVILISATION AGE

The paper discusses two basic principles derived from results of studies concerning foundations of micro-theories of knowledge creation; these are Multimedia Principle and Emergence Principle. Their epistemic, systemic and metaphysical importance is discussed, together with their relations to the episteme of technology treated as a separate cultural sphere. A spiral of evolutionary knowledge creation is presented, in which an extended Falsification Principle plays the role of an objectifying feedback; this spiral is related to an episteme of Evolutionary Constructive Objectivism proposed earlier for the coming knowledge civilisation age.

KeEL: knowledge enhanced entity linking in automatic biography construction

Biography is a direct and extensive way to know the representation of well known peoples, however, for common people, there is poor knowledge for them to be recognized. In recent years, information extraction （IE） technologies have been used to automatically generate biography for any people with online information. One of the key challenges is the entity linking （EL） which can link biography sentence to corresponding entities. Currently the used general EL systems usually generate errors originated from entity name variation and ambiguity. Compared with general text, biography sentences possess unique yet rarely studied relational knowledge （RK） and temporal knowledge （TK）, which could sufficiently distinguish entities. This article proposed a new statistical framework called the knowledge enhanced EL （KeEL） system for automated biography construction. It utilizes commonsense knowledge like PK and TK to enhance Entity Linking. The performance of KeEL on Wikipedia data was evaluated. It is shown that, compared with state-of-the-art method, KeEL significantly improves the precision and recall of Entity Linking.

Knowledge structure approach to verification of authentication protocols

The standard Kripke semantics of epistemic logics has been applied successfully to reasoning communication protocols under the assumption that the network is not hostile. This paper introduces a natural semantics of Kripke semantics called knowledge structure and, by this kind of Kripke semantics, analyzes communication protocols over hostile networks, especially on authentication protocols. Compared with BAN-like logics, the method is automatically implementable because it operates on the actual definitions of the protocols, not on some difficult-to-establish justifications of them. What is more, the corresponding tool called SPV (Security Protocol Verifier) has been developed. Another salient point of this approach is that it is justification-oriented instead of falsification-oriented, i.e. finding bugs in protocols.

CO-LOGIC:一种支持约束演绎OODB语言的多类型逻辑

近年来,针对传统数据库技术在一些新的应用领域(如CAD,CAE,cAsE等)所暴露的缺陷,提出和发展了面向对象方法,以适应这些新的要求。与此同时,演绎数据库也获得一些进展,但大都是在关系数据库提供的工具上进行逻辑程序设计的扩展,且缺乏对复杂对象进行推理的能力。因此,将演绎和面向对象方法结合起来是当前数据库研究的新方向。已提出一些系统:如ORION系统,POSTGRES系统,基于逻辑数据库语言LDL等,但其中一些只注意用规则说明和规则调用来扩展面向对象数据库界面。

R-Calculus for ELP:An Operational Approach to Knowledge Base Maintenance

Some concepts used in knowledge base maintenance, such as sequence, new law, user's rejection and reconstructions of a knowledge base, are first introduced, and then a framework for extended logic programming (ELP) is given,where an extended logic program is equivalent to a knowledge base. A transition system called R-calculus for ELP is provided. For a given knowledge base and a user's rejection, the Rcalculus for ELP will deduce best revisions of the base. The soundness and the completeness of the Rcalculus for ELP are proved, and the Rcalculus for ELP is implemented in Prolog. In addition, the research is compared with other relevan work.