The main aim of this dissertation has been to mimic natural language processing capabilities of human beings in a natural language processing system. The design and the development of the Syntax-Semantics analyzer (SS-analyzer) and the use of fuzzy in various language processing stages form the main crux of this dissertation. / The SS-analyzer is made up of two main modules: the syntax module and the semantics module. The SS-analyzer processes the input natural language sentences in an incremental fashion. The syntax and the semantics analyzer work in a coordinated manner to extract the meaning out of the input natural language sentences. This extracted meaning is then represented in a fuzzy relational representation structure. / The semantic interpreter complements the SS-analyzer in determining the meaning of input sentences when they are grammatically incorrect or do not make sense semantically. If the SS-analyzer is unable to determine the meaning of the input sentences, the semantic interpreter uses the contextual knowledge to determine the meaning. A prototype natural language processing system has been developed to test these theories. / Source: Dissertation Abstracts International, Volume: 53-09, Section: B, page: 4783. / Major Professor: L. J. Kohout. / Thesis (Ph.D.)--The Florida State University, 1992.

The successful application of fuzzy reasoning models to fuzzy control systems depends on a number of parameters, such as fuzzy membership functions, fuzzy implication operators, and the fuzzy relation matrix, that are usually decided upon subjectively by an expert operator. The purpose of this dissertation is to develop an intelligent fuzzy control system that combines fuzzy controller and learning mechanism in a hybrid system. Such hybrid system, which allows for imprecise information and/or uncertain environments, is imperative to the process of developing effective robust control systems for a large number of important real-time industrial processes. It is shown in this dissertation that the performance of fuzzy control systems can be improved considerably if the fuzzy reasoning model is supplemented by learning mechanisms. Two learning mechanisms are proposed in this research: one that uses genetic algorithms and the other is based on the utilization of neural networks. The genetic algorithm enables us to generate an optimal set of parameters for the fuzzy reasoning model based on their initial subjective selection. The exploitation of this initial selection, i.e., knowledge of the domain, by the genetic algorithm leads to an improved performance of the fuzzy controller. The neural-fuzzy reasoning model combines the computational paradigms of neural network and fuzzy rule-based reasoning in a hybrid system that also leads to an improved performance of the fuzzy control system. / Source: Dissertation Abstracts International, Volume: 53-07, Section: B, page: 3605. / Major Professor: Abraham Kandel. / Thesis (Ph.D.)--The Florida State University, 1992.

Neural network based word embeddings have demonstrated outstanding results in a variety of tasks, and become a standard input for Natural Language Processing (NLP) related deep learning methods. Despite these representations are able to capture semantic regularities in languages, some general questions, e.g., "what kinds of semantic relations do the embeddings represent?" and "how could the semantic relations be retrieved from an embedding?" are not clear and very little relevant work has been done. In this study, we propose a new approach to exploring the semantic relations represented in neural embeddings based on WordNet and Unified Medical Language System (UMLS). Our study demonstrates that neural embeddings do prefer some semantic relations and that the neural embeddings also represent diverse semantic relations. Our study also finds that the Named Entity Recognition (NER)-based phrase composition outperforms Word2phrase and the word variants do not affect the performance on analogy and semantic relation tasks. / A Thesis submitted to the Department of Computer Science in partial fulfillment of the requirements for the degree of Master of Science. / Summer Semester 2017. / July 17, 2017. / semantic relation, word2vec, word embedding, WordNet / Includes bibliographical references. / Xiuwen Liu, Professor Directing Thesis; Zhe He, Committee Member; Peixiang Zhao, Committee Member.

