In this article we present a generalized dynamic argumentation framework that handles arguments expressed in an abstract language assumed to be some first order logic fragment. Once the formalism is presented, we propose a reification to the description logic ALC…

Robots have become usual collaborators in our daily life. While robotic systems grow to be more and more complex, the need to engineering their software development process grows as well. Traditional approaches that are used in the development process of…

Knowledge acquisition for systems based on knowledge can be called knowledge engineering, according to Feigenbaum (1980) who used the term to describe the reduction of a wide context of knowledge for a set of facts and rules. The term Knowledge…

Knowledge-intensive processes are widely used to recover from errors, handle exceptional cases and complaints, and to improve or adapt a process itself. In this context, evolved Business-Process Reengineering (BPR) techniques are changing to give some answers to this reality. In…

In the restricted single-machine common due date problem the goal is to find a schedule for the n jobs which jointly minimizes the sum of earliness and tardiness penalties, while for the weighted tardiness problem the goal is to find…

The goal of this work involves the developing of an argumentation-based formalism that an agent could use for constructing plans. In this formalism, agents will have certain knowledge about the world, and a set of actions that they will be…

Instruction may be seen as the intentional creation of conditions around learning so as to facilitate the achievement of determined goals. Normally, instruction is based upon certain educational strategies. It is well accepted in the field of educational technology that…

In the last decade, several argument-based formalisms have emerged, with application in many areas, such as legal reasoning, autonomous agents and multi-agent systems; many are based on Dung’s seminal work characterizing Abstract Argumentation Frameworks (AF).
Recent research in the area…

Determining an optimal schedule to minimize the completion time of the last job abandoning the system (makespan) becomes a very difficult problem when there are more than two machines in the flow shop. Due both to its economical impact and…

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