Dualization on Partially Ordered Sets: Preliminary Results

Abstract : 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.
Document type :
Book sections
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01229022
Contributor : Jean Marc Petit <>
Submitted on : Monday, November 16, 2015 - 10:16:47 AM
Last modification on : Tuesday, February 26, 2019 - 4:07:31 PM
Long-term archiving on : Saturday, April 29, 2017 - 12:36:51 AM

File

2014 ISIP Post Proceeding.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01229022, version 1

Citation

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⟩

Share

Metrics

Record views

450

Files downloads

178