Počet záznamů: 1
Generating Models of a Matched Formula With a Polynomial Delay (Extended Abstract)
- 1.
SYSNO ASEP 0480888 Druh ASEP C - Konferenční příspěvek (mezinárodní konf.) Zařazení RIV Záznam nebyl označen do RIV Název Generating Models of a Matched Formula With a Polynomial Delay (Extended Abstract) Tvůrce(i) Savický, Petr (UIVT-O) SAI, RID, ORCID
Kučera, P. (CZ)Zdroj.dok. Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. - Freiburg : IJCAI, 2017 / Sierra C. - ISBN 978-0-9992411-0-3 Rozsah stran s. 5055-5059 Poč.str. 5 s. Forma vydání Online - E Akce IJCAI 2017. International Joint Conference on Artificial Intelligence /26./ Datum konání 19.08.2017 - 25.08.2017 Místo konání Melbourne Země AU - Austrálie Typ akce WRD Jazyk dok. eng - angličtina Země vyd. DE - Německo Klíč. slova conjunctive normal form ; matched formula ; pure literal satisfiable formula Vědní obor RIV BA - Obecná matematika CEP GBP202/12/G061 GA ČR - Grantová agentura ČR Institucionální podpora UIVT-O - RVO:67985807 EID SCOPUS 85031938657 DOI 10.24963/ijcai.2017/721 Anotace A matched formula is a CNF formula whose incidence graph admits a matching which matches a distinct variable to every clause. Such a formula is always satisfiable. Matched formulas are used, for example, in the area of parameterized complexity. We prove that the problem of counting the number of the models (satisfying assignments) of a matched formula is # P-complete. On the other hand, we define a class of formulas generalizing the matched formulas and prove that for a formula in this class one can choose in polynomial time a variable suitable for splitting the tree for the search of the models of the formula. As a consequence, the models of a formula from this class, in particular of any matched formula, can be generated sequentially with a delay polynomial in the size of the input. On the other hand, we prove that this task cannot be performed efficiently for linearly satisfiable formulas, which is a generalization of matched formulas containing the class considered above. Pracoviště Ústav informatiky Kontakt Tereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800 Rok sběru 2018
Počet záznamů: 1