no code implementations • 23 Mar 2022 • Bart Bogaerts, Stephan Gocht, Ciaran McCreesh, Jakob Nordström
Symmetry and dominance breaking can be crucial for solving hard combinatorial search and optimisation problems, but the correctness of these techniques sometimes relies on subtle arguments.
no code implementations • 2 Aug 2021 • Buser Say, Scott Sanner, Jo Devriendt, Jakob Nordström, Peter J. Stuckey
This document provides a brief introduction to learned automated planning problem where the state transition function is in the form of a binarized neural network (BNN), presents a general MaxSAT encoding for this problem, and describes the four domains, namely: Navigation, Inventory Control, System Administrator and Cellda, that are submitted as benchmarks for MaxSAT Evaluation 2021.
no code implementations • 17 Dec 2020 • Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander Razborov
We prove that for $k \ll \sqrt[4]{n}$ regular resolution requires length $n^{\Omega(k)}$ to establish that an Erd\H{o}s-R\'enyi graph with appropriately chosen edge density does not contain a $k$-clique.
Computational Complexity
