McCarthy, John (1964) A Tough Nut for Proof Procedures. [Preprint]
Full text available as:
![[img]](../style/images/fileicons/application_postscript.png) |
Postscript
43Kb |
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,.
| Item Type: | Preprint |
|---|---|
| Subjects: | Computer Science > Artificial Intelligence |
| ID Code: | 414 |
| Deposited By: | McCarthy, John |
| Deposited On: | 27 Feb 1998 |
| Last Modified: | 11 Mar 2011 08:53 |
Metadata
- ASCII Citation
- Atom
- BibTeX
- Dublin Core
- EP3 XML
- EPrints Application Profile (experimental)
- EndNote
- HTML Citation
- ID Plus Text Citation
- JSON
- METS
- MODS
- MPEG-21 DIDL
- OpenURL ContextObject
- OpenURL ContextObject in Span
- RDF+N-Triples
- RDF+N3
- RDF+XML
- Refer
- Reference Manager
- Search Data Dump
- Simple Metadata
- YAML
Repository Staff Only: item control page
