Weighted-sequence problem: ASP vs CASP and declarative vs problem-oriented solving

Yuliya Lierler, Shaden Smith, Miroslaw Truszczynski, Alex Westlund

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Scopus citations

Abstract

Search problems with large variable domains pose a challenge to current answer-set programming (ASP) systems as large variable domains make grounding take a long time, and lead to large ground theories that may make solving infeasible. To circumvent the "grounding bottleneck" researchers proposed to integrate constraint solving techniques with ASP in an approach called constraint ASP (CASP). In the paper, we evaluate an ASP system clingo and a CASP system clingcon on a handcrafted problem involving large integer domains that is patterned after the database task of determining the optimal join order. We find that search methods used by clingo are superior to those used by clingcon, yet the latter system, not hampered by grounding, scales up better. The paper provides evidence that gains in solver technology can be obtained by further research on integrating ASP and CSP technologies.

Original languageEnglish
Title of host publicationPractical Aspects of Declarative Languages - 14th International Symposium, PADL 2012, Proceedings
Pages63-77
Number of pages15
DOIs
StatePublished - 2012
Event14th International Symposium on Practical Aspects of Declarative Languages, PADL 2012 - Philadelphia, PA, United States
Duration: Jan 23 2012Jan 24 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7149 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th International Symposium on Practical Aspects of Declarative Languages, PADL 2012
Country/TerritoryUnited States
CityPhiladelphia, PA
Period1/23/121/24/12

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Weighted-sequence problem: ASP vs CASP and declarative vs problem-oriented solving'. Together they form a unique fingerprint.

Cite this