We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
The ability of modern SAT solvers to produce proofs of unsatisfiability for Boolean formulas has become a powerful tool for EDA applications. Proofs are generated from a resolve t...
An approach for factoring general boolean functions was described in [15, 16] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for ...