Modularity in the design and implementation of expert systems relies upon cooperation among the expert systems and communication of knowledge between them. A prerequisite for an effective modular approach is some standard for knowledge representation to be used by the developers of the different modules. In this work we present a schema for knowledge representation, and apply this schema in the design of a rule-based expert system. We also implement a cooperative expert system using the proposed knowledge representation method. / A knowledge representation schema is a formal specification of the internal, conceptual, and external components of a knowledge base, each specified in a separate schema. The internal schema defines the structure of a knowledge base, the conceptual schema defines the concepts, and the external schema formalizes the pragmatics of a knowledge base. The schema is the basis for standardizing knowledge representation systems and it is used in the various phases of design and specification of the knowledge base. Its main tasks are to govern the interface and communication of knowledge between expert systems as well as to support a modular approach in the design of a cooperative expert system. The schema is also used in the stages of testing, validation, and maintenance of a knowledge base. / The conceptual schema is the formal specifications of the domain-dependent semantics and can be implemented using fuzzy semantics. For this purpose, an axiomatic theory of fuzzy semantics is developed and formal methods of specification of concepts using fuzzy semantics are proposed. / A new model of knowledge representation based on a pattern recognition interpretation of implications is developed. This model implements the concept of linguistic variables and can, therefore, emulate human reasoning with linguistic imprecision. / The test case for the proposed schema of knowledge representation is a system for computer-aided design of a man-machine interface. The core of the system is a cooperative expert system composed of two expert systems. This system applies a pattern recognition interpretation of a generalized one-variable implication with linguistic variables. / A process of validation of the system is performed, including testing of the system and verification that the system is acyclic, consistent, and in compliance with its specifications. / Source: Dissertation Abstracts International, Volume: 50-08, Section: B, page: 3580. / Major Professor: Abraham Kandel. / Thesis (Ph.D.)--The Florida State University, 1989.

The process of redistricting involves the division of a land surface into two or more pieces. In a political setting, the districts thus formed provide groups of voters that elect the same public officials. Other types of redistricting applications include the formation of school districts, transportation districts, or water management districts. / In this work we propose a knowledge-based expert system prototype as a solution to the redistricting problem. A number of key issues are addressed by the solution, including equality of population, contiguity, and graphical display of possible districts. In addition, we explore the need for dynamic user interaction within knowledge-based systems and outline a method (the Grouper approach) for dramatically reducing the complexity of the redistricting problem by restricting activity to a specific level of detail. / The prototype solution, a PC-based system implemented using Tecknowledge's M.1 expert system shell, is described in depth with particular emphasis on techniques for minimizing search. An annotated Grouper session is included, as are listings of the knowledge base and supporting C functions. Lastly, there is a discussion of the far-reaching significance of the redistricting problem and promising uses or extensions of the Grouper system in this regard. / Source: Dissertation Abstracts International, Volume: 51-12, Section: B, page: 5975. / Major Professor: Abe Kandel. / Thesis (Ph.D.)--The Florida State University, 1990.

A theory of mind or intelligence that derives from elements of philosophical, biological, linguistic, and psychological thought as well as of physics and information theory is presented. The hypothesis is defended that intelligence is not a thing but a composite of activities and attributes that must be described in terms of the evolution and interactions of systems, emerging into the environments in which they are embedded. It is proposed that a machine intelligence that emulates human intelligence must conform to certain restrictions that derive from accepting this hypothesis. In particular an implication is that for machine intelligence to be accepted as human-like intelligence it must be produced by a machine that functions in a manner substantially similar to a man and that interacts, grows or learns in and with an environment similar to that in which a man grows and learns. It is proposed that it should be possible to create machines and programs capable of this and that they can achieve intelligence with a large, but not arbitrarily large, degree of human-like characteristics. One system (of many possible systems), in development, based on grammars, and that satisfies some of those requirements is described. It consists of an artificial environment in which a grammar like program based on augmented transition networks, interacts with a human teacher. The purpose of KARA is to learn about the environment by being told and by imitation. / Source: Dissertation Abstracts International, Volume: 50-12, Section: B, page: 5732. / Major Professor: Lois Hawkes. / Thesis (Ph.D.)--The Florida State University, 1989.

A general method is described for translating an expert system into a functionally equivalent neural network. The neural network may be retranslated back into a functionally equivalent expert system. An example of the translation methodology is applied to the expert system shell M.1. The primary motivation for the development of the translation process is to aid in knowledge acquisition, however, there may be other applications such as the migration of a finished expert system to a neural network chip. The expert system and neural network knowledge base may be modified by either traditional knowledge engineering methods, associative learning techniques, or a synthesis of the two methods. Two learning algorithms are described that are appropriate for learning in the hybrid system--a modified backpropagation method and Goal-Directed Monte Carlo learning. These methods are used to demonstrate the repair of damaged certainty factors in several small rule bases. / Source: Dissertation Abstracts International, Volume: 52-03, Section: B, page: 1547. / Major Professor: R. C. Lacher. / Thesis (Ph.D.)--The Florida State University, 1991.

