creators_name: McCarthy, John
type: preprint
datestamp: 1998-02-27
lastmod: 2011-03-11 08:53:53
metadata_visibility: show
title: A Tough Nut for Proof Procedures
subjects: comp-sci-art-intel
full_text_status: public
abstract: It is well known to be impossible to tile with dominoes a checkerboard with two opposite corners deleted. This fact is readily stated in the first order predicate calculus, but the usual proof which involves a parity and counting argument does not readily translate into predicate calculus. We conjecture that this problem will be very difficult for programmed proof procedures,.
date: 1964-07
date_type: published
refereed: FALSE
citation:   McCarthy, John  (1964) A Tough Nut for Proof Procedures.  [Preprint]     
document_url: http://cogprints.org/414/2/toughnut.ps