On Minimum Representations of Matched Formulas (Extended Abstract)
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10368723" target="_blank" >RIV/00216208:11320/17:10368723 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.24963/ijcai.2017/706" target="_blank" >http://dx.doi.org/10.24963/ijcai.2017/706</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.24963/ijcai.2017/706" target="_blank" >10.24963/ijcai.2017/706</a>
Alternative languages
Result language
angličtina
Original language name
On Minimum Representations of Matched Formulas (Extended Abstract)
Original language description
A Boolean formula in conjunctive normal form (CNF) is called matched if the system of sets of variables which appear in individual clauses has a system of distinct representatives. We present here two results for matched CNFs: The first result is a shorter and simpler proof of the fact that Boolean minimization remains complete for the second level of polynomial hierarchy even if the input is restricted to matched CNFs. The second result is structural - we show that if a Boolean function f admits a representation by a matched CNF then every clause minimum CNF representation of f is matched.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA15-15511S" target="_blank" >GA15-15511S: Boolean techniques in knowledge representation</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence
ISBN
978-0-9992411-0-3
ISSN
1045-0823
e-ISSN
neuvedeno
Number of pages
5
Pages from-to
4980-4984
Publisher name
International Joint Conferences on Artificial Intelligence
Place of publication
Australia
Event location
Melbourne; Australia
Event date
Aug 19, 2017
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—