AIML

In the modern era of technology, chatbot is the next big thing in the domain of conversational services. A chatbot is a virtual person who can effectively talk to any human being using interactive textual as well as verbal skills. There are many statistics available which suggest that integration of chatbot in any business as a part of their customer service increases the business progress and customer satisfaction exponentially. Hence it becomes crucial to understand the crux of the chatbot technology. Owing to extensive research in this field, there are numerous methodologies available to create a conversational entity. It becomes quite confusing to decide a perfect method to generate conversational agent for the desired purpose. Also, generation of chatbot is one issue and successful integration is in itself another problem which is many times overlooked. This paper provides some valuable insights on how to generate as well as how to integrate a chatbot.

In the lending industry, investors offer loans to lenders for the purpose of repaying interest. If the borrower pays the loan, then the lender will make a profit on the interest. However, if the borrower fails to repay the loan, the lender loses the loan. Therefore, lenders face the problem of predicting the risk of the borrower not being able to repay the loan. The main purpose of this project is to predict which of the customers will be repaid with their loans or not.

En este documento se presentan los diferentes tipos de agentes conversacionales como lo son: los Agentes Conversacionales Animados, Humanos Virtuales Creíbles, Asistentes Virtuales,
así como sus características, áreas de aplicación, y roles. Existen diversas empresas que se dedican a crear dichos agentes, los cuales deben contar con una base de conocimientos en un tema en específico. Para lograr que un agente conteste coherentemente se puede llevar a cabo un análisis de la comunicación, el cual es importante en la interacción cara-a-cara, con el fin de analizar la conversación y el discurso; los que tienen como base los actos del habla, para este caso en particular: los actos locutivos. Esto con el objetivo de llegar a crear un Sistema de Diálogo que tenga el rol de un Asistente Virtual.

"Este trabajo de investigación se origina a partir de un proyecto realizado en la institución relacionado con un agente conversacional corpóreo, ya que actualmente el uso de los Agentes Conversacionales Animados ha ido creciendo. Estos suelen ser una herramienta utilizada en ciertas funciones en las cuales pueden servir como guías, maestros, ayudantes, etc.

La problemática que abordamos en éste documento, es la implementación de un agente conversacional capaz de expresar diálogos creíbles en lenguaje natural, expresando en sus diálogos rasgos de personalidad, emociones y su intensidad. Para la generación de diálogos creíbles, proponemos utilizar la extensión que se le hizo al lenguaje AIML (Artificial Intelligence Markup Language), utilizando la nueva estructura para los archivos de la base de conocimientos basados en AIML, mediante diálogos creíbles, es capaz de crear escenarios más reales para que el aspirante disperse sus dudas con relación a la
Maestría en Ciencias en Ciencias de la Computación, manteniendo una conversación simulada por el agente conversacional. Para esto se presentó una metodología para organizar y diseñar la estructura de los diálogos de un Agente Conversacional Animado capaz de expresar emociones en su diálogo. Resultando de éste trabajo un Asistente Virtual con Diálogo Emocional que proporciona información sobre la Maestría en Ciencias en Ciencias de la Computación del ITCM."

We provide a strongly complete infinitary proof system for hybrid logic. This proof system can be extended with countably many sequents. Thus completeness proofs are provided for infinitary hybrid versions of non-compact logics like ancestral logic and Segerberg's modal logic with the bounded chain condition. This extends the completeness result for hybrid logics by Blackburn and Tzakova. Keywords: hybrid logic, strong completeness, non-compact logics, infinitary proof rules

"Este trabajo de investigación se origina a partir de un proyecto de la Universidad de Barcelona para desarrollar habilidades en el diagnóstico del Trastorno de Ansiedad Generalizada a estudiantes de psicología y psiquiatría utilizando un chatbot, el cual es un programa que intenta simular una conversación humana con una persona [Laven, 1996].

