A New Algorithm for Answer Set Computation

A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its answer sets by reducing the problem to a suitable version of graph colorability. Even though worst-case complexity is exponential, thanks to a straightforward formulation we can prove that the algorithm works in time O∗

• Type: Conference
• Year: 2005
• Where: ASP
• Authors: Giuliano Grossi, Massimo Marchi
• Keywords: Answer Sets, Artificial Intelligence, ASP 2005, Kernel Normal Form, Logic Program