Caso de aplicación de representación del conocimiento utilizando grafos conceptuales en un sistema de corrección automatizado de exámenes

El presente trabajo describe la implementación de una base de conocimientos, implementada como un grafo conceptual, utilizado como parte de un sistema de corrección de exámenes automatizado, sobre respuestas redactadas en forma de texto en lenguaje natural. Se presentan los conceptos básicos de representación del conocimiento y las características de los grafos conceptuales aplicados a tal fin y se describe el mecanismo utilizado para evaluar una respuesta utilizando un grafo conceptual como repositorio de los conceptos del dominio de la materia Paradigmas de Programación, utilizada en este caso de aplicación en particular. Por último, se explica la utilización de conceptos, relaciones y equivalencias dentro del proceso de evaluación, las reglas que el sistema implementa para simplificar las expresiones, minimizar el almacenamiento necesario y optimizar los tiempos de búsqueda y se detallan los pasos del proceso de evaluación.XVI Workshop Tecnología Informática Aplicada en Educación (WTIAE).Red de Universidades con Carreras en Informática (RedUNCI

Interpreting network formalisms

AbstractIn a recent paper, Reiter and Criscuolo [3] remark “that (semantic) networks are notational variants of logical formulae is by now a truism in Artificial Intelligence circles”. Shamelessly exploiting the foregoing quote as a pretext, I attempt to sketch adequate semantic accounts for at least two (kinds of) semantic network formalisms; one, based on the notion of inheritance, one, not. A crucial condition of adequacy to be satisfied is fidelity to some of the intuitions of the creators of the formalisms

Applying fuzziness to enemy behavior in a serious game

This work presents the design and implementation of a real time fuzzy logic Mamdani-type controller for enemy artificial intelligence (AI) in a serious game. The game chosen is Power Down the Zombies, a serious game with educational purposes. A prototype of the game is coded in Javascript, and a comparison is made between the fuzzy enemy behavior and the classical, crisp one. The results of this work show the feasibility of fuzzy logic systems as a highly adequate choice for modelling human-like behaviour and decision making for an element in a videogame, with minimum processing costs.XVI Workshop Tecnología Informática Aplicada en Educación (WTIAE).Red de Universidades con Carreras en Informática (RedUNCI

Meinongian Semantics and Artificial Intelligence

This essay describes computational semantic networks for a philosophical audience and surveys several approaches to semantic-network semantics. In particular, propositional semantic networks (exemplified by SNePS) are discussed; it is argued that only a fully intensional, Meinongian semantics is appropriate for them; and several Meinongian systems are presented

Las representaciones fácticas y cognitivas del relato de entrevistas biográficas : un análisis reticular del discurso

Este artículo trata de identificar y relacionar las dimensiones fácticas y cognitivas de un relato biográfico, entendido como una representación narrativa. El entrevistado construye su narración entreverando ambas dimensiones a lo largo del relato. Este artículo propone un método de análisis reticular del discurso como un procedimiento eficaz para poner de relieve y relacionar ambas dimensiones. A partir de teorías lingüísticas ad hoc y de la teoría de las Redes Sociales se enmarca, analiza y hace emerger el discurso del relato.This article tries to identify and to relate the factual to the cognitive dimensions of a biographical history understood as a narrative representation. It is constructed by the interviewed from the combination of both dimensions. This paper proposes reticular discourse analysis as an effective method for putting forward both dimensions in a related fashion. Through linguistics and ad hoc social network theories, the discourse from the biographical history is framed, analyzed and made relevant

A Net Structure for Semantic Information Storage, Deduction and Retrieval

This paper descril3es a data structure, MENS (MEmory Net Structure), that is useful for storing semantic information stemming Crom a natural language, and a system, MENTAL (MEmory Net That Answers and Learns) that interacts with a user (human or program), stores information into and retrieves information from MENS and interprets some information in MENS as rules telling it how to deduce new information from what is already stored. MENTAI can be used as a question- answering system with formatted input/output, as a vehicle for experimenting with various theories of semantic structures or as the memory management portion of a natural language question-answering system

Goal driven theorem proving using conceptual graphs and Peirce logic

The thesis describes a rational reconstruction of Sowa's theory of Conceptual Graphs. The reconstruction produces a theory with a firmer logical foundation than was previously the case and which is suitable for computation whilst retaining the expressiveness of the original theory. Also, several areas of incompleteness are addressed. These mainly concern the scope of operations on conceptual graphs of different types but include extensions for logics of higher orders than first order. An important innovation is the placing of negation onto a sound representational basis. A comparison of theorem proving techniques is made from which the principles of theorem proving in Peirce logic are identified. As a result, a set of derived inference rules, suitable for a goal driven approach to theorem proving, is developed from Peirce's beta rules. These derived rules, the first of their kind for Peirce logic and conceptual graphs, allow the development of a novel theorem proving approach which has some similarities to a combined semantic tableau and resolution methodology. With this methodology it is shown that a logically complete yet tractable system is possible. An important result is the identification of domain independent heuristics which follow directly from the methodology. In addition to the theorem prover, an efficient system for the detection of selectional constraint violations is developed. The proof techniques are used to build a working knowledge base system in Prolog which can accept arbitrary statements represented by conceptual graphs and test their semantic and logical consistency against a dynamic knowledge base. The same proof techniques are used to find solutions to arbitrary queries. Since the system is logically complete it can maintain the integrity of its knowledge base and answer queries in a fully automated manner. Thus the system is completely declarative and does not require any programming whatever by a user with the result that all interaction with a user is conversational. Finally, the system is compared with other theorem proving systems which are based upon Conceptual Graphs and conclusions about the effectiveness of the methodology are drawn

Applying the Engineering Statechart Formalism to the evaluation of soft real-time in operating systems : a use case tailored modeling and analysis technique

Multimedia applications that have emerged in recent years impose unique requirements on an underlying general purpose operating system (GPOS). The suitability of a GPOS for multimedia processing is judged by its soft real-time capabilities. To date, the question of how these capabilities can be assessed has scarcely been addressed: this is a gap in GPOS research. By answering questions on the impacts of the Interrupt Handling Facility (IHF) on the overall soft real-time capabilities of a GPOS, this thesis contributes to the filling of this blank space. The Engineering Statechart Formalism (ESF), a use case tailored formal method of modeling real-world OS, is syntactically and semantically defined. Models of the IHF of selected real-world operating systems are then created by means of this technique. As no appropriate real-time concept fitting the goals of this thesis as yet exists, a suitable definition is constructed. By projecting this system-wide idea to the interrupt subsystem, specific indicators for this subsystem are erived. These indicators are then evaluated by applying formal techniques such as graph-based analysis and temporal logic model checking to the ESF models. Finally, the assertions derived from this evaluation are interpreted with respect to their impacts on real-time multimedia processing in different general purpose operating systems.Multimedia-Anwendungen haben in den letzten Jahren weite Verbreitung erfahren. Solche Anwendungen stellen besondere Anforderungen an das Betriebssystem (BS), auf dem sie ausgeführt werden. Insbesondere Echtzeitfähigkeiten des Betriebssystems sind von Bedeutung, wenn es um seine Eignung für Multimedia-Verarbeitung geht. Bis heute wurde die Frage, wie sich diese Fähigkeiten konkret innerhalb eines BS manifestieren, nur unzureichend untersucht. Die vorliegende Arbeit leistet einen Beitrag zur Füllung dieser Lücke in der BS-Forschung. Die Effekte des Subsystems zur Unterbrechungsbehandlung in BS auf die Echtzeitfähigkeit des Gesamtsystems werden detailliert auf Basis von Modellen dieses Subsystems in verschiedenen BS analysiert. Um eine formale Auswertung zu erlauben, wird eine auf den Anwendungsfall zugeschnittene formale Methode zur BS-Modellierung verwendet. Die spezifizierte Syntax und Semantik dieses Engineering Statechart Formalism (ESF) basieren auf dem klassischen Statechart-Formalismus. Da bislang kein geeigneter Echtzeit-Begriff existiert, wird eine konsistente Definition hergeleitet. Durch die Abbildung dieser sich auf das Gesamtsystem beziehenden Eigenschaft auf die Unterbrechungsbehandlung werden spezifische Indikatoren für dieses Subsystem hergeleitet. Die Ausprägungen dieser Indikatoren für die verschiedenen untersuchten Betriebssyteme werden anhand formaler Methoden wie graphbasierter Analyse und Temporal Logic Model Checking ausgewertet. Die Interpretation der Untersuchungsergebnisse liefert Aussagen über die Effekte der Implementierung der Unterbrechungsbehandlung auf die Echtzeitfähigkeit der untersuchten Betriebssysteme bei der Verarbeitung von multimedialen Daten