We show that smodels, a solver originally designed to solve search problems encoded as logic programs can be used as a pseudo-boolean solver (we call it PB-smodels). We compare the performance of PB-smodels with pseudo-boolean solvers MiniSat+ and Pueblo on two benchmarks. We show that in many cases PB-smodels performs better than or is comparable to other solvers.

Subjects: 15.2 Constraint Satisfaction; 11. Knowledge Representation

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.