HomeEPiC SeriesKalpa PublicationsPreprintsFor AuthorsFor Editors

Author:Bernardo Subercaseaux

Publications
A SAT Attack on Tarski's High School Algebra Problem
Bernardo Subercaseaux and Benjamin Przybocki
In:Proceedings of the 26th Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Coloring Queens with Thousands of Encodings
Bernardo Subercaseaux, Benjamin Przybocki and Marijn Heule
In:Proceedings of the 26th Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Sometimes Hoarding is Harder than Cleaning: NP-hardness of Maximum Blocked-Clause Addition
Bernardo Subercaseaux
In:Proceedings of 25th Conference on Logic for Programming, Artificial Intelligence and Reasoning
Toward Optimal Radio Colorings of Hypercubes via SAT-solving
Bernardo Subercaseaux and Marijn Heule
In:Proceedings of 24th International Conference on Logic for Programming, Artificial Intelligence and Reasoning

Keyphrases

Blocked-clause Addition, cardinality constraints, CNF formulas, equational theories, graph coloring, high school identities, hypercubes, NP-hardness, Preprocessing, queen's graph, radio colorings, SAT2, SAT encoding, SAT solving, symmetry breaking, Wilkie's identity.

Copyright © 2012-2026 easychair.org. All rights reserved.