Sciweavers

Share
ASP
2005
Springer

An Experimental Study of Search Strategies and Heuristics in Answer Set Programming

10 years 8 months ago
An Experimental Study of Search Strategies and Heuristics in Answer Set Programming
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”, the main search procedures used by ASP and SAT systems are equivalent, i.e., that they explore search trees with the same branching nodes. In this paper, we focus on the experimental evaluation of different search strategies, heuristics and their combinations that have been shown to be effective in the SAT community, in ASP systems. Our results show that, despite the strong link between ASP and SAT, it is not always the case that search strategies, heuristics and/or their combinations that currently dominate in SAT are also bound to dominate in ASP. We provide a detailed experimental evaluation for this phenomenon and we shed light on future development of efficient Answer Set solvers.
Enrico Giunchiglia, Marco Maratea
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where ASP
Authors Enrico Giunchiglia, Marco Maratea
Comments (0)
books