2 research outputs found
Aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming
Encoding finite linear CSPs as Boolean formulas and solving them by using
modern SAT solvers has proven to be highly effective, as exemplified by the
award-winning sugar system. We here develop an alternative approach based on
ASP. This allows us to use first-order encodings providing us with a high
degree of flexibility for easy experimentation with different implementations.
The resulting system aspartame re-uses parts of sugar for parsing and
normalizing CSPs. The obtained set of facts is then combined with an ASP
encoding that can be grounded and solved by off-the-shelf ASP systems. We
establish the competitiveness of our approach by empirically contrasting
aspartame and sugar.Comment: Proceedings of Answer Set Programming and Other Computing Paradigms
(ASPOCP 2013), 6th International Workshop, August 25, 2013, Istanbul, Turke
New Covering Array Numbers
A covering array CA(N; t; k; v) is an N x k array on v symbols such that
every N x t subarray contains as a row each t-tuple over the v symbols at least
once. The minimum N for which a CA(N; t; k; v) exists is called the covering
array number of t, k, and v, and it is denoted by CAN(t; k; v). In this work we
prove new CANs using an optimized procedure.Comment: UNSUBMITTE