When using tableaux algorithms to reason about Description Logics (DLs), new information is inferred from the models considered while trying to achieve knowledge satisfiability. By focusing the ontology change problem, we consider an environment where DLs are the logical formalization…

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…