Symmetry-breaking Answer Set Solving

Details Symmetry-breaking Answer Set Solving Symmetry-breaking Answer Set Solving

2010-08-10

arxiv.org/abs/1008.1809v1

Computer Science

Logic in Computer Science

Proceedings of ICLP'10 Workshop on Answer Set Programming and Other Computing Paradigm

Scientific paper

In the context of Answer Set Programming, this paper investigates symmetry-breaking to eliminate symmetric parts of the search space and, thereby, simplify the solution process. We propose a reduction of disjunctive logic programs to a coloured digraph such that permutational symmetries can be constructed from graph automorphisms. Symmetries are then broken by introducing symmetry-breaking constraints. For this purpose, we formulate a preprocessor that integrates a graph automorphism system. Experiments demonstrate its computational impact.

Affiliated with

Also associated with

No associations

Rating

Symmetry-breaking Answer Set Solving 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 Symmetry-breaking Answer Set Solving, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Symmetry-breaking Answer Set Solving will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-479347