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)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,127

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

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

Analytics

Added to PP
2022-11-21

Downloads
12 (#1,115,280)

6 months
8 (#415,230)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations