WASP: A Native ASP Solver Based on Constraint Learning

  • Mario Alviano
  • Carmine Dodaro
  • Wolfgang Faber
  • Nicola Leone
  • Francesco Ricca
Conference paper

DOI: 10.1007/978-3-642-40564-8_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8148)
Cite this paper as:
Alviano M., Dodaro C., Faber W., Leone N., Ricca F. (2013) WASP: A Native ASP Solver Based on Constraint Learning. In: Cabalar P., Son T.C. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2013. Lecture Notes in Computer Science, vol 8148. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Mario Alviano
    • 1
  • Carmine Dodaro
    • 1
  • Wolfgang Faber
    • 1
  • Nicola Leone
    • 1
  • Francesco Ricca
    • 1
  1. 1.Department of Mathematics and Computer ScienceUniversity of CalabriaRendeItaly

Personalised recommendations