The Prospect for Answer Sets Computation by a Genetic Model

Abstract

We combine recent results from both Logic Programming and Genetic Algorithms to design a new method for the efficent 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

Similar works

Full text

thumbnail-image

DigitalCommons@UTEP

Full text is not available
oai:scholarworks.utep.edu:cs_techrep-1500Last time updated on 3/18/2020

This paper was published in DigitalCommons@UTEP.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.