Heuristics in Conflict Resolution

Computer Science – Artificial Intelligence

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-383462

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.