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…

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…

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…

Artificial Intelligence has long dealt with the issue of finding a suitable formalization for reasoning with incomplete and potentially inconsistent information. Defeasible argumentation [SL92,CML00,PraVre99] has proven to be a successful approach in many respects, since it naturally resembles many aspects…

El objetivo de esta investigación es el estudio de la problemática de inconsistencia que pueda aparecer en los Sistemas Basados en Conocimiento (SBC). Los SBC pueden ser clientes de muchas fuentes de información, y estas pueden contener información inconsistente al…