SAT encodings for Pseudo-Boolean constraints together with at-most-one constraints

Bofill, Miquel, Coll, Jordi, Nightingale, Peter orcid.org/0000-0002-5052-8634 et al. (3 more authors) (2021) SAT encodings for Pseudo-Boolean constraints together with at-most-one constraints. Artificial Intelligence. ISSN 0004-3702

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2021 Published by Elsevier B.V. This is an author-produced version of the published paper. Uploaded in accordance with the publisher’s self-archiving policy.
Dates:
  • Published (online): 7 October 2021
Institution: The University of York
Academic Units: The University of York > Faculty of Sciences (York) > Computer Science (York)
Depositing User: Pure (York)
Date Deposited: 18 Oct 2021 11:10
Last Modified: 31 Oct 2021 11:19
Published Version: https://doi.org/10.1016/j.artint.2021.103604
Status: Published online
Refereed: Yes
Identification Number: https://doi.org/10.1016/j.artint.2021.103604
Related URLs:

Download

Accepted Version


Embargoed until: 7 October 2022

Filename: arxiv_version.pdf

Description: author-accepted-version

Licence: CC-BY-NC-ND 2.5

Request a copy

file not available

Share / Export

Statistics