La problemática que abordamos en éste documento, es convertir un chatbot en un agente conversacional capaz de generar diálogos creíbles y dinámicos en lenguaje natural, expresando en sus diálogos rasgos de personalidad, emociones y su intensidad. Para la generación de diálogos creíbles, proponemos realizar una extensión al lenguaje AIML (Artificial Intelligence Markup Language), proponiendo una nueva estructura para los
archivos de conocimiento basados en AIML, la cual será la estructura de la base de conocimientos de nuestro agente conversacional.

El agente conversacional, mediante diálogos creíbles, es capaz de crear escenarios más reales para que el estudiante diagnostique de forma contundente el padecimiento simulado por el agente conversacional. Para determinar si los usuarios perciben que a través del diálogo textual se expresa una emoción y para determinar si una imagen refuerza la emoción transmitida en los diálogos se aplicó una encuesta. Las emociones evaluadas fueron Miedo, Alegría, Tristeza, Enojo, Angustia, Placer, Sorpresa y Resignación. La encuesta se dividió en dos partes y muestra una pequeña conversación entre un usuario y el ECA, en la primera parte, se utilizaron sólo frases y en la segunda, éstas fueron reforzadas con imágenes del agente conversacional, acordes a la emoción a transmitir en el diálogo. Los resultados muestran que el porcentaje de identificación de la emoción y de su intensidad en las frases fueron del 57.50% y del 43.92% y que los porcentajes de identificación al reforzar las frases con imágenes fueron del 70.51% y del 55.35%, respectivamente. Estos resultados indican que utilizar imágenes reforzando a las frases contribuye en la identificación de las emociones y de sus intensidades."

Sign language is the basic means of communication among hearing-impaired people. Systems that could act as interpreters between vocal and hearing-impaired people would facilitate the life of deaf and integrate them in the society. Such systems should perform bidirectional translation of sign language and spoken language. A lot of efforts invested on translating sign languages to spoken languages. However, it is just as important to translate a spoken language to a sign language. This would provide a two-way communication between hearing-impaired and vocal people. A reasonably priced portable computer would be sufficient to perform the two-way translation. This paper proposes a system that translates Arabic text to Arabic sign language. A word that corresponds to a sign from the Arabic sign language dictionary calls a pre-recorded video clip showing the sign played on the monitor of the portable computer. If the word does not have a corresponding sign in the dictionary, it is finger ...

5 Глава. Алгоритмы языка программирования SLIMD Semantic Logical Intelligence magnetic domains и правила науки Лингвистика используемые для реализации технологии Загрузки Сознания программно Mind Uploading Whole Brain Emulation. Алгоритм актуального членения предложения Topic-Comment языка программирования SLIMD Semantic Logical Intelligence magnetic domains, по которому возможно осуществлять Загрузку Сознания Mind Uploading Whole Brain Emulation программно из памяти межнейрональных связей нервной системы нервной сети человека способом составления в результате размышлений множественного количества Семантических сетей семантического интеллекта или Нейронных сетей нейронного интеллекта имеет некоторые отличительные особенности, которые и хотелось бы объяснить. Сознание и мышление человека, обученного одному или множеству различных языков естественной разговорной речи складывается и формируется в результате жизнедеятельности и восприятия окружающего бытия. В биологической нервной системе нервной сети человека распределение потоков информации получаемых и воспринимаемых через зрительную, слуховую и осязательную системы происходит по межнейрональным взаимосвязям вероятно хаотически, учитывая химические реакции с химическим балансом, как в организме, так и в нервной системе нервной сети, и их отличия, происходящие в определённые моменты жизнедеятельности человеческого организма. Таким образом, запоминание и распределение информации, поступающей на языках естественной разговорной речи или поступающей изображениями в нервную систему нервную сеть через органы зрения, слуха и осязания происходит хаотически с некоторыми упорядоченностями, например при многократных повторениях или заучиваниях информации наизусть, и накапливается там, в огромных хаотических объёмах с некоторым процентом упорядоченности уникальными идентификаторами пространства имён. Например, уникальные идентификаторы пространств имён могут

