Adaptation in a CBR-based solver portfolio for the satisfiability problem

Research output: Chapter in Book/Report/Conference proceedingsConference proceedingpeer-review

Abstract

The satisfiability problem was amongst the very first problems proven to be NP-Complete. It arises in many real world domains such as hardware verification, planning, scheduling, configuration and telecommunications. Recently, there has been growing interest in using portfolios of solvers for this problem. In this paper we present a case-based reasoning approach to SAT solving. A key challenge is the adaptation phase, which we focus on in some depth. We present a variety of adaptation approaches, some heuristic, and one that computes an optimal Kemeny ranking over solvers in our portfolio. Our evaluation over three large case bases of problem instances from artificial, hand-crafted and industrial domains, shows the power of a CBR approach, and the importance of the adaptation schemes used.

Original languageEnglish
Title of host publicationCase-Based Reasoning Research and Development - 20th International Conference, ICCBR 2012, Proceedings
Pages152-166
Number of pages15
DOIs
Publication statusPublished - 2012
Event20th International Conference on Case-Based Reasoning, ICCBR 2012 - Lyon, France
Duration: 3 Sep 20126 Sep 2012

Publication series

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

Conference

Conference20th International Conference on Case-Based Reasoning, ICCBR 2012
Country/TerritoryFrance
CityLyon
Period3/09/126/09/12

Fingerprint

Dive into the research topics of 'Adaptation in a CBR-based solver portfolio for the satisfiability problem'. Together they form a unique fingerprint.

Cite this