From DQBF to QBF by Dependency Elimination

DSpace Repository

Show simple item record

dc.contributor.author Wimmer, Ralf
dc.contributor.author Karrenbauer, Andreas
dc.contributor.author Becker, Ruben
dc.contributor.author Scholl, Christoph
dc.contributor.author Becker, Bernd
dc.date.accessioned 2018-09-20T10:34:13Z
dc.date.available 2018-09-20T10:34:13Z
dc.date.issued 2018-03-13
dc.identifier.isbn 978-3-00-059317-8
dc.identifier.other 511151152
dc.identifier.uri http://hdl.handle.net/10900/84276
dc.identifier.uri http://nbn-resolving.de/urn:nbn:de:bsz:21-dspace-842764 de_DE
dc.identifier.uri http://dx.doi.org/10.15496/publikation-25666
dc.description.abstract Dependency quantified Boolean formulas (DQBFs) are a generalization of QBFs, which allows to have existential variables that depend on arbitrary subsets of the universal variables. We present an effective way to solve such DQBFs by eliminating individual dependencies such that an equisatisfiable QBF is obtained, which can be solved by an arbitrary QBF solver. We also present how to use dependency schemes in order to obtain smaller equisatisfiable QBFs, which can typically be solved more efficiently. en
dc.language.iso en de_DE
dc.publisher Universität Tübingen de_DE
dc.publisher Universität Tübingen de_DE
dc.rights ubt-podno de_DE
dc.rights.uri http://tobias-lib.uni-tuebingen.de/doku/lic_ohne_pod.php?la=de de_DE
dc.rights.uri http://tobias-lib.uni-tuebingen.de/doku/lic_ohne_pod.php?la=en en
dc.subject.classification Erfüllbarkeitsproblem de_DE
dc.subject.ddc 004 de_DE
dc.subject.other DQBF en
dc.subject.other Dependency Elimination en
dc.subject.other Solver en
dc.title From DQBF to QBF by Dependency Elimination en
dc.type ConferencePaper de_DE
utue.publikation.fachbereich Informatik de_DE
utue.publikation.fakultaet 7 Mathematisch-Naturwissenschaftliche Fakultät de_DE
utue.opus.portal mbmv2018 de_DE
utue.publikation.reiheohneschema MBMV 2018 de_DE

Dateien:

This item appears in the following Collection(s)

Show simple item record