Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF
- Submitting institution
-
The University of Manchester
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 84888882
- Type
- D - Journal article
- DOI
-
10.1007/s10817-018-9482-4
- Title of journal
- Journal of Automated Reasoning
- Article number
- -
- First page
- 597
- Volume
- 63
- Issue
- 0
- ISSN
- 0168-7433
- Open access status
- Compliant
- Month of publication
- September
- Year of publication
- 2018
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
4
- Research group(s)
-
A - Computer Science
- Citation count
- 2
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- "This paper presents a unifying framework for two strands of QBF (Quantified Boolean Formulas) theory presented previously as separate. The work is significant because it has practical implications for automated solvers for QBF, which are now reaching the point of industrial applicability.
Invited talk at Dagstuhl Seminar 20061 on SAT and Interactions (PGR Blinkhorn, Schmidt)."
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
