"Two SAT solvers for solving quantified Boolean formulas with an arbitrary ..."

Roderick Bloem et al. (2021)

> Home

Details and statistics

DOI: 10.1007/S10703-021-00371-7

access: closed

type: Journal Article

metadata version: 2023-08-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/fmsd/BloemBHELS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fmsd/BloemBHELS21
Roderick Bloem, Nicolas Braud-Santoni, Vedad Hadzic, Uwe Egly, Florian Lonsing, Martina Seidl:
Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations. Formal Methods Syst. Des. 57(2): 157-177 (2021)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.