Decompositions of Grammar Constraints
| dc.creator | Quimper, Claude-Guy | |
| dc.creator | Walsh, Toby | |
| dc.date | 2009-03-03 | |
| dc.date.accessioned | 2026-07-07T12:48:37Z | |
| dc.date.available | 2026-07-07T12:48:37Z | |
| dc.description | 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. | |
| dc.description | Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence | |
| dc.identifier | https://arxiv.org/abs/0903.0470 | |
| dc.identifier | http://arxiv.org/abs/0903.0470 | |
| dc.identifier | AAAI 2008: 1567-1570 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/222117 | |
| dc.subject | Artificial Intelligence | |
| dc.subject | Formal Languages and Automata Theory | |
| dc.subject | I.2.4 | |
| dc.title | Decompositions of Grammar Constraints | |
| dc.type | text |