Employee Scheduling With SAT-Based Pseudo-Boolean Constraint Solving

Autor: Enric Rodríguez-Carbonell, Albert Oliveras, Emma Rollon, Robert Nieuwenhuis

Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
IEEE Access, Vol 9, Pp 142095-142104 (2021)

The aim of this paper is practical: to show that, for at least one important real-world problem, modern SAT-based technology can beat the extremely mature branch-and-cut solving methods implemented in well-known state-of-the-art commercial solvers su

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d710a4e1fabd87ec2ec15ce0758946ee
https://doi.org/10.1109/access.2021.3120597

On Irrelevant Literals in Pseudo-Boolean Constraint Learning

Autor: Daniel Le Berre, Pierre Marquis, Romain Wallon, Stefan Mengel

Publikováno v: 29th International Joint Conference on Artificial Intelligence (IJCAI'20)
29th International Joint Conference on Artificial Intelligence (IJCAI'20), Jan 2021, Yokohama (en ligne), Japan. pp.1148-1154, ⟨10.24963/ijcai.2020/160⟩
HAL

Learning pseudo-Boolean (PB) constraints in PB solvers exploiting cutting planes based inference is not as well understood as clause learning in conflict-driven clause learning solvers. In this paper, we show that PB constraints derived using cutting

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7cb5f956581f711c7b03c9728554d075
https://hal.archives-ouvertes.fr/hal-03457395

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Two-element structures modulo primitive positive constructability

Autor: Albert Vucaj, Manuel Bodirsky

Publikováno v: Algebra universalis

Primitive positive constructions have been introduced in recent work of Barto, Opršal, and Pinsker to study the computational complexity of constraint satisfaction problems. Let $${\mathfrak {P}}_{\mathrm {fin}}$$Pfin be the poset which arises from

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ca2992be57552f7622eaa719d162774f

Synthesis of Asynchronous Reactive Programs from Temporal Specifications

Autor: Kedar S. Namjoshi, Yaniv Sa'ar, Suguman Bansal

Publikováno v: Computer Aided Verification ISBN: 9783319961446
CAV (1)

Asynchronous interactions are ubiquitous in computing systems and complicate design and programming. Automatic construction of asynchronous programs from specifications (“synthesis”) could ease the difficulty, but known methods are complex, and i

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::a8c12be273e79a4747b9f1935fcb17c6
https://doi.org/10.1007/978-3-319-96145-3_20