Teachers must be able to adapt to a rapidly changing IT knowledge and technology. This requirement is further compounded by the need that this knowledge and technology be incorporated in the curriculum at the same rate.
This paper presents a…

While entertainment web forums provide a dynamic medium for interaction, not many researchers feel the need to go deeply into the contents.
One of the reasons behind this attitude lies on a widely perceived assumption that web forums do not…

The accomplishment of systems with abilities to reason about actions and change and systems that can manage incomplete or not very reliable information with abilities to discuss or argument has been of great importance for artificial intelligence community. These two…

In order to deal with the Ontology Change problem and considering an environment where Description Logics (DLs) are used to describe ontologies, the question of how to integrate distributed ontologies appears to be in touch with Belief Revision since DL…

This paper introduces an automatic procedure to assist on the interpretation of a large dataset when a similarity metric is available.
We propose a visualization approach based on a graph layout method- ology that uses a Quadratic Assignment Problem (QAP)…

Frequently we become amazed with the increasing number of problems to be solved that fiourish while facing daily activities. Often, related to these problems we llave also an incredible amount oí data. Since we cannot allways afford time and resources…

Little has been written about the component provision problem (programming plans and domain concepts) for the repositories of knowledge in program understanding systems and reports that specifically address this issue are unknown. Model-driven and plan-driven approaches use repositories where construction…

In this paper, we build on previous work on Belief Revision operators based on the use of logic programming with Answer Set semantics as a representation language. We present a set of postulates for Answer Set Revision with respect to…

Defeasible Logic Programming (DeLP) is a knowledge representation and reasoning formalism that by combining Logic Programming with Defeasible Argumentation is able to represent incomplete and potentially contradictory information.
Within the field of Logic Programming, most of the implementations of Prolog…

The matrix connection method (MCM) is an alternative procedure for theorem proving than the usual resolution technique. We already have used the MCM for finding models in a real-time knowledge-based system generator. In this paper, we adapt the MCM to…