Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF

Beyersdorff, O orcid.org/0000-0002-2870-1648, Blinkhorn, J, Chew, L et al. (2 more authors) (2019) Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF. Journal of Automated Reasoning, 63 (3). pp. 597-623. ISSN 0168-7433

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2018, The Author(s). This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Keywords: Quantified Boolean formulas; DQBF; Dependency schemes
Dates:
  • Accepted: 15 September 2018
  • Published (online): 24 September 2018
  • Published: October 2019
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 09 Nov 2018 14:27
Last Modified: 25 Jun 2023 21:35
Status: Published
Publisher: Springer Netherlands
Identification Number: https://doi.org/10.1007/s10817-018-9482-4

Export

Statistics