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.

URL:
http://rewerse.net/publications/rewerse-publications.html#REWERSE-RP-2005-138

BibTeX:

@inproceedings{REWERSE-RP-2005-138,
	author = {Sabrina Baselice and Piero A. Bonatti and Michael Gelfond},
	title = {Towards an Integration of Answer Set and Constraint Solving},
	booktitle = {Proceedings of 21st International Conference on Logic Programming, Sitges (Barcelona), Spain (2nd--5th October 2005)},
	year = {2005},
	volume = {3668},
	organization = {Association for Logic Programming},
	series = {LNCS},
	pages = {52--66},
	url = {http://rewerse.net/publications/rewerse-publications.html#REWERSE-RP-2005-138}
}