A chatbot is a machine conversation system which interacts with human users via natural conversational language. Software to machine-learn conversational patterns from a transcribed dialogue corpus has been used to generate a range of chatbots speaking various languages and sublanguages including varieties of English, as well as French, Arabic and Afrikaans. This paper presents a program to learn from spoken transcripts of the Dialogue Diversity Corpus of English, the Minnesota French Corpus, the Corpus of Spoken Afrikaans, the Qur'an Arabic-English parallel corpus, and the British National Corpus of English; we discuss the problems which arose during learning and testing. Two main goals were achieved from the automation process. One was the ability to generate different versions of the chatbot in different languages, bringing chatbot technology to languages with few if any NLP resources: the corpus-based learning techniques transferred straightforwardly to develop chatbots for ...

The Global Hyperorgan is an intercontinental, creative space for acoustic musicking. Existing pipe organs around the world are networked for real-time, geographically-distant performance, with performers utilizing instruments and other input devices to collaborate musically through the voices of the pipes in each location. A pilot study was carried out in January 2021, connecting two large pipe organs in Pitea, Sweden, and Amsterdam, the Netherlands. A quartet of performers tested the Global Hyperorgan’s capacities for telematic musicking through a series of pieces. The concept of modularity is useful when considering the artistic challenges and possibilities of the Global Hyperorgan. We observe how the modular system utilized in the pilot study afforded multiple experiences of shared instrumentality from which new, synthetic voices emerge. As a long-term technological, artistic and social research project, the Global Hyperorgan offers a platform for exploring technology, agency, vo...

This paper aim is to average the use of techniques of decision trees, in combination with the management model CRISP-ADM, to help in the prediction of heart diseases. It is widely based on decision trees, an important concept in the field of artificial intelligence. This paper focuse on discussing how these trees are able to assist in the result making process of identifying heart diseases by the analysis of information provided from the hospitals. This information is captured with the help of techniques and the CRISP-DM management model of data mining in large prepared databases logged from hospital day to day transactions.

In this paper we identify modal logics of some bimodal Kripke frames corresponding to geometrical structures. Each of these frames is a set of 'geometrical' objects with some natural accessibility relation plus the universal relation. For these logics we present nite axiom systems and prove completeness. We also show that all these logics have the nite model property and are PSPACE-complete. To prove this, we show that under certain restrictions, adding the universal modality preserves 'good' properties of a monomodal logic.

Abstract.
This paper presents educational software based on a math tutor for elementary school children. This software teaches the basics operations of mathematics through a virtual tutor endowed with personality. The virtual tutor is a cognitive agent that integrates a behavioral model, verbal and nonverbal expressions. This architecture was based on the concepts of computing Clouding and RIA (Rich Internet Application) for easy access through Internet and mobile devices.

We provide a strongly complete infinitary proof system for hybrid logic. This proof system can be extended with countably many sequents. Thus completeness proofs are provided for infinitary hybrid versions of non-compact logics like ancestral logic and Segerberg's modal logic with the bounded chain condition. This extends the completeness result for hybrid logics by Blackburn and Tzakova. Keywords: hybrid logic, strong completeness, non-compact logics, infinitary proof rules

Reduction axioms for epistemic actions Barteld Kooi⁄ and Johan van Benthem† Abstract: Current dynamic epistemic logics often become cumbersome and opaque when common knowledge is added for groups of agents. We propose new versions that extend the underlying static ...

This paper is based on a project at the University of Barcelona to develop the skills to diagnose the Generalized Anxiety Disorder (GAD) in students of psychology and psychiatry using a chatbot. The problem we address in this paper is to convert a chatbot in an emotional conversational agent capable of generating a believable and dynamic dialogue in natural language. For it, the dialogues convey traits of personality, emotions and its intensity. We propose to make an AIML language extension for the generation of believable dialogue, this extension will allow to create a more realistic scenario for the student to diagnose the condition simulated by the conversational agent. In order to measure the perception of the emotional state of the ECA expressed by the speech acts a survey was applied.

