A solution of problems in multiagent systems involves representing beliefs of agents immersed in dynamic environments. Observation-based Defeasible Logic Programming (ODeLP) is an argument-based logic programming language that is used to represent an agent’s knowledge in the context of a…

Descoberta de Conhecimento em Bases de Dados" ("Knowledge Discovery in Databases", KDD) é um processo composto de várias fases iniciando com a coleta de dados para o problema e finalizando com a avaliação dos resultados finais. Este trabalho objetiva mostrar…

In the last decade several ways to formalize defeasible reasoning have been studied. A particular approach, defeasible argumentation, has been particularly successful to achieve this goal.
The inference process of argument-based systems is based on the interaction of ar- guments…

The aim of this work is to analyze the knowledge interchange on multi-agent systems using shared knowledge areas. The project involves the analysis and reformulation of some aspects of the Linda model, adding new model level features. This work proposes…

Most of the search engines available over the Web are based on mathematical approaches | classical techniques in the Information Retrieval area. Thereby, they are suitable for the retrieval of documents containing some or all the terms of a query,…

El desarrollo alcanzado en los últimos años por las Tecnologías de Información y Comunicaciones (TICs) ha creado condiciones materiales y técnicas necesarias para una nueva revolución en el campo educativo. Asociado a estos cambios, el aprendizaje electrónico a través de…

In logic programs, negation-as-failure has been used both for representing negative information and for providing default nonmonotonic inference. In this paper we argue that this twofold role is not only unnecessary for the expressiveness of the language, but it also…

The notion of context and its importance in knowledge representation and nonmonotonic reasoning was first discussed in Artificial Intelligence by John McCarthy.
Ever since, contexts have found many applications in developing knowledge-based reasoning systems.
Defeasible argumentation has gained wide acceptance…

The problem of speeding up ínference has proved to be important in argumentative systems. When computing dialectical structures, several paths are searched (called argumentation lines), many of which will eventually prove useless. Morover, the performance of backward chainers degrades quickly…

En [2] Gerhard Brewka realizó una reconstrucción de la Teoría de Disputación Formal de Nicholas Rescher [5]. En su trabajo, Brewka completó la formalización de la presentación de Dialectics:
A Controversy-Oriented Approach to the Theory 01 Knowledge. El formalismo no..monótono…