Portfolio-Based Algorithm Selection for Circuit QBFs (bibtex)
by Holger H. Hoos, Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider
Abstract:
Quantified Boolean Formulas (QBFs) are a generalization of propositional formulae that admits succinct encodings of verification and synthesis problems. Given that modern QBF solvers are based on different architectures with complementary performance characteristics, a portfolio-based approach to QBF solving is particularly promising.
Reference:
Portfolio-Based Algorithm Selection for Circuit QBFsHolger H. Hoos, Tomáš Peitl, Friedrich Slivovsky, Stefan SzeiderPrinciples and Practice of Constraint Programming (John Hooker, ed.), pages 195–209, 2018, Springer International Publishing.
Bibtex Entry:
@InProceedings{HoosPeitlSlivovskySzeider18,
    author="Hoos, Holger H.
            and Peitl, Tom{\'a}{\v{s}}
            and Slivovsky, Friedrich
            and Szeider, Stefan",
    editor="Hooker, John",
    title="Portfolio-Based Algorithm Selection for Circuit QBFs",
    booktitle="Principles and Practice of Constraint Programming",
    year="2018",
    publisher="Springer International Publishing",
    address="Cham",
    pages="195--209",
    abstract="Quantified Boolean Formulas (QBFs) are a generalization of propositional formulae that admits succinct encodings of verification and synthesis problems. Given that modern QBF solvers are based on different architectures with complementary performance characteristics, a portfolio-based approach to QBF solving is particularly promising.",
    isbn="978-3-319-98334-9",
    doi="https://doi.org/10.1007/978-3-319-98334-9_13",
    url="https://www.ac.tuwien.ac.at/files/tr/ac-tr-18-004.pdf"
}
Powered by bibtexbrowser