DEBRA: On the Unsupervised Learning of Concept Hierarchies from (Literary) Text

With this work, we introduce a novel method for the unsupervised learning of conceptual hierarchies, or concept maps as they are sometimes called, which is aimed specifically for use with literary texts, as such distinguishing itself from the majority of research literature on the topic which is primarily focused on building ontologies from a vast array of different types of data sources, both structured and unstructured, to support various forms of AI, in particular, the Semantic Web as envisioned by Tim Berners-Lee. We first elaborate on mutually informing disciplines of philosophy and computer science, or more specifically the relationship between metaphysics, epistemology, ontology, computing and AI, followed by a technically in-depth discussion of DEBRA, our dependency tree based concept hierarchy constructor, which as its name alludes to, constructs a conceptual map in the form of a directed graph which illustrates the concepts, their respective relations, and the implied ontological structure of the concepts as encoded in the text, decoded with standard Python NLP libraries such as spaCy and NLTK. With this work we hope to both augment the Knowledge Representation literature with opportunities for intellectual advancement in AI with more intuitive, less analytical, and well-known forms of knowledge representation from the cognitive science community, as well as open up new areas of research between Computer Science and the Humanities with respect to the application of the latest in NLP tools and techniques upon literature of cultural significance, shedding light on existing methods of computation with respect to documents in semantic space that effectively allows for, at the very least, the comparison and evolution of texts through time, using vector space math.

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.

An Approach for Handling Conflicts in Authorization

Based on logic programs, authorization conflicts and resolution strategies are analyzed through the explanation of some examples on the health care sector. A resolution scheme for handling conflicts in high level authorization specification by using logic program with ordered disjunction （LPOD） is proposed. The scheme is useful for solving conflicts resulted from combining positive and negative authorization, complexity of authorization management, and less clarity of the specification. It can well specify kinds of conflicts （such as exceptional conflicts, potential conflicts）, and is based on literals and dependent contexts. Thus it is expressive and available. It is shown that authorizations based on rules LPOD is very important both in theory and practice.

REACHABILITY/CONTROLLABILITY OF HIGH ORDER MIX-VALUED LOGICAL NETWORKS

This paper addresses the teachability/controllability of high order mix-valued logical control networks by using the semi-tensor product method, and presents some necessary and sufficient conditions for the reachability/controllability. The high order mix-valued logical network is converted into an algebraic form first, baaed on which the reachability/controllability of the system is then investigated, and several necessary and sufficient conditions are established. The study of several illustrative examples shows that our new method is very effective in dealing with the reachability/controllability of high order mix-valued logical control networks.

The Expressibility of First Order Dynamic Logic

This paper resolved an open problem proposed by A .P. Stolboushkin and M .A. Taitslin. We studied the expressibility of first order dynamic logic, and constructed infinite recursive program classes K_1 , K_2, …, RG K_1 K_2 … RF, such that L (RG)<L (K_1)<L (K_2) < … < L (RF), where RG, RF are regular program class and finitely generated recursively enumerable program class respectively, and L (K) is the first order dynamic logic of program class K.

On decidability and model checking for a first order modal logic for value-passing processes

A semantic interpretation of a first order extension of Hennessy-Milner logic for value-passing processes, named HML(FO), is presented. The semantics is based on symbolic transition graphs with assignment. It is shown that the satisfiability of the two-variable sub-logic HML(FO2) of HML(FO) is decidable, and the complexity discussed. Finally, a decision procedure for model checking the value-passing processes with respect to HML(FO2) is obtained.