Conceptual Representations for Computational Concept Creation

Computational creativity seeks to understand computational mechanisms that can be characterized as creative. The creation of new concepts is a central challenge for any creative system. In this article, we outline different approaches to computational concept creation and then review conceptual representations relevant to concept creation, and therefore to computational creativity. The conceptual representations are organized in accordance with two important perspectives on the distinctions between them. One distinction is between symbolic, spatial and connectionist representations. The other is between descriptive and procedural representations. Additionally, conceptual representations used in particular creative domains, such as language, music, image and emotion, are reviewed separately. For every representation reviewed, we cover the inference it affords, the computational means of building it, and its application in concept creation.Peer reviewe

Approximate syllogistic reasoning: a contribution to inference patterns and use cases

In this thesis two models of syllogistic reasoning for dealing with arguments that involve fuzzy quantified statements and approximate chaining are proposed. The modeling of quantified statements is based on the Theory of Generalized Quantifiers, which allows us to manage different kind of quantifiers simultaneously, and the inference process is interpreted in terms of a mathematical optimization problem, which allows us to deal with more arguments that standard deductive ones. For the case of approximate chaining, we propose to use synonymy, as used in a thesaurus, for calculating the degree of confidence of the argument according to the degree of similarity between chaining terms. As use cases, different types of Bayesian reasoning (Generalized Bayes' Theorem, Bayesian networks and probabilistic reasoning in legal argumentation) are analysed for being expressed through syllogisms

Elaboración de un modelo de argumentación automática basado en relaciones lingüísticas imprecisas. Una contribución a la CWW

El principal objetivo de esta memoria es establecer un análisis crítico de las aproximaciones y herramientas desarrolladas hasta el momento en el tratamiento automaizado de la vaguedad con el fin de diseñar una alternativa no precisificada basada en los conceptos propios de la computación con palabras y la aproximación semántica de grados, utilizando para ello las relaciones semánticas como principal herramienta en la unificación entre términos. A su vez, el algoritmo resultante se implementará en la creación de un asistente-evaluador automático que servirá como ejemplo práctico de los pasos requeridos para el análisis de razonamientos aproximados en lenguaje natural

Knowledge search for new product development: a multi-agent based methodology

Manufacturers are the leaders in developing new products to drive productivity. Higher productivity means more products based on the same materials, energy, labour, and capitals. New product development plays a critical role in the success of manufacturing firms. Activities in the product development process are dependent on the knowledge of new product development team members. Increasingly, many enterprises consider effective knowledge search to be a source of competitive advantage. This research presents an exploratory case study conducted at an aircraft manufacturer. This investigation uncovered six, empirically derived and theoretically informed, problems to enterprise knowledge search. They have been articulated as (i) the effectual web bandwidth limits search speed; (ii) less relevant search results based on word-frequency recognition models of search engine; (iii) un-useable techniques for enterprise search; (iv) rigour security, reliability, and company policy; (v) poor search performance about unstructured enterprise knowledge; (vi) the lack of tacit knowledge sharing. Existing search methodologies have focused on the internet search, rather than providing effective search for enterprise. This research aim is developed to assist the manufacturing enterprise in meeting the industrial requirements in the following way: a methodology and system that can improve the information and knowledge search performance in new product development process. Based on the exploratory case findings, a knowledge search methodology and system has been developed. Agent technology is used to fulfil the requirements of enterprise search. Some initial tests were conducted to better understand implementation issues and future deployment of the methodology and system in practice

Investigating the universality of a semantic web-upper ontology in the context of the African languages

Ontologies are foundational to, and upper ontologies provide semantic integration across, the Semantic Web. Multilingualism has been shown to be a key challenge to the development of the Semantic Web, and is a particular challenge to the universality requirement of upper ontologies. Universality implies a qualitative mapping from lexical ontologies, like WordNet, to an upper ontology, such as SUMO. Are a given natural language family's core concepts currently included in an existing, accepted upper ontology? Does SUMO preserve an ontological non-bias with respect to the multilingual challenge, particularly in the context of the African languages? The approach to developing WordNets mapped to shared core concepts in the non-Indo-European language families has highlighted these challenges and this is examined in a unique new context: the Southern African languages. This is achieved through a new mapping from African language core concepts to SUMO. It is shown that SUMO has no signi ficant natural language ontology bias.ComputingM. Sc. (Computer Science

Automated code compliance checking in the construction domain using semantic natural language processing and logic-based reasoning

Construction projects must comply with various regulations. The manual process of checking the compliance with regulations is costly, time consuming, and error prone. With the advancement in computing technology, there have been many research efforts in automating the compliance checking process, and many software development efforts led by industry bodies/associations, software companies, and/or government organizations to develop automated compliance checking (ACC) systems. However, two main gaps in the existing ACC efforts are: (1) manual effort is needed for extracting requirements from regulatory documents and encoding these requirements in a computer-processable rule format; and (2) there is a lack of a semantic representation for supporting automated compliance reasoning that is non-proprietary, non-hidden, and user-understandable and testable. To address these gaps, this thesis proposes a new ACC method that: (1) utilizes semantic natural language processing (NLP) techniques to automatically extract regulatory information from building codes and design information from building information models (BIMs); and (2) utilizes a semantic logic-based representation to represent and reason about the extracted regulatory information and design information for compliance checking. The proposed method is composed of four main methods/algorithms that are combined in one computational framework: (1) a semantic, rule-based method and algorithm that leverage NLP techniques to automatically extract regulatory information from building codes and represent the extracted information into semantic tuples, (2) a semantic, rule-based method and algorithm that leverage NLP techniques to automatically transform the extracted regulatory information into logic rules to prepare for automated reasoning, (3) a semantic, rule-based information extraction and information transformation method and algorithm to automatically extract design information from BIMs and transform the extracted information into logic facts to prepare for automated reasoning, and (4) a logic-based information representation and compliance reasoning schema to represent regulatory and design information for enabling the automated compliance reasoning process. To test the proposed method, a building information model test case was developed based on the Duplex Apartment Project from buildingSMARTalliance of the National Institute of Building Sciences. The test case was checked for compliance with a randomly selected chapter, Chapter 19, of the International Building Code 2009. Comparing to a manually developed gold standard, 87.6% precision and 98.7% recall in noncompliance detection were achieved, on the testing data

Ontology alignment mechanisms for improving web-based searching

Ontology has been developed to offer a commonly agreed understanding of a domain that is required for knowledge representation, knowledge exchange and reuse across domains. Therefore, ontology organizes information into taxonomies of terms (i.e., concepts, attributes) and shows the relationships between them. In fact, it is considered to be helpful in reducing conceptual confusion for users who need to share applications of different kinds, so it is widely used to capture and organize knowledge in a given domain. Although ontologies are considered to provide a solution to data heterogeneity, from another point of view, the available ontologies could themselves introduce heterogeneity problems. In order to deal with these problems, ontologies must be available for sharing or reusing; therefore, semantic heterogeneity and structural differences need to be resolved among ontologies. This can be done, in some cases, by aligning or matching heterogeneous ontologies. Thus, establishing the relationships between terms in the different ontologies is needed throughout ontology alignment. Semantic interoperability can be established in ontology reconciliation. The original problem is called the ―ontology alignment‖. The alignment of ontologies is concerned with the identification of the semantic relationships (subsumption, equivalence, etc.) that hold between the constituent entities (which can be classes, properties, etc.) of two ontologies. In this thesis, an ontology alignment technique has been developed in order to facilitate communication and build a bridge between ontologies. An efficient mechanism has been developed in order to align entities from ontologies in different description languages (e.g. OWL, RDF) or in the same language. This approach tries to use all the features of ontologies (concept, attributes, relations, structure, etc.) in order to obtain efficiency and high quality results. For this purpose, several matching techniques have been used such as string, structure, heuristic and linguistic matchingtechniques with thesaurus support, as well as human intervention in certain cases, to obtain high quality results. The main aim of the work is to introduce a method for finding semantic correspondences among heterogeneous ontologies, with the intention of supporting interoperability over given domains. The approach brings together techniques in modelling, string matching, computation linguistics, structure matching and heuristic matching, in order to provide a semi-automatic alignment framework and prototype alignment system to support the procedure of ontology alignment in order to improve semantic interoperability in heterogeneous systems. This technique integrates some important features in matching in order to achieve high quality results, which will help when searching and exchanging information between ontologies. Moreover, an ontology alignment system illustrates the solving of the key issues related to heterogeneous ontologies, which uses combination-matching strategies to execute the ontology-matching task. Therefore, it can be used to discover the matching between ontologies. This thesis also describes a prototype implementation of this approach in many real-world case studies extracted from various Web resources. Evaluating our system is done throughout the experiments provided by the Ontology Alignment Evaluation Initiative. The system successfully achieved 93% accuracy for ontology matching. Finally, a comparison between our system and well-known tools is achieved so that our system can be evaluated

Sentence Similarity Analysis with Applications in Automatic Short Answer Grading

In this dissertation, I explore unsupervised techniques for the task of automatic short answer grading. I compare a number of knowledge-based and corpus-based measures of text similarity, evaluate the effect of domain and size on the corpus-based measures, and also introduce a novel technique to improve the performance of the system by integrating automatic feedback from the student answers. I continue to combine graph alignment features with lexical semantic similarity measures and employ machine learning techniques to show that grade assignment error can be reduced compared to a system that considers only lexical semantic measures of similarity. I also detail a preliminary attempt to align the dependency graphs of student and instructor answers in order to utilize a structural component that is necessary to simulate human-level grading of student answers. I further explore the utility of these techniques to several related tasks in natural language processing including the detection of text similarity, paraphrase, and textual entailment