This paper is based on a project at the University of Barcelona to develop the skills to diagnose the Generalized Anxiety Disorder (GAD) in students of psychology and psychiatry using a chatbot. The problem we address in this paper is to convert a chatbot in an emotional conversational agent capable of generating a believable and dynamic dialogue in natural language. For it, the dialogues convey traits of personality, emotions and its intensity. We propose to make an AIML language extension for the generation of believable ...

We provide a strongly complete infinitary proof system for hybrid logic. This proof system can be extended with countably many sequents. Thus completeness proofs are provided for infinitary hybrid versions of non-compact logics like ancestral logic and Segerberg's modal logic with the bounded chain condition. This extends the completeness result for hybrid logics by Blackburn and Tzakova. Keywords: hybrid logic, strong completeness, non-compact logics, infinitary proof rules

We develop a new version of the well-known filtration method in modal logic, allowing us to construct large countermodels and to solve some open problems on the finite model property for products of modal logics. This filtration is based on the bisimilarity relation between parts of the original model; it generalizes earlier versions of the filtration method introduced by E. Lemmon, K. Segerberg, D. Gabbay, and the author.

In terms of validity in Kripke frames, a modal formula expresses a universal monadic second-order condition. Those modal formulae which are equivalent to first-order conditions are called elementary. Modal formulae which have a certain persistence property which implies their validity in all canonical frames of modal logics axiomatized with them, and therefore their completeness, are called canonical. This is a survey of a recent and ongoing study of the class of elementary and canonical modal formulae. We summarize main ideas and results, and outline further research perspectives.

Data mining technique in the history of medical
data found with enormous investigations found that the
prediction of heart disease is very important in medical science.
In medical history it is observed that the unstructured data as
heterogeneous data and it is observed that the data formed with
different attributes should be analyzed to predict and provide
information for making diagnosis of a heart patient. Various
techniques in Data Mining have been applied to predict the heart
disease patients. But, the uncertainty in data was not removed
with the techniques available in data mining and implemented by
various authors. To remove uncertainty of unstructured data, an
attempt was made by introducing fuzziness in the measured data.
A membership function was designed and incorporated with the
measured value to remove uncertainty and fuzzified data was
used to predict the heart disease patients.. Further, an attempt
was made to classify the patients based on the attributes collected
from medical field. Minimum Euclidean distance Fuzzy K-NN
classifier was designed to classify the training and testing data
belonging to different classes. It was found that Fuzzy K-NN
classifier suits well as compared with other classifiers of
parametric techniques.

We present a complete axiomatization of a logic denoted by MTML (Mereo-Topological Modal Logic) based on the following set of mereotopological relations: part-of, overlap, underlap, contact, dual contact and interior part-of. We prove completeness theorems for MTML with respect to several classes of models including the standard topological models over the set of regular-closed subsets of arbitrary topological spaces. We show that MTML possesses fmp with respect to a class of non-standard models, which implies its decidability. In this way we propose also a solution of the main open problem, formulated in [17] to find a decidable modal logic for topological relations.

We investigate an alternative presentation of classical and pos- itive modal logic where the coalgebraic cover modality is taken as primitive. For each logic, we present a sound and complete Hilbert-styl e axiomatiza- tion. Moreover, we give a two-sided sound and complete seque nt calculus for the negation-free language, and for the language with negat ion we provide a one-sided

Model combination in classification, density estimation and clustering and forecasting has become a promising research area where better results are obtained compared to using single models. Bayesian inference offers two approaches for combining models; Bayesian model averaging (BMA), and Supra-Bayesian classifier combination (SBCC). In this paper we briefly overview the BMA, show its drawbacks, and propose a novel idea of Bayesian data/model averaging. Then, the SBCC technique is explained, and its implementation used in this work is presented. A novel approach is proposed where input space is clustered before applying the SBCC. A 2-dimensional, 2-class, 4-experts problem is used to test the SBCC and SBCC-clustering algorithms, where better results are obtained over 300 runs for the data set, compared to an averaging technique, where the 4 experts’ performance is averaged.

