Back to Search Start Over

Portfolio-Based Algorithm Selection for Circuit QBFs

Authors :
Holger H. Hoos
Tomáš Peitl
Stefan Szeider
Friedrich Slivovsky
Source :
Lecture Notes in Computer Science ISBN: 9783319983332, CP
Publication Year :
2018
Publisher :
Springer International Publishing, 2018.

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.

Subjects

Subjects :
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES
Theoretical computer science
Generalization
Computer science
Computer Science::Logic in Computer Science
0202 electrical engineering, electronic engineering, information engineering
Portfolio
020201 artificial intelligence & image processing
02 engineering and technology
020202 computer hardware & architecture
Algorithm Selection

Details

ISBN :
978-3-319-98333-2
ISBNs :
9783319983332
Database :
OpenAIRE
Journal :
Lecture Notes in Computer Science ISBN: 9783319983332, CP
Accession number :
edsair.doi...........38bc362cb9392e65128473888ca928a2
Full Text :
https://doi.org/10.1007/978-3-319-98334-9_13
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details