Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints
From MaRDI portal
Publication:5140015
DOI10.1017/S1471068420000368zbMath1468.68174arXiv2008.03100MaRDI QIDQ5140015
Gerhard Friedrich, Richard Taupe, Antonius Weinzierl
Publication date: 13 December 2020
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.03100
Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30) Logic programming (68N17)
Uses Software
Cites Work
- Unnamed Item
- Semantics and complexity of recursive aggregates in answer set programming
- Explanation-based generalisation \(=\) partial evaluation
- Conflict-driven answer set solving: from theory to practice
- Degrees of laziness in grounding. Effects of lazy-grounding strategies on ASP solving
- Blending lazy-grounding and CDNL search for answer-set solving
- The ASP system DLV2
- Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
- The Seventh Answer Set Programming Competition: Design and Results
- ASP-Core-2 Input Language Format
- Multi-shot ASP solving with clingo
This page was built for publication: Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints