Towards an Integration of Answer Set and Constraint Solving

  • S. Baselice
  • P. A. Bonatti
  • M. Gelfond
Conference paper

DOI: 10.1007/11562931_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3668)
Cite this paper as:
Baselice S., Bonatti P.A., Gelfond M. (2005) Towards an Integration of Answer Set and Constraint Solving. In: Gabbrielli M., Gupta G. (eds) Logic Programming. ICLP 2005. Lecture Notes in Computer Science, vol 3668. Springer, Berlin, Heidelberg

Abstract

Answer set programming (ASP for short) is a declarative problem solving framework that has been recently attracting the attention of researchers for its expressiveness and for its well-engineered and optimized implementations. Still, state-of-the-art answer set solvers have huge memory requirements, because the ground instantiation of the input program must be computed before the actual reasoning starts. This prevents ASP to be effective on several classes of problems. In this paper we integrate answer set generation and constraint solving to reduce the memory requirements for a class of multi-sorted logic programs with cardinality constraints. We prove some theoretical results, introduce a provably sound and complete algorithm, and report experimental results showing that our approach can solve problem instances with significantly larger domains.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • S. Baselice
    • 1
  • P. A. Bonatti
    • 1
  • M. Gelfond
    • 2
  1. 1.Università di Napoli Federico II 
  2. 2.Texas Tech University 

Personalised recommendations