EUVIMEDEUVIMED entdecken
Crossref

Hybridizing Expansion and Search for QBF

Allen Van Gelder, Alex John

Bulletin of Computer and Data Sciences · 2020

DOI: 10.71448/bcds2011-4 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Bulletin of Computer and Data Sciences, 2020. Verfasst von Allen Van Gelder und 1 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Recent years have brought significant advances in both the theory and engineering of quantified Boolean formula (QBF) solving. New solvers now build on established ideas while also introducing alternative paradigms; robust preprocessing pipelines reshape encodings to simplify search; and certification/model-extraction infrastructures make solver outputs auditable and interpretable. In parallel, fresh QBF encodings have been proposed across diverse application domains. To consolidate and track these developments, the QBF Gallery was launched in 2018 as a venue for systematic tool assessment and for curating expressive benchmark suites that reflect the current landscape and highlight promising research avenues. These benchmarks underpinned the experiments carried out for the 2018 edition and subsequent evaluations. This paper outlines the design of the Gallery and reports on an extensive experimental study, which evaluates not only solver performance but also the breadth and quality of the benchmark corpus.

Zitieren

APA

Gelder, A. V., & John, A. (2020). Hybridizing Expansion and Search for QBF. Bulletin of Computer and Data Sciences. https://doi.org/10.71448/bcds2011-4

Vancouver

Gelder AV, John A. Hybridizing Expansion and Search for QBF. Bulletin of Computer and Data Sciences. 2020. doi:10.71448/bcds2011-4

BibTeX
@article{Gelder2020,
  author = {Gelder, Allen Van and John, Alex},
  title = {Hybridizing Expansion and Search for QBF},
  journal = {Bulletin of Computer and Data Sciences},
  year = {2020},
  doi = {10.71448/bcds2011-4}
}
Kostenlos starten →