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…

Evolutionary algorithms (EAs) are merely blind search algorithms, which only make use of the relative fitness of solutions, but completely ignore the nature of the problem. Their performance can be improved by using new multirecombinative approaches, which provide a good…

Knowledge representation models are very important in the design of intelligent agents because they provide with mechanisms to manage beliefs and their dynamics. In this paper, we propose the use of AnsProlog* as a knowledge representation language, and develop a…

In this work we present an approach to model an action-oriented system controlled by BDI agents using a defeasible argumentation formalism to represent its knowledge. Here, our main concern will be modelling the software agents that drive the physical robots.

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…

Our research project intends to build knowledge about HPC problems to be able to help local researchers. In the general case, researchers who consult us do not own the sources to the parallel programs they run. In order to advise…

Ontology integration is the problem of combining data sources in the SemanticWeb. Concepts in source ontologies are captured in terms of concepts de ned in a global ontology. When some of these ontologies are inconsistent, the knowledge engineer often has…

Nowadays, data intensive applications are in constant demand and there is need of computing environments with better intelligent capabilities than those present in today's Database Management Systems (DBMS). To build such systems we need formalisms that can perform complicate inferences,…

Defeasible Logic Programming (DeLP) is a knowledge representation formalism that combines results from Logic Programming and Defeasible Argumentation to provide reasoning based on contradictory and potentially incomplete information. DeLP allows information representation by using weak rules and provides an argumentation…

This paper addresses the problem of contour line extraction from scanned topographic maps in poor condition. A novel method is developed, using knowledge of cartography and graphics to extract contours by removing other layers which overlay the contours, and reconstructing…