31 search results - page 1 / 7 » Reformulating Global Grammar Constraints |
CPAIOR
2009
Springer
13 years 11 months ago
2009
Springer
An attractive mechanism to specify global constraints in rostering and other domains is via formal languages. For instance, the REGULAR and GRAMMAR constraints specify constraints ...
CP
2009
Springer
14 years 5 months ago
2009
Springer
We investigate the global GRAMMAR constraint over restricted classes of context free grammars like deterministic and unambiguous context-free grammars. We show that detecting disen...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
We show that global constraints on finite domains like alldifferent can be reformulated into answer set programs on which we achieve arc, bound or range consistency. These reform...
ICDT
2003
ACM
13 years 10 months ago
2003
ACM
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...
IJCAI
2007
13 years 6 months ago
2007
Finding a constraint network that will be efficiently solved by a constraint solver requires a strong expertise in Constraint Programming. Hence, there is an increasing interest i...