Decompositions of Grammar Constraints

Details Decompositions of Grammar Constraints Decompositions of Grammar Constraints

2009-03-03

arxiv.org/abs/0903.0470v1

AAAI 2008: 1567-1570

Computer Science

Artificial Intelligence

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence

Scientific paper

A wide range of constraints can be compactly specified using automata or formal languages. In a sequence of recent papers, we have shown that an effective means to reason with such specifications is to decompose them into primitive constraints. We can then, for instance, use state of the art SAT solvers and profit from their advanced features like fast unit propagation, clause learning, and conflict-based search heuristics. This approach holds promise for solving combinatorial problems in scheduling, rostering, and configuration, as well as problems in more diverse areas like bioinformatics, software testing and natural language processing. In addition, decomposition may be an effective method to propagate other global constraints.

Affiliated with

Also associated with

No associations

Rating

Decompositions of Grammar Constraints 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 Decompositions of Grammar Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decompositions of Grammar Constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-652857