Search

This paper presents a comprehensive survey of knowledge graphs in education. It covers the patterns and prospects of research in this area. A total of 48 relevant publications between 2011 and 2023 were collected from the Web of Science, Scopus, and ProQuest for review. The findings reveal a sharp increase in recent years in the body of research into educational knowledge graphs which was mainly conducted from institutions in China. Most of the relevant research work adopted a quantitative method, such as performance evaluation, user surveys, and controlled experiments, to assess the effectiveness of knowledge graph approaches. The findings also suggest that knowledge graph approaches were primarily researched and implemented in higher education institutions, with a focus on computer science, mathematics, and engineering. The most frequently addressed objectives included enhancing knowledge representation and providing personal learning recommendations, and the most common applications were concept instruction and educational recommendations. Diverse data resources, such as course materials, student learning behaviours, and online encyclopaedia, were processed to implement knowledge graph approaches in different scenarios. Relevant technical means employed for the implementation of knowledge graphs dealt with the purposes of building knowledge ontology, achieving recommendations, and creating knowledge graphs. Various pedagogies such as personalised learning and collaborative learning are supported by the knowledge graph approaches. The findings also identified key limitations in the relevant work, including insufficient information for knowledge graph construction, difficulty in extending applications across subject areas, the restricted scale and scope of data resources, and the lack of comprehensive user feedback and evaluation processes. [ABSTRACT FROM AUTHOR]

The nine papers included in this special issue represent a selection of extended contributions presented at the 14th International Conference on Hybrid Artificial Intelligent Systems (HAIS), HAIS 2019, held in León, Spain, 4-6 June 2019, and organized by the BISITE group and the University of León. In order to solve this complex optimization problem, authors propose an efficient hybrid algorithm, which was obtained by incorporating a linear programming optimization problem within the framework of a genetic algorithm. The aim of the next research, by Simic I et al. i , is the classification of skin tumours by analysing medical skin tumour dermoscopy images. [Extracted from the article]

Please send your abstracts (or copies of papers that you want to see reviewed here) to vladik@utep.edu, or by regular mail to Vladik Kreinovich, Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA... [ABSTRACT FROM AUTHOR]

Knowledge graphs (KGs) are useful data structures for the integration, retrieval, dissemination, and inference of information in various information domains. One of the main challenges in building KGs is the extraction of named entities (nodes) and their relations (edges), particularly when processing unstructured text as it has no semantic descriptions. Generating KGs from texts written in Spanish represents a research challenge as the existing structures, models, and strategies designed for other languages are not compatible in this scenario. This paper proposes a method to design and construct KGs from unstructured text in Spanish. We defined lexical patterns to extract named entities and (non) taxonomic, equivalence, and composition relations. Next, named entities are linked and enriched with DBpedia resources through a strategy based on SPARQL queries. Finally, OWL properties are defined from the predicate relations for creating resource description framework (RDF) triples. We evaluated the performance of the proposed method to determine the degree of elements extracted from the input text and to assess their quality through standard information retrieval measures. The evaluation revealed the feasibility of the proposed method to extract RDF triples from datasets in general and computer science domains. Competitive results were observed by comparing our method regarding an existing approach from the literature. [ABSTRACT FROM AUTHOR]

