We are very excited to join forces with MLCommons and OctoML.ai! Contact Grigori Fursin for more details!

Aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming

lib:411ba6f080ec9ebc (v1.0.0)

Authors: Mutsunori Banbara,Martin Gebser,Katsumi Inoue,Torsten Schaub,Takehide Soh,Naoyuki Tamura,Matthias Weise
ArXiv: 1312.6113
Document:  PDF  DOI 
Abstract URL: http://arxiv.org/abs/1312.6113v1


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.

Relevant initiatives  

Related knowledge about this paper Reproduced results (crowd-benchmarking and competitions) Artifact and reproducibility checklists Common formats for research projects and shared artifacts Reproducibility initiatives

Comments  

Please log in to add your comments!
If you notice any inapropriate content that should not be here, please report us as soon as possible and we will try to remove it within 48 hours!