AIML

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.

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 ...

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 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

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.

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

The paper considers a class of modal logics uniformly axiomatized by a special infinite schema of formulas, generalizing a logic studied by G. E. Hughes [Stud. Log. 49, No. 2, 175–181 (1990; Zbl 0719.03010)]. Although the axioms generated by such schemata are in general not Sahlqvist, nor even inductive [see V. Goranko and D. Vakarelov, Ann. Pure Appl. Logic 141, No. 1–2, 180–217 (2006; Zbl 1111.03018)], the authors show that the resulting logics are quasi-elementary, i.e., complete with respect to elementary classes of frames. Some particular examples related to McKinsey’s axiom are shown to be elementary and to have the finite model property.

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.

In this article we study interpolation properties for the minimal system of interpretability logic IL. We prove that arrow interpolation holds for IL and that turnstile interpolation and interpolation for the -modality easily follow from this result. Furthermore, these properties are extended to the system ILP. Failure of arrow interpolation for ILW is established by providing an explicit counterexample. The related issues of Beth de nability and xed points are also addressed. It will be shown that for a general class of logics the Beth property and the xed point property are interderivable. This in particular yields alternative proofs for the xed point theorem for IL (cf. de Jongh and Visser 1991) and the Beth theorem for all provability logics (cf. Maksimova 1989). Moreover, it entails that all extensions of IL have the Beth property.

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.

abstract. A logic LTD is defined, inspired by [37]. It is syntactically like basic modal,logic with an additional unary operator but it has an interval-based semantics on structures with arbitrary lin ear frames. � ,is interpreted as meaning,‘the current interval has a finite partition whose all members,satisfy .’ LTD is translatable into weak monadic,second- order logic but not into first-order logic. The expressive po wer and the decidability properties of LTD and its fragments are studied. Keywords: decidability, expressive power, interval tense logic, linear order,

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.

We consider multi-modal logics interpreted over edge-labelled graphs with a modality # , where # ϕ means 'ϕ is accessible by an edge with some label'. In a logic with finitely many edge labels, # is definable, but if the set of labels is infinite, it is an independent modality. We axiomatise multi-modal K, deterministic multi-modal K, and PDL with converse and a single nominal, extended with #. The latter gives an axiomatisation of the logic PDL path introduced in [3].

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.

We provide a detailed analysis of very weak fragments of modal logic. Our fragments lack connectives that introduce nondeterminism and they feature restrictions on the modal operators, which may lead to substantial reductions in complexity. Our main result is a general game-based characterization of the expressive power of our fragments over the class of finite structures.

In this paper, an educational software used to enhance the skills of children in the area of math is presented. This software has a tutor who guides the child in different activities. The tutor exhibits personality traits and emotions in its dialogue to create a sense of immersion in the student and catch his attention towards the game. We adapted an Emotional Extension of the Artificial Intelligence Markup Language, structure here named as EE-AIML.

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.

Detailed and expressive e-learning specifications like IMS LD [1] are necessary to create efficient e-learning applications. E-learning specifications that meet these demands tend to be long and detailed such that authoring e-learning content becomes a tedious and error-prone endeavour. This paper describes DBAT-LD (Dialogue-Based Authoring of Learning Designs) which is a document generating dialogue system (DGDS) that interacts with authors of units of learning and secures the content of the dialogue in an XML-based target format. In the case of IMS LD, DBAT-LD elicits an IMS LD compliant description of learning activities along with pedagogical support activities [2] and delivers a Unit of Learning package. DBAT-LD offers a lot of support (explanations, control questions, adaptation to the user) to ease authoring while strictly following the specification of IMS LD.

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.

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.