Computing Skypattern Cubes

We introduce skypattern cubes and propose an efficient bottom-up approach to compute them. Our approach relies on derivation rules collecting skypatterns of a parent node from its child nodes without any dominance test. Non-derivable skypatterns are computed on the fly thanks to Dynamic CSP. The bottom-up principle enables to provide a concise representation of the cube based on skypattern equivalence classes without any supplementary effort. Experiments show the effectiveness of our proposal.

Authors

• Willy Ugarte
• Patrice Boizumault
• Samir Loudni
• Bruno Crémilleux

Keywords

No keywords are indexed for this paper.