The Prospect for Answer Sets Computation by a Genetic Model

Authors

A. Bertoni
G. Grossi
A. Provetti
Vladik Kreinovich, The University of Texas at El PasoFollow
L. Tari

Publication Date

1-2001

Comments

UTEP-CS-00-38a.

Published in Proceedings of 2001 AAAI Symposium on Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning, Stanford, CA, March 26-28, 2001, pp. 1-5.

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.