Verification and validation are essential to providing quality assurance for expert systems. The same level of quality assurance is expected of expert systems as has been demanded in conventional software. Verification and validation provide a systematic, comprehensive approach to quality assurance for conventional software. Such quality assurance is lacking in the development of expert systems. Current practice in verification and validation consists of the informal, haphazard testing of a few test cases. A lesson from the software crisis of conventional software is that quality can not be measured by such testing. Therefore, a systematic, comprehensive approach to verification and validation is necessary if quality assurance is to be provided for expert systems. / A methodology for the verification and validation of rule-based expert systems is developed in this research. The research objectives are to define verification and validation for expert systems, to delineate the activities required for thorough verification and validation of rule-based expert systems, and to develop a comprehensive set of techniques and tools for validation of rule-based expert systems. To this end, the contributions of this research are the recommendations for a systematic, comprehensive approach to the verification and validation of rule-based expert systems and the development of a complete set of techniques and tools for effective validation of rule-based expert systems. / Source: Dissertation Abstracts International, Volume: 52-03, Section: B, page: 1557. / Major Professor: Abraham Kandel. / Thesis (Ph.D.)--The Florida State University, 1991.

Siu Fai Keung. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2006. / Includes bibliographical references (leaves 79-83). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- (Weighted) Constraint Satisfaction --- p.1 / Chapter 1.2 --- Set Variables --- p.2 / Chapter 1.3 --- Motivations and Goals --- p.3 / Chapter 1.4 --- Overview of the Thesis --- p.4 / Chapter 2 --- Background --- p.6 / Chapter 2.1 --- Constraint Satisfaction Problems --- p.6 / Chapter 2.1.1 --- Backtracking Tree Search --- p.8 / Chapter 2.1.2 --- Consistency Notions --- p.10 / Chapter 2.2 --- Weighted Constraint Satisfaction Problems --- p.14 / Chapter 2.2.1 --- Branch and Bound Search --- p.17 / Chapter 2.2.2 --- Consistency Notions --- p.19 / Chapter 2.3 --- Classical CSPs with Set Variables --- p.23 / Chapter 2.3.1 --- Set Variables and Set Domains --- p.24 / Chapter 2.3.2 --- Set Constraints --- p.24 / Chapter 2.3.3 --- Searching with Set Variables --- p.26 / Chapter 2.3.4 --- Set Bounds Consistency --- p.27 / Chapter 3 --- Weighted Constraint Satisfaction with Set Variables --- p.30 / Chapter 3.1 --- Set Variables --- p.30 / Chapter 3.2 --- Set Domains --- p.31 / Chapter 3.3 --- Set Constraints --- p.31 / Chapter 3.3.1 --- Zero-arity Constraint --- p.33 / Chapter 3.3.2 --- Unary Constraints --- p.33 / Chapter 3.3.3 --- Binary Constraints --- p.36 / Chapter 3.3.4 --- Ternary Constraints --- p.36 / Chapter 3.3.5 --- Cardinality Constraints --- p.37 / Chapter 3.4 --- Characteristics --- p.37 / Chapter 3.4.1 --- Space Complexity --- p.37 / Chapter 3.4.2 --- Generalization --- p.38 / Chapter 4 --- Consistency Notions and Algorithms for Set Variables --- p.41 / Chapter 4.1 --- Consistency Notions --- p.41 / Chapter 4.1.1 --- Element Node Consistency --- p.41 / Chapter 4.1.2 --- Element Arc Consistency --- p.43 / Chapter 4.1.3 --- Element Hyper-arc Consistency --- p.43 / Chapter 4.1.4 --- Weighted Cardinality Consistency --- p.45 / Chapter 4.1.5 --- Weighted Set Bounds Consistency --- p.46 / Chapter 4.2 --- Consistency Enforcing Algorithms --- p.47 / Chapter 4.2.1 --- "Enforcing Element, Node Consistency" --- p.48 / Chapter 4.2.2 --- Enforcing Element Arc Consistency --- p.51 / Chapter 4.2.3 --- Enforcing Element Hyper-arc Consistency --- p.52 / Chapter 4.2.4 --- Enforcing Weighted Cardinality Consistency --- p.54 / Chapter 4.2.5 --- Enforcing Weighted Set Bounds Consistency --- p.56 / Chapter 5 --- Experiments --- p.59 / Chapter 5.1 --- Modeling Set Variables Using 0-1 Variables --- p.60 / Chapter 5.2 --- Softening the Problems --- p.61 / Chapter 5.3 --- Steiner Triple System --- p.62 / Chapter 5.4 --- Social Golfer Problem --- p.63 / Chapter 5.5 --- Discussions --- p.66 / Chapter 6 --- Related Work --- p.68 / Chapter 6.1 --- Other Consistency Notions in WCSPs --- p.68 / Chapter 6.1.1 --- Full Directional Arc Consistency --- p.68 / Chapter 6.1.2 --- Existential Directional Arc Consistency --- p.69 / Chapter 6.2 --- Classical CSPs with Set Variables --- p.70 / Chapter 6.2.1 --- Bounds Reasoning --- p.70 / Chapter 6.2.2 --- Cardinality Reasoning --- p.70 / Chapter 7 --- Concluding Remarks --- p.72 / Chapter 7.1 --- Contributions --- p.72 / Chapter 7.2 --- Future Work --- p.74 / List of Symbols --- p.76 / Bibliography --- p.79

