首页    期刊浏览 2025年07月08日 星期二
登录注册

文章基本信息

  • 标题:Answer Set Solving with Generalized Learned Constraints
  • 本地全文:下载
  • 作者:Martin Gebser ; Roland Kaminski ; Benjamin Kaufmann
  • 期刊名称:OASIcs : OpenAccess Series in Informatics
  • 电子版ISSN:2190-6807
  • 出版年度:2016
  • 卷号:52
  • 页码:1-15
  • DOI:10.4230/OASIcs.ICLP.2016.9
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要: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.
  • 关键词:Answer Set Programming; Conflict Learning; Constraint Generalization; Generalized Constraint Feedback
国家哲学社会科学文献中心版权所有