Current dynamic epistemic logics often become cumbersome and opaque when common knowledge is added for groups of agents. We propose new versions that extend the underlying static epistemic languages in such a way that completeness proofs for the full dynamic systems can be obtained by perspicuous reduction axioms.

Labelled tableaux are extensions of semantic tableaux with annotations (labels, indices) whose main function is to enrich the modal object language with semantic elements. This paper consists of three parts. In the first part we consider some options for labels: simple constant labels vs labels with free variables, logic depended inference rules vs labels manipulation based on a label algebra. In the second and third part we concentrate on a particular labelled tableaux system called KEM using free variable and a specialised label algebra. Specifically in the second part we show how labelled tableaux (KEM) can account for different types of logics (e.g., non-normal modal logics and conditional logics). In the third and final part we investigate the relative complexity of labelled tableaux systems and we show that the uses of KEM's label algebra can lead to speed up on proofs.

Distância vem despertando muito interesse de pesquisadores de diversas áreas. Por isso, também vem sendo muito abordada em congressos, workshops e seminários. Muito se discute sobre a união entre tecnologia e educação visando complementar a formação de estudantes. Com a pesquisa em Inteligência Artificial, surgiram os chatterbots. Chatterbots são programas destinados a demonstrar a capacidade racional de um computador, ou seja, buscam imitar o comportamento da inteligência humana. Este artigo apresenta uma implementação de um chatterbot educacional para o ensino de física e redes de computadores, a Profª Elektra, baseado no ALICE, um chatterbot bastante utilizado no mundo

Intelligent Pedagogical Agents (IPAs) can be thought of as embodied intelligent agents that are designed for pedagogical purposes to support learning. They can be designed in particular for virtual worlds. Virtual worlds are becoming an interesting medium for engineering education for the properties of visual collaboration abilities providing authentic learning experiences and for the opportunity of providing active learning. However, virtual worlds need more educational support to be more inhabited with increased learning services. Incorporating intelligent pedagogical agents into virtual worlds adds such learning support by adding intelligence, improving believability, and the opportunity to increase communication with an artificial educator. However the implementation of intelligent pedagogical agents and adopting them in a virtual world require several efforts with different aspects of implementation. This paper reports our first prototype implementation of an IPA interacting with a learner and a learning object in natural science experiment in a virtual world while providing supporting multimodal communication abilities. The IPA has features of text chat based on the Artificial Intelligence Markup Language (AIML), a text-to-speech synthesis function, and non-verbal communication abilities through gesture animation. The implementation is presented through explained scenarios of the IPA tutoring an experiment or monitoring a learner avatar interaction with a learning object in a Virtual World. The IPA & the learning scenarios are implemented in the open source of Open Wonderland.

Reduction axioms for epistemic actions Barteld Kooi⁄ and Johan van Benthem† Abstract: Current dynamic epistemic logics often become cumbersome and opaque when common knowledge is added for groups of agents. We propose new versions that extend the underlying static ...

We observe that the known fact that dierence logic and hybrid logic with universal modality have the same expressive power on Kripke frames can be strengthened for a far wider class of general frames. This observation, together with a general completeness result, is used to show that lattices of dierence logics and of hybrid logics are isomorphic.

In this paper we prove that Japaridze's Polymodal Logic is PSPACE-decidable. To show this, we describe a decision procedure for satisfiability on hereditarily ordered frames that can be applied to obtain upper complexity bounds for various modal logics.

This paper presents a Neural Network Classifier to be implemented in corner detection of chain code series. The classifier directly uses chain code which is derived using Freeman chain code as training, testing and validation set. The steps of developing Neural Network Classifier are included in this paper. Comparison results between Neural Network Classifier corner detection and other computational corner detection are presented to show the reliability of the proposed classifier. This paper ends with the discussions on the implementation of proposed neural network in corner detection of chain code series. Experimental results have shown that the proposed network has good robustness and detection performance. This makes this method a great choice for machine vision.