Generating Models of a Matched Formula With a Polynomial Delay (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%3A10368717" target="_blank" >RIV/00216208:11320/17:10368717 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.24963/ijcai.2017/721" target="_blank" >http://dx.doi.org/10.24963/ijcai.2017/721</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.24963/ijcai.2017/721" target="_blank" >10.24963/ijcai.2017/721</a>
Alternative languages
Result language
angličtina
Original language name
Generating Models of a Matched Formula With a Polynomial Delay (Extended Abstract)
Original language description
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.
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
Result was created during the realization of more than one project. More information in the Projects tab.
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
5055-5059
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
—