Sciweavers

Share
ASP
2005
Springer

A New Algorithm for Answer Set Computation

10 years 8 months ago
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∗
Giuliano Grossi, Massimo Marchi
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where ASP
Authors Giuliano Grossi, Massimo Marchi
Comments (0)
books