Cognition in computer sciences refers to the ability of a system to learn at scale, reason with purpose, and naturally interact with humans and other smart systems, such as humans do. To enhance intelligence, as well as to introduce cognitive functions into machines, recent studies have brought humans into the loop, turning the system into a human–AI hybrid. To effectively integrate and manipulate hybrid knowledge, suitable technologies and guidelines are required to sustain the human–AI interface so that communication can occur. However, traditional Knowledge Management (KM) and Knowledge Engineering (KE) approaches encounter problems when dealing with cutting-edge technologies, imposing impediments for the use of traditional methods in cognitive systems (CS). This paper presents a brief overview of the Smart Knowledge Engineering for Cognitive Systems (SKECS), which is based on methods, technologies, and procedures that bring innovations to the fields of KE, KM, and CS. The goal is to bridge the gap in the hybrid cognitive interface by the combination of experience-based knowledge representation with the use of emerging technologies such as deep learning, context-aware indexing/retrieval, active learning with a human-in-the-loop, and stream reasoning. In this work Set of Experience Knowledge Structure (SOEKS) and Decision DNA (DDNA) is extended to the visual domain and utilized for knowledge capture, representation, reuse, and evolution. These technologies are examined throughout the layers of SKECS for applications in knowledge acquisition, formalization, storage/retrieval, learning, and reasoning, with the final goal of achieving knowledge augmentation (wisdom) in CS. Features of the SKECS and their practical implementation is discussed through a case study—the Cognitive Vision Platform for Hazard Control (CVP-HC)—suggesting that methods, techniques and procedures comprising the SKECS are suitable for advancing systems toward augmented cognition. [ABSTRACT FROM AUTHOR]

Knowledge representation is one of the most explored areas in nowadays computer science research. In this paper authors pursue definition and semantics of semantic networks that are defined as part of Semantic Knowledge Base being a hybrid knowledge oriented system. The approach presented in here aims at introducing advanced properties of networks such as cardinality, partitioning or certainty at the same time using simple structure based on two operands and operators. Following paper is an extension of a conference publication that introduced advanced aspects of semantic networks modelling with the use of Association-Oriented Metamodel. The extension includes a discussion related to the formal description of the structure, as well as the description and use of association-oriented design patterns. [ABSTRACT FROM AUTHOR]

Simplifying and structuring qualitatively complex knowledge, quantifying it in a certain way to make it reusable and easily accessible are all aspects that are not new to historians. Computer science is currently approaching a solution to some of these problems, or at least making it easier to work with historical data. In this paper, we propose a historical knowledge representation model taking into consideration the quality of imperfection of historical data in terms of uncertainty. To do this, our model design is based on a multilayer approach in which we distinguish three informational levels: information, source, and belief whose combination allows modeling and modulating historical knowledge. The basic principle of this model is to allow multiple historical sources to represent several versions of the history of a historical event with associated degrees of belief. In our model, we differentiated three levels of granularity (attribute, object, relation) to express belief and defined 11 degrees of uncertainty in belief. The proposed model can be the object of various exploitations that fall within the historian's decision-making support for the plausibility of the history of historical events. [ABSTRACT FROM AUTHOR]

The treatment of concepts as decision functions characteristic for computer science and Artificial Intelligence has its roots in the logical tradition of Gottlob Frege. In its modern incarnation, decision functions, embedded in concrete knowledge representations, describe either crisp or vague assignments of categorization decisions to objects. In order to allow for effective communication between humans and computer systems, these decisions should be either effectively explained by the system or explainable with respect to the system, which in turn depends on the degree of epistemic transparency of the computer system and the conceptual representations it uses. In this, paper we distinguish between two basic types of representation: logic-based and nature-based. With respect to the latter, we identify five contributing factors to their relative epistemic opacity: A. structural complexity, B. learning procedures, C. operating on uncertain data, D. lack of translation procedures for low-level rules and representations, and E. lack of complete knowledge about natural computing systems. We consider the fourth factor (D.) to be the most important source of opacity on the level of computer systems and the fifth (E.) the main contributing factor on the level of human knowledge. [ABSTRACT FROM AUTHOR]

Due to the increasing amount of data, knowledge aggregation, representation and reasoning are highly important for companies. In this paper, knowledge aggregation is presented as the first step. In the sequel, successful knowledge representation, for instance through graphs, enables knowledge-based reasoning. There exist various forms of knowledge representation through graphs; some of which allow to handle uncertainty and imprecision by invoking the technology of fuzzy sets. The paper provides an overview of different types of graphs stressing their relationships and their essential features. An example is included for didactical reasons. [ABSTRACT FROM AUTHOR]

