Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

19

ASP
2005
Springer

favoriteEmaildiscussreport

244views Automated Reasoning» more ASP 2005»

A New Algorithm for Answer Set Computation

13 years 10 months ago

A New Algorithm for Answer Set Computation

Download sunsite.informatik.rwth-aachen.de

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

Real-time Traffic

Answer Sets | Artificial Intelligence | ASP 2005 | Kernel Normal Form | Logic Program |

claim paper

Related Content

» A SATbased polynomial space algorithm for answer set programming

» Constraint Answer Set Solving

» New Algorithms for Efficient HighDimensional Nonparametric Classification

» Computing Minimal Models Stable Models and Answer Sets

» ASSAT computing answer sets of a logic program by SAT solvers

» IWTrust Improving User Trust in Answers from the Web

» A new algorithmic approach to the computation of Minkowski functionals of polyconvex sets

» Translating Preferred Answer Set Programs to Propositional Logic

» An Interactive Approach to Answer Set Programming

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	ASP
Authors	Giuliano Grossi, Massimo Marchi

Comments (0)