Treffer: Towards an integration of answer set and constraint solving

Title:
Towards an integration of answer set and constraint solving
Authors:
BASELICE, S, BONATTI, P. A, GELFOND, M
Source:
Logic programming (21st international conference, ICLP 2005, Sitges, Spain, October 2-5, 2005, proceedings)Lecture notes in computer science. :52-66
Publisher Information:
New York, NY: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 21 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie programmation, Programming theory, Programmation logique avec contrainte, Constraint logic programming, Programación lógica con restricción, Raisonnement, Reasoning, Razonamiento, Représentation connaissance, Knowledge representation, Representación conocimientos, Résolution problème, Problem solving, Resolución problema, Satisfaction contrainte, Constraint satisfaction, Satisfaccion restricción, Contrainte ensembliste, Set constraint, Constreñimiento conjunto, Programmation ensemble réponse
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Università di Napoli Federico II, Italy
Texas Tech University, United States
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=17246989
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17246989
Database:
PASCAL Archive

Weitere Informationen

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.