Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

MATH, COMPUTERS.

Publikováno v: SciTech Book News. Sep2010, Vol. 34 Issue 3, p11-31. 21p.

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Computing Smallest MUSes of Quantified Boolean Formulas

Autor: Andreas Niskanen, Jere Mustonen, Jeremias Berg, Matti Järvisalo

Publikováno v: Logic Programming and Nonmonotonic Reasoning ISBN: 9783031157066

Computing small (subset-minimal or smallest) explanations is a computationally challenging task for various logics and non-monotonic formalisms. Arguably the most progress in practical algorithms for computing explanations has been made for propositi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3a905bcab415a490d11d26373af5947d
https://doi.org/10.1007/978-3-031-15707-3_23

Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF

Autor: Leroy Chew, Martin Suda, Olaf Beyersdorff, Renate A. Schmidt, Joshua Blinkhorn

Publikováno v: Journal of Automated Reasoning
Beyersdorff, O, Blinkhorn, J, Leroy Chew,, Schmidt, R & Suda, M 2018, ' Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF ', Journal of Automated Reasoning, vol. 63, no. 0, pp. 597–623 . https://doi.org/10.1007/s10817-018-9482-4

Dependency quantified Boolean formulas (DQBF) and QBF dependency schemes have been treated separately in the literature, even though both treatments extend QBF by replacing the linear order of the quantifier prefix with a partial order. We propose to

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8509660fc28ae645a8cfd3a2a3d7abc2
http://europepmc.org/articles/PMC6710225