Comparing Alternative Solutions for Unfounded Set Propagation in ASP

  • Mario Alviano
  • Carmine Dodaro
  • Francesco Ricca
Conference paper

DOI: 10.1007/978-3-319-03524-6_1

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8249)
Cite this paper as:
Alviano M., Dodaro C., Ricca F. (2013) Comparing Alternative Solutions for Unfounded Set Propagation in ASP. In: Baldoni M., Baroglio C., Boella G., Micalizio R. (eds) AI*IA 2013: Advances in Artificial Intelligence. AI*IA 2013. Lecture Notes in Computer Science, vol 8249. Springer, Cham

Abstract

Answer Set Programming (ASP) is a logic programming language for nonmonotonic reasoning. Propositional ASP programs are usually evaluated by DPLL algorithms combining unit propagation with operators that are specific of ASP. Among them, unfounded set propagation is used for handling recursive programs by many ASP solvers. This paper reports a comparison of two available solutions for unfounded set propagation, the one adopted in DLV and that based on source pointers. The paper also discusses the impact of splitting the input program in components according to head-to-body dependencies. Both solutions and variants have been implemented in the same solver, namely WASP. An advantage in properly splitting the program in components is highlighted by an experiment on a selection of problems taken from the 3rd ASP Competition. In this experiment the algorithm based on source pointers performs better.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

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

Personalised recommendations