5 citations · 8 across the 14 of their papers we have counts for
6 papers · 1 filter
Coloring Queens with Thousands of Encodings
Bernardo Subercaseaux, Benjamin Przybocki, Marijn J. H. Heule
In The Art of Computer Programming, Knuth benchmarked 10 encoding techniques for computing the chromatic number of the queen's graph: the minimum number of colors needed to color t…
Bringing closure to theory combination properties
Guilherme V. Toledo, Benjamin Przybocki, Yoni Zohar
We consider the closure of three classical combination properties, namely, stable infiniteness, gentleness and shininess (or, equivalently for decidable theories, strong politeness…
Characterizing Sets of Theories That Can Be Disjointly Combined
Benjamin Przybocki, Guilherme V. Toledo, Yoni Zohar
We study properties that allow first-order theories to be disjointly combined, including stable infiniteness, shininess, strong politeness, and gentleness. Specifically, we describ…
Shininess, strong politeness, and unicorns
Benjamin Przybocki, Guilherme V. Toledo, Yoni Zohar
Shininess and strong politeness are properties related to theory combination procedures. In a paper titled "Many-sorted equivalence of shiny and strongly polite theories", Casal an…
Being polite is not enough (and other limits of theory combination)
Guilherme V. Toledo, Benjamin Przybocki, Yoni Zohar
In the Nelson-Oppen combination method for satisfiability modulo theories, the combined theories must be stably infinite; in gentle combination, one theory has to be gentle, and th…
The termination of Nielsen transformations applied to word equations with length constraints
Benjamin Przybocki, Clark Barrett
Nielsen transformations form the basis of a simple and widely used procedure for solving word equations. We make progress on the problem of determining when this procedure terminat…