WASP: A Native ASP Solver Based on Constraint Learning

This paper introduces WASP, an ASP solver handling disjunctive logic programs under the stable model semantics. WASP implements techniques originally introduced for SAT solving that have been extended to cope with ASP programs. Among them are restarts, conflict-driven constraint learning and backjumping. Moreover, WASP combines these SAT-based techniques with optimization methods that have been specifically designed for ASP computation, such as source pointers enhancing unfounded-sets computation, forward and backward inference operators based on atom support, and techniques for stable model checking. Concerning the branching heuristics, WASP adopts the BerkMin criterion hybridized with look-ahead techniques. The paper also reports on the results of experiments, in which WASP has been run on the system track of the third ASP Competition.

[1]  Eugene Goldberg,et al.  BerkMin: A Fast and Robust Sat-Solver , 2002, Discret. Appl. Math..

[2]  Mario Alviano,et al.  The Third Answer Set Programming Competition: Preliminary Report of the System Competition Track , 2011, LPNMR.

[3]  Bart Selman,et al.  Boosting Combinatorial Search Through Randomization , 1998, AAAI/IAAI.

[4]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[5]  Wolfgang Faber,et al.  Logic Programming and Nonmonotonic Reasoning , 2011, Lecture Notes in Computer Science.

[6]  Wolfgang Faber,et al.  A backjumping technique for Disjunctive Logic Programming , 2006, AI Commun..

[7]  Georg Gottlob,et al.  Disjunctive datalog , 1997, TODS.

[8]  John S. Schlipf,et al.  Answer Set Programming with Clause Learning , 2004, LPNMR.

[9]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[10]  Yuliya Lierler,et al.  Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs , 2004, LPNMR.

[11]  F. RICCA,et al.  Team-building with answer set programming in the Gioia-Tauro seaport , 2011, Theory and Practice of Logic Programming.

[12]  Gerald Pfeifer,et al.  Enhancing disjunctive logic programming systems by SAT checkers , 2003, Artif. Intell..

[13]  Wolfgang Faber,et al.  Pushing Goal Derivation in DLP Computations , 1999, LPNMR.

[14]  Martin Gebser,et al.  Tableau Calculi for Answer Set Programming , 2006, ICLP.

[15]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[16]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[17]  Nicola Leone,et al.  A Logic-Based System for e-Tourism , 2010, Fundam. Informaticae.

[18]  Klaus-Dieter Schewe,et al.  Transactions on Large-Scale Data- and Knowledge-Centered Systems V , 2012, Lecture Notes in Computer Science.

[19]  Nicola Leone,et al.  Some DLV Applications for Knowledge Management , 2009, LPNMR.

[20]  J. Gaschnig.  Performance measurement and analysis of certain search algorithms. , 1979 .

[21]  Martin Gebser,et al.  Conflict-Driven Answer Set Solving , 2007, IJCAI.

[22]  Rina Dechter,et al.  Propositional semantics for disjunctive logic programs , 1994, Annals of Mathematics and Artificial Intelligence.

[23]  Sharad Malik,et al.  Efficient conflict driven learning in a Boolean satisfiability solver , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[24]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[25]  Timo Soininen,et al.  Extending and implementing the stable model semantics , 2000, Artif. Intell..

[26]  David Zuckerman,et al.  Optimal speedup of Las Vegas algorithms , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[27]  Mario Alviano,et al.  The HiLeX System for Semantic Information Extraction , 2012, Trans. Large Scale Data Knowl. Centered Syst..

[28]  Mario Alviano,et al.  The Disjunctive Datalog System DLV , 2010, Datalog.