On implicational bases of closure systems with unique critical sets release_dunrrolubfd7xl333b2ugcwqj4

by Kira Adaricheva, J.B. Nation

Released as a article .

2013  

Abstract

We show that every optimum basis of a finite closure system, in D.Maier's sense, is also right-side optimum, which is a parameter of a minimum CNF representation of a Horn Boolean function. New parameters for the size of the binary part are also established. We introduce a K-basis of a general closure system, which is a refinement of the canonical basis of Duquenne and Guigues, and discuss a polynomial algorithm to obtain it. We study closure systems with the unique criticals and some of its subclasses, where the K-basis is unique. A further refinement in the form of the E-basis is possible for closure systems without D-cycles. There is a polynomial algorithm to recognize the D-relation from a K-basis. Thus, closure systems without D-cycles can be effectively recognized. While E-basis achieves an optimum in one of its parts, the optimization of the others is an NP-complete problem.
In text/plain format

Archived Files and Locations

application/pdf  488.4 kB
file_fpyptw6s2ve4lb47wambmvpsfu
arxiv.org (repository)
web.archive.org (webarchive)
application/pdf  488.4 kB
file_gohonoskuzapjn5f3wbfkdqlrq
archive.org (archive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   accepted
Date   2013-01-28
Version   v2
Language   en ?
arXiv  1205.2881v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 4b26be84-6dcd-4015-a1fe-d38ab8d15c2b
API URL: JSON