Woo Hiu Chun. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2006. / Includes bibliographical references (leaves 91-99). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Constraint Satisfaction Problems --- p.1 / Chapter 1.2 --- Weighted Constraint Satisfaction Problems --- p.3 / Chapter 1.3 --- Redundant Modeling --- p.4 / Chapter 1.4 --- Motivations and Goals --- p.5 / Chapter 1.5 --- Outline of the Thesis --- p.6 / Chapter 2 --- Background --- p.8 / Chapter 2.1 --- Constraint Satisfaction Problems --- p.8 / Chapter 2.1.1 --- Backtracking Tree Search --- p.9 / Chapter 2.1.2 --- Local Consistencies --- p.12 / Chapter 2.1.3 --- Local Consistencies in Backtracking Search --- p.17 / Chapter 2.1.4 --- Permutation CSPs --- p.19 / Chapter 2.2 --- Weighted Constraint Satisfaction Problems --- p.20 / Chapter 2.2.1 --- Branch and Bound Search --- p.23 / Chapter 2.2.2 --- Local Consistencies --- p.26 / Chapter 2.2.3 --- Local Consistencies in Branch and Bound Search --- p.32 / Chapter 2.3 --- Redundant Modeling --- p.34 / Chapter 3 --- Generating Redundant WCSP Models --- p.37 / Chapter 3.1 --- Model Induction for CSPs --- p.38 / Chapter 3.1.1 --- Stated Constraints --- p.39 / Chapter 3.1.2 --- No-Double-Assignment Constraints --- p.39 / Chapter 3.1.3 --- At-Least-One-Assignment Constraints --- p.40 / Chapter 3.2 --- Generalized Model Induction for WCSPs --- p.43 / Chapter 4 --- Combining Mutually Redundant WCSPs --- p.47 / Chapter 4.1 --- Naive Approach --- p.47 / Chapter 4.2 --- Node Consistency Revisited --- p.51 / Chapter 4.2.1 --- Refining Node Consistency Definition --- p.52 / Chapter 4.2.2 --- Enforcing m-NC* c Algorithm --- p.55 / Chapter 4.3 --- Arc Consistency Revisited --- p.58 / Chapter 4.3.1 --- Refining Arc Consistency Definition --- p.60 / Chapter 4.3.2 --- Enforcing m-AC*c Algorithm --- p.62 / Chapter 5 --- Experiments --- p.67 / Chapter 5.1 --- Langford's Problem --- p.68 / Chapter 5.2 --- Latin Square Problem --- p.72 / Chapter 5.3 --- Discussion --- p.75 / Chapter 6 --- Related Work --- p.77 / Chapter 6.1 --- Soft Constraint Satisfaction Problems --- p.77 / Chapter 6.2 --- Other Local Consistencies in WCSPs --- p.79 / Chapter 6.2.1 --- Full Arc Consistency --- p.79 / Chapter 6.2.2 --- Pull Directional Arc Consistency --- p.81 / Chapter 6.2.3 --- Existential Directional Arc Consistency --- p.82 / Chapter 6.3 --- Redundant Modeling and Channeling Constraints --- p.83 / Chapter 7 --- Concluding Remarks --- p.85 / Chapter 7.1 --- Contributions --- p.85 / Chapter 7.2 --- Future Work --- p.87 / List of Symbols --- p.88 / Bibliography