Cluster-Based ASP Solving with claspar [chapter]

Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub, Bettina Schnor
2011 Lecture Notes in Computer Science  
We report on three recent advances in the distributed ASP solver claspar. First, we describe its flexible architecture supporting various search strategies, including competitive search using a portfolio of solver configurations. Second, we describe claspar's distributed learning capacities that allow for sharing learned nogoods among solver instances. Finally, we discuss claspar's approach to distributed optimization. Advances in claspar We focus in what follows on the major novelties of the
more » ... rrent claspar version 0.9.0 wrt to the one in [1] . We presuppose some basic knowledge in conflict-driven ASP solving and an acquaintance with concepts like nogoods, decision levels, restarts, etc. The interested reader is referred to [2] for details. Search The simple master-worker architecture of claspar (0.1.0) has been extended in order to provide more flexible communication topologies for enhancing claspar's scalability as
doi:10.1007/978-3-642-20895-9_42 fatcat:furirniqdneo7ellc3jcsuuxye