Subsumption And Connection Graphs

Eisinger, Norbert

Subsumption And Connection Graphs

Download BibTeX Cite

Proceedings of the Seventh International Joint Conference on Artificial Intelligence. Theoretical Foundations. Pages 480-485.

Abstract

A subsumption test based on the principal idea of Kowalski's connection graph proof procedure is developed. In contrast to the standard test this new test is sufficiently efficient to permit the unrestricted use of the subsumption rule in practice. The test is not limited to the connection graph proof procedure, but most naturally embedded into it. In the latter case the unrestricted combination of subsumption with other deletion rules is shown to be inconsistent.

Norbert Eisinger. 1981. Subsumption And Connection Graphs. In Proceedings of the Seventh International Joint Conference on Artificial Intelligence, IJCAI-81. IJCAI, 480–485. https://ijcai.org/proceedings/1981/92

@inproceedings{ijcai1981p92,
  title     = {Subsumption And Connection Graphs},
  author    = {Eisinger, Norbert},
  booktitle = {Proceedings of the Seventh International Joint Conference on
               Artificial Intelligence, {IJCAI-81}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Roger C. Schank},
  pages     = {480--485},
  year      = {1981},
  month     = {8},
  note      = {Theoretical Foundations},
  url       = {https://ijcai.org/proceedings/1981/92},
}

TY  - CPAPER
TI  - Subsumption And Connection Graphs
AU  - Eisinger, Norbert
T2  - Proceedings of the Seventh International Joint Conference on Artificial Intelligence, IJCAI-81
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1981
SP  - 480
EP  - 485
UR  - https://ijcai.org/proceedings/1981/92
ER  -