Dualization on Partially Ordered Sets: Preliminary Results - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2015

Dualization on Partially Ordered Sets: Preliminary Results

Résumé

The dualization problem on arbitrary posets is a crucial step in many applications in logics, databases, artificial intelligence and pattern mining. The objective of this paper is to study reductions of the dualization problem on arbitrary posets to the dualization problem on boolean lattices, for which output quasi-polynomial time algorithms exist. We introduce convex embedding and poset reflection as key notions to characterize such reductions. As a consequence, we identify posets, which are not boolean lattices, for which the dualization problem remains quasi-polynomial and propose a classification of posets with respect to dualization. As far as we know, this is the first contribution to explicit non-trivial reductions for studying the hardness of dualization problems on arbitrary posets.
Fichier principal
Vignette du fichier
2014 ISIP Post Proceeding.pdf (1018.12 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01229022 , version 1 (16-11-2015)

Identifiants

  • HAL Id : hal-01229022 , version 1

Citer

Lhouari Nourine, Jean-Marc Petit. Dualization on Partially Ordered Sets: Preliminary Results. Communications in Computer and Information Science, Springer, pp.23-34, 2015, International Workshop, ISIP 2014, Kuala Lumpur, Malaysia, October 11-13, 2014. Revised Selected Papers. ⟨hal-01229022⟩
289 Consultations
200 Téléchargements

Partager

Gmail Facebook X LinkedIn More