A Tough Nut for Tree Resolution

Stefan Dantchev, Søren Riis


One of the earliest proposed hard problems for theorem provers is
a propositional version of the Mutilated Chessboard problem. It is well
known from recreational mathematics: Given a chessboard having two
diagonally opposite squares removed, prove that it cannot be covered with
dominoes. In Proof Complexity, we consider not ordinary, but 2n * 2n
mutilated chessboard. In the paper, we show a 2^Omega(n) lower bound for tree resolution.

Full Text:


DOI: http://dx.doi.org/10.7146/brics.v7i10.20137
This website uses cookies to allow us to see how the site is used. The cookies cannot identify you or any content at your own computer.

ISSN: 0909-0878 

Hosted by the State and University Library and Aarhus University Library