Computer Science – Artificial Intelligence
Scientific paper
2010-05-11
Proceedings of the Twelfth International Workshop on Nonmonotonic Reasoning (2008) 141-149
Computer Science
Artificial Intelligence
Scientific paper
Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming (ASP) are based on sophisticated Boolean constraint solving techniques. In both areas, conflict-driven learning and related techniques constitute key features whose application is enabled by conflict analysis. Although various conflict analysis schemes have been proposed, implemented, and studied both theoretically and practically in the SAT area, the heuristic aspects involved in conflict analysis have not yet received much attention. Assuming a fixed conflict analysis scheme, we address the open question of how to identify "good'' reasons for conflicts, and we investigate several heuristics for conflict analysis in ASP solving. To our knowledge, a systematic study like ours has not yet been performed in the SAT area, thus, it might be beneficial for both the field of ASP as well as the one of SAT solving.
Drescher Christian
Gebser Martin
Kaufmann Benjamin
Schaub Torsten
No associations
LandOfFree
Heuristics in Conflict Resolution does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Heuristics in Conflict Resolution, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Heuristics in Conflict Resolution will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-383462