Bridge operational accident analysis is a critical process in bridge operational risk management. It provides valuable knowledge support for responding to newly occurring accidents. However, there are three issues: (1) research specifically focused on the past bridge operational accidents is relatively scarce; (2) there is a lack of mature research findings regarding the bridge operational accidents knowledge representation; and (3) in similar case retrieval, while case-based reasoning (CBR) is a valuable approach, there are still some challenges and limitations associated with its usage. To tackle these problems, this research proposed an automated analysis approach for bridge operational accidents based on a knowledge graph and CBR. The approach includes case representation and case retrieval, leveraging advancements in computer science and artificial intelligence. In the proposed approach, the case representation involves the adoption of a knowledge graph to construct multi-dimensional networks. The knowledge graph captures the relationships between various factors and entities, allowing for a comprehensive representation of accidents domain knowledge. In the case retrieval, a multi-circle layer retrieval strategy was innovatively proposed to enhance retrieval efficiency. Three target cases were randomly selected to verify the validity of the proposed methodology. The combination of a knowledge graph and CBR can indeed provide useful tools for the automated analysis of bridge operational accidents. Additionally, the proposed methodology can serve as a reference for intelligent risk management in other types of infrastructures. [ABSTRACT FROM AUTHOR]

Abstract: Knowledge intensive service processes should be managed in a human-oriented way since human workers who naturally undertake complex operations of an intellectual nature in the processes are the most valuable resources for service-providing companies. For the human-oriented management, a role-based approach has been widely applied. The foremost step in the role-based human process management is to assign relevant roles to appropriate humans. The role assignment task is also highly dependent on the ability of humans to consider information about roles and humans. In order to manage the role assignment in a human-oriented way, this paper presents two fundamental principles upon which the assignment task is carried out. First, roles should not be assigned until they need to be activated; second, the authority for the role assignment should be distributed to participants in the processes. In order to support the principles, the information should be explicitly and formally described to enable all the participants to easily understand and utilize it. Consequently, this paper proposes a methodology for managing the role assignment in a human-oriented way by adopting an ontological approach which can precisely describe the information. From the proposed methodology, human workers can be notified which roles are triggered to be activated and wait to be assigned. Moreover, they can be provided appropriate candidate humans when carrying out the assignment task. The contribution of this paper is to suggest a role assignment methodology that not only lightens the assignment workload by providing the capability of identifying a small set of appropriate candidates but also enables the efficient assignment by streamlining the assignment task. [Copyright &y& Elsevier]

Inconsistency-tolerant reasoning and paraconsistent logic are of growing importance not only in Knowledge Representation, AI and other areas of Computer Science, but also in Philosophical Logic. In this paper, a new logic, paraconsistent linear-time temporal logic (PLTL), is obtained semantically from the linear-time temporal logic LTL by adding a paraconsistent negation. Some theorems for embedding PLTL into LTL are proved, and PLTL is shown to be decidable. A Gentzentype sequent calculus PLTω for PLTL is introduced, and the completeness and cut-elimination theorems for this calculus are proved. In addition, a display calculus δPLTω for PLTL is defined. [ABSTRACT FROM AUTHOR]

This paper provides an abstract definition of a class of logics, called diagrammatic logics, together with a definition of morphisms and 2-morphisms between them. The definition of the 2-category of diagrammatic logics relies on category theory, mainly on adjunction, categories of fractions and limit sketches. This framework is applied to the formalisation of a parameterisation process. This process, which consists of adding a formal parameter to some operations in a given specification, is presented as a morphism of logics. Then the parameter passing process for recovering a model of the given specification from a model of the parameterised specification and an actual parameter is shown to be a 2-morphism of logics. [ABSTRACT FROM AUTHOR]

Computer science provides with virtual laboratories, places where one can merge real experiments with the formalism of algorithms and mathematics and where, with the advent of multimedia, sounds and movies can also be added. In this paper we present a method, based on principles of formal ontology, allowing one to develop interactive educational tools. The structure of our system starts from general considerations on knowledge itself moving on to formal ontological principles in order to obtain a robust knowledge frame and good awareness of knowledge levels involved during the teaching process. Our system is split into object-knowledge - the knowledge of the phenomenon to be taught - and meta-knowledge - i.e., how to teach it. Using a trip (journey) metaphor, together with the flexibility of semantic graph representations, we define the reference frame and we apply it to a case study related to the Planetary Missions, the subject of our research. This tool is provided with a multimedia interface to show the results of several current missions , but may be implemented with new missions. [ABSTRACT FROM AUTHOR]

Please send your abstracts (or copies of papers that you want to see reviewed here) to vladik@utep.edu, or by regular mail to Vladik Kreinovich, Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA... [ABSTRACT FROM AUTHOR]

Please send your abstracts (or copies of papers that you want to see reviewed here) to vladik@utep.edu, or by regular mail to Vladik Kreinovich, Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA. [ABSTRACT FROM AUTHOR]

Please send your abstracts (or copies of papers that you want to see reviewed here) to vladik@utep.edu, or by regular mail to Vladik Kreinovich, Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA... [ABSTRACT FROM AUTHOR]

Please send your abstracts (or copies of papers that you want to see reviewed here) to vladik@utep.edu, or by regular mail to Vladik Kreinovich, Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA. [ABSTRACT FROM AUTHOR]

Please send your abstracts (or copies of papers that you want to see reviewed here) to vladik@utep.edu, or by regular mail to Vladik Kreinovich, Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA... [ABSTRACT FROM AUTHOR]

Please send your abstracts (or copies of papers that you want to see reviewed here) to vladik@utep.edu, or by regular mail to Vladik Kreinovich, Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA. [ABSTRACT FROM AUTHOR]

This section is maintained by Vladik Kreinovich. Please send your abstracts (or copies of papers that you want to see reviewed here) to vladik@utep.edu, or by regular mail to: V. Kreinovich, Department of Computer Science, University of Texas, El Paso, TX 79968, USA. [ABSTRACT FROM AUTHOR]

Ternary logic has some distinct advantage over binary logic. In this paper we propose a synthesis approach for ternary reversible circuits using ternary reversible gates. Our method takes a boolean function as input. The input is provided as .pla file. The .pla file is first converted into ternary logic function, which can be represented as permutation. The gate library used for synthesis is Ternary Not, Ternary Toffoli and Ternary Toffoli + (N T ,T T ,T T + ). The proposed constructive method, generates 3-cycles from the permutation, and then each 3-cycle is mapped to (N T ,T T ,T T + ) gate library. Experimental results show that the method generates lesser number of gates for some circuits compared to previously reported works. [ABSTRACT FROM AUTHOR]

Please send your abstracts (or copies of papers that you want to see reviewed here) to vladik@utep.edu, or by regular mail to Vladik Kreinovich, Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA. [ABSTRACT FROM AUTHOR]

Please send your abstracts (or copies of papers that you want to see reviewed here) to vladik@utep.edu, or by regular mail to Vladik Kreinovich, Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA... [ABSTRACT FROM AUTHOR]

Please send your abstracts (or copies of papers that you want to see reviewed here) to vladik@utep.edu, or by regular mail to Vladik Kreinovich, Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA... [ABSTRACT FROM AUTHOR]

Please send your abstracts (or copies of papers that you want to see reviewed here) to vladik@utep.edu, or by regular mail to Vladik Kreinovich, Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA... [ABSTRACT FROM AUTHOR]

Please send your abstracts (or copies of papers that you want to see reviewed here) to vladik@utep.edu, or by regular mail to Vladik Kreinovich, Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA... [ABSTRACT FROM AUTHOR]

Please send your abstracts (or copies of papers that you want to see reviewed here) to vladik@utep.edu, or by regular mail to Vladik Kreinovich, Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA. [ABSTRACT FROM AUTHOR]

Graphics, uncertainty, and semantics are three approaches to building models. The combination of the three approaches is a way to develop a stronger modeling method. This article surveys the research efforts toward combining these aspects, which can be divided into two routes: One is to combine graphics and uncertainty as probabilistic graphical models and then incorporate semantics, and the other is to combine graphics and semantics and then incorporate probability to handle uncertainty. The models and methods involved in these efforts are introduced and their expressiveness, pros, and cons are discussed. [ABSTRACT FROM AUTHOR]

All living beings use autopoiesis and cognition to manage their "life" processes from birth through death. Autopoiesis enables them to use the specification in their genomes to instantiate themselves using matter and energy transformations. They reproduce, replicate, and manage their stability. Cognition allows them to process information into knowledge and use it to manage its interactions between various constituent parts within the system and its interaction with the environment. Currently, various attempts are underway to make modern computers mimic the resilience and intelligence of living beings using symbolic and sub-symbolic computing. We discuss here the limitations of classical computer science for implementing autopoietic and cognitive behaviors in digital machines. We propose a new architecture applying the general theory of information (GTI) and pave the path to make digital automata mimic living organisms by exhibiting autopoiesis and cognitive behaviors. The new science, based on GTI, asserts that information is a fundamental constituent of the physical world and that living beings convert information into knowledge using physical structures that use matter and energy. Our proposal uses the tools derived from GTI to provide a common knowledge representation from existing symbolic and sub-symbolic computing structures to implement autopoiesis and cognitive behaviors. [ABSTRACT FROM AUTHOR]

Abstract: After having recalled some well-known shortcomings linked with the Semantic Web approach to the creation of (application oriented) systems of “rules” – e.g., limited expressiveness, adoption of an Open World Assumption (OWA) paradigm, absence of variables in the original definition of OWL – this paper examines the technical solutions successfully used for implementing advanced reasoning systems according to the NKRL’s methodology. NKRL (Narrative Knowledge Representation Language) is a conceptual meta-model and a Computer Science environment expressly created to deal, in an ‘intelligent’ and complete way, with complex and content-rich non-fictional ‘narrative’ data sources. These last include corporate memory documents, news stories, normative and legal texts, medical records, surveillance videos, actuality photos for newspapers and magazines, etc. In this context, we will expound first the need for distinguishing between “plain/static” and “structured/dynamic” knowledge and for introducing appropriate (and different) knowledge representation structures for these two types of knowledge. In a structured/dynamic context, we will then show how the introduction of “functional roles” – associated with the possibility of making use of n-ary structures – allows us to build up highly ‘expressive’ rules whose “atoms” can directly represent complex situations, actions, etc. without being restricted to the use of binary clauses. In an NKRL context, “functional roles” are primitive symbols interpreted as “relations” – like “subject”, “object”, “source”, “beneficiary”, etc. – that link a semantic predicate with its arguments within an n-ary conceptual formula. Functional roles contrast then with the “semantic roles” that are equated to ordinary concepts like “student”, to be inserted into the “non-sortal” (no direct instances) branch of a traditional ontology. [Copyright &y& Elsevier]

Abstract: One critical problem in the operations of chemical processes is the occurrence of abnormal events. Therefore, an effective process monitoring methodology that can help detect, diagnose and predict abnormal events becomes potentially very useful. For the purpose of knowledge representation of chemical abnormality, a specified type of timed fuzzy Petri net (tFPN) approach is explicitly introduced in this paper. The dominant feature of tFPN metrics can be recognized from the fact that a timing factor is assigned to each transition, as well as a degree of reliability is associated with each place, which allows accurately representing the dynamic nature of fuzzy knowledge pertaining to abnormal events. Following a procedure towards abnormal event monitoring, two efficient algorithms in terms of abnormality prognostication and diagnosis are exploited by means of reachability analysis of tFPN. The benefits of derived techniques and solutions are illustrated through a case study consisting in a polypropylene reactor. [Copyright &y& Elsevier]

Conceptual digital dossiers have been proposed as a new paradigm for digital content management. This paper is the first in a series of works towards a complete functional conceptual digital dossier. We have focussed ourselves on the underlying knowledge base, using Conceptual Graphs for representing judgements. The paradigm is that of Conceptual Knowledge Processing. We discuss the design of a digital dossier using conceptual graphs, grounded on Contextual Logic and Formal Concept Analysis. [ABSTRACT FROM AUTHOR]

Abstract: Visual tracking consists of locating or determining the configuration of a known object at each frame of a video sequence. Usually, the description of the whole scene involves the participation of multiple targets, their movements and interactions, etc., and the scenario particular features. This paper presents a visual tracking system framework oriented to provide a “near natural language” description of the involved targets in the scene actions. Our prototype focuses on the detection, tracking and feature extraction of a dynamic number of targets in a scenario along time. The design of any visual tracking system usually needs the injection of human knowledge at each transformed level of description, in order to produce from raw videos a linguistic scene summary. The main aim of this work was to make explicit the knowledge injection needed to link the low-level representations (associated to signals) to the high-level semantics (related to knowledge) in the visual tracking problem. As a result, the emerging semantic necessary at the two transformation level is analysed and presented. We have concentrated on the representation spaces for the memetic algorithm particle filter applied to multiple object tracking in annotated scenarios, oriented to video-based surveillance applications. Finally, some example applications on different surveillance scenarios are presented and discussed. [Copyright &y& Elsevier]

Please send your abstracts (or copies of papers that you want to see reviewed here) to vladik@utep.edu, or by regular mail to Vladik Kreinovich, Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA. [ABSTRACT FROM AUTHOR]

Please send your abstracts (or copies of papers that you want to see reviewed here) to vladik@utep.edu, or by regular mail to Vladik Kreinovich, Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA. [ABSTRACT FROM AUTHOR]

Please send your abstracts (or copies of papers that you want to see reviewed here) to vladik@utep.edu, or by regular mail to Vladik Kreinovich, Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA. [ABSTRACT FROM AUTHOR]

This section is maintained by Vladik Kreinovich. Please send your abstracts (or copies of papers that you want to see reviewed here) to vladik@utep.edu, or by regular mail to: Vladik Kreinovich, Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA. [ABSTRACT FROM AUTHOR]

Please send your abstracts (or copies of papers that you want to see reviewed here) to vladik@utep.edu, or by regular mail to Vladik Kreinovich, Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA. [ABSTRACT FROM AUTHOR]

Please send your abstracts (or copies of papers that you want to see reviewed here) to vladik@utep.edu, or by regular mail to Vladik Kreinovich, Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA. [ABSTRACT FROM AUTHOR]

Argumentation is today a topical area of artificial intelligence (AI) research. Abstract argumentation, with argumentation frameworks (AFs) as the underlying knowledge representation formalism, is a central viewpoint to argumentation in AI. Indeed, from the perspective of AI and computer science, understanding computational and representational aspects of AFs is key in the study of argumentation. Realizability of AFs has been recently proposed as a central notion for analyzing the expressive power of AFs under different semantics. In this work, we propose and study the AF synthesis problem as a natural extension of realizability, addressing some of the shortcomings arising from the relatively stringent definition of realizability. In particular, realizability gives means of establishing exact conditions on when a given collection of subsets of arguments has an AF with exactly the given collection as its set of extensions under a specific argumentation semantics. However, in various settings within the study of dynamics of argumentationxs--including revision and aggregation of AFs--non-realizability can naturally occur. To accommodate such settings, our notion of AF synthesis seeks to construct, or synthesize, AFs that are semantically closest to the knowledge at hand even when no AFs exactly representing the knowledge exist. Going beyond defining the AF synthesis problem, we study both theoretical and practical aspects of the problem. In particular, we (i) prove NP-completeness of AF synthesis under several semantics, (ii) study basic properties of the problem in relation to realizability, (iii) develop algorithmic solutions to NP-hard AF synthesis using the constraint optimization paradigms of maximum satisfiability and answer set programming, (iv) empirically evaluate our algorithms on different forms of AF synthesis instances, as well as (v) discuss variants and generalizations of AF synthesis. [ABSTRACT FROM AUTHOR]

KES regularly provides networking opportunities for the professional community through one of the largest conferences of its kind in the area of knowledge engineering systems (www.kesinternational.org). She is past-chair of the Special Interest Group on Decision Support and Analytics (SIGDSA) under the Association of Information Systems (AIS), Secretary of IFIP WG8.3 Decision Support (DS), and leader of a focus group for Knowledge Engineering Systems (KES) International in intelligent decision technologies. The inspiration for IDT grew out of conversations between Professor/Dr. Gloria Phillips-Wren and Professor/Dr. Lakhmi Jain at the Knowledge Engineering Systems (KES) International annual conferences. [Extracted from the article]

This section is maintained by Vladik Kreinovich. Please send your abstracts (or copies of papers that you want to see reviewed here) to vladik@cs.utep.edu, or by regular mail to: Vladik Kreinovich, Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA. [ABSTRACT FROM AUTHOR]

This section is maintained by Vladik Kreinovich. Please send your abstracts (or copies of papers that you want to see reviewed here) to vladik@cs.utep.edu, or by regular mail to: Vladik Kreinovich, Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA. [ABSTRACT FROM AUTHOR]

The Closed World Assumption (CWA) on databases expresses the assumption that an atom not in the database is false. This assumption is applicable only in cases where the database has complete knowledge about the domain of discourse. In this article, we investigate locally closed databases, that is: databases that are sound but partially incomplete about their domain. Such databases consist of a standard database instance, augmented with a collection of Local Closed World Assumptions (LCWAs). A LCWA is a "local" form of the CWA, expressing that a database relation is complete in a certain area, called a window of expertise. In this work, we study locally closed databases both from a knowledge representation and from a computational perspective. At the representation level, the approach taken in this article distinguishes between the data that is conveyed by a database and the metaknowledge about the area in which the data is complete. We study the semantics of the LCWA's and relate it to several knowledge representation formalisms. At the reasoning level, we study the complexity of, and algorithms for two basic reasoning tasks: computing certain and possible answers to queries and determining whether a database has complete knowledge on a query. As the complexity of these tasks is unacceptably high, we develop efficient approximate methods for query answering. We also prove that for useful classes of queries and locally closed databases, these methods are optimal, and thus they solve the original query in a tractable way. As a result, we obtain classes of queries and locally closed databases for which query answering is tractable. [ABSTRACT FROM AUTHOR]

The article discusses topics on similarity-driven reasoning, analogy, learning and explanation that are important in the realization of a truly robust artificial intelligence. Case-based reasoning (CBR) is a process of solving new problems in reference to old cases with its two types, the interpretive CBR and the problem-solving CBR. Further understanding of similarity based-reasoning includes methods for knowledge representation and techniques in dealing with concepts, contexts and purpose. Intelligent systems require reasoning with explanation that is important in learning, decision-making and giving advice. Several concepts such as messy, open-textured, nonstationary and nonconvex are discussed. INSET: Al's Abiding Interest in Messy Concepts..

The classical approach to the acquisition of knowledge in artificial intelligence has been to program the intelligence into the machine in the form of specific rules for the application of the knowledge: expert systems. Unfortunately, the amount of time and resources required to program an expert system with sufficient knowledge for non-trivial problem-solving is prohibitively large. An alternative approach is to allow the machine to learn the rules based upon trial-and-error interaction with the environment, much as humans do. This will require endowing the machine with a sophisticated set of sensors for the perception of the external world, the ability to generate trial actions based upon this perceived information, and a dynamic evaluation policy to allow it to measure the effectiveness of its trial actions and modify its repertoire accordingly. The principles underlying this paradigm, known as collective learning systems theory, have already been applied to sophisticated gaming problems, demonstrating robust learning and dynamic adaptivity. The fundamental building block of a collective learning system is the learning cell, which may be embedded in a massively parallel, hierarchical data communications network. Such a network comprising 100 million learning cells will approach the intelligence capacity of the human cortex. In the not-too-distant future, it may be possible to build a race of robotic slaves to perform a wide variety of tasks in our culture. This goal, while irresistibly attractive, is most certainly fraught with severe social, political, moral, and economic difficulties. [ABSTRACT FROM AUTHOR]