The Prospect for Answer Sets Computation by a Genetic Model

We combine recent results from both Logic Programming and Genetic Algorithms to design a new method for the eflicent computation of Answer Sets of logic programs. First of all the problem is reduced to the problem of finding a suitable coloring on directed graphs. Then the problem of finding a suitable coloring is relaxed to a combinatorial optimization problem and solved (in an approximate way).by a continuous discrete time system derived by a genetic model.