Proving the Impossible is Impossible is Possible: Disproofs Based on Hereditary Partitions
Proceedings of the Third International Joint Conference on Artificial Intelligence. Robot Problem Solving. Pages 383-386.
Abstract
A novel technique, called hereditary partitions, is introduced. It permits the rigorous proof that, in a gi v en axiomatization, certain - states can never be re a ched. The technique is implemented in a computer pro gram, DISPROVER, and is applied to robot worlds . DISPROVER cooperates with a path-finding program when the latter encounters difficulties. ~words: Robot Planning; Impossible Tasks; Theorem Pro v er; Statement Disprover; Disproof; Hereditary Properties; Hereditar y Partitions; Problem Solving.
@inproceedings{ijcai1973p49,
title = {Proving the Impossible is Impossible is Possible: Disproofs Based on Hereditary Partitions},
author = {Siklóssy, Laurent and Roach, John W.},
booktitle = {Proceedings of the Third International Joint Conference on
Artificial Intelligence, {IJCAI-73}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Nils J. Nilsson},
pages = {383--386},
year = {1973},
month = {8},
note = {Robot Problem Solving},
url = {https://ijcai.org/proceedings/1973/49},
}
TY - CPAPER TI - Proving the Impossible is Impossible is Possible: Disproofs Based on Hereditary Partitions AU - Siklóssy, Laurent AU - Roach, John W. T2 - Proceedings of the Third International Joint Conference on Artificial Intelligence, IJCAI-73 PB - International Joint Conferences on Artificial Intelligence PY - 1973 SP - 383 EP - 386 UR - https://ijcai.org/proceedings/1973/49 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: