Content: Publications

Answer Set Solving with Generalized Learned Constraints

In Proc. Technical Communications of the Thirty-second International Conference on Logic Programming (ICLP'16)

Authors:Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Patrick Lühne , Torsten Schaub
Type:Article in Conference Proceedings
Publication Date:October 2016
Conference:Technical Communications of the Thirty-second International Conference on Logic Programming (ICLP'16)

Abstract: Conflict learning plays a key role in modern Boolean constraint solving. Advanced in satisfiability testing, it has meanwhile become a base technology in many neighboring fields, among them answer set programming (ASP). However, learned constraints are only valid for a currently solved problem instance and do not carry over to similar instances. We address this issue in ASP and introduce a framework featuring an integrated feedback loop that allows for reusing conflict constraints. The idea is to extract (propositional) conflict constraints, generalize and validate them, and reuse them as integrity constraints. Although we explore our approach in the context of dynamic applications based on transition systems, it is driven by the ultimate objective of overcoming the issue that learned knowledge is bound to specific problem instances. We implemented this workflow in two systems, namely, a variant of the ASP solver clasp that extracts integrity constraints along with a downstream system for generalizing and validating them.

BibTeX
@InProceedings{gekakalurosc16a-2016,
  title =	{{Answer Set Solving with Generalized Learned Constraints}},
  author =	{Martin Gebser and Roland Kaminski and Benjamin Kaufmann and Patrick Lühne  and Torsten Schaub},
  booktitle =	{Proc. of Technical Communications of the Thirty-second International Conference on Logic Programming (ICLP'16)},
  year =	{2016},
}