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

Artificial Intelligence 302 (C):103604 (2022)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,824

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Handbook of satisfiability.Armin Biere, Marijn Heule & Hans van Maaren (eds.) - 2021 - Washington, DC: IOS Press.
SAT-based causal discovery under weaker assumptions. Zhalama, Jiji Zhang, Frederick Eberhardt & Wolfgang Mayer - 2017 - In Zhalama, Jiji Zhang, Frederick Eberhardt & Wolfgang Mayer, Proceedings of the 33rd Conference on Uncertainty in Artificial Intelligence (UAI). Association for Uncertainty in Artificial Intelligence (AUAI).
Planning with constraints.Mark Stefik - 1981 - Artificial Intelligence 16 (2):111-139.
Constraints, consistency and closure.Peter Jeavons, David Cohen & Martin C. Cooper - 1998 - Artificial Intelligence 101 (1-2):251-265.
Learning general constraints in CSP.Michael Veksler & Ofer Strichman - 2016 - Artificial Intelligence 238:135-153.

Analytics

Added to PP
2022-11-21

Downloads
18 (#1,223,873)

6 months
2 (#1,371,221)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations