The role of heuristics in automated theorem proving. J.A. Robinson's resolution principle.
Cordeschi, Roberto
Mathware and Soft Computing, Tome 3 (1996), p. 281-293 / Harvested from Biblioteca Digital de Matemáticas

The aim of this paper is to show how J.A. Robinson's resolution principle was perceived and discussed in the AI community between the mid sixties and the first seventies. During this time the so called heuristic search paradigm was still influential in the AI community, and both resolution principle and certain resolution based, apparently human-like, search strategies were matched with those problem solving heuristic procedures which were representative of the AI heuristic search paradigm.

Publié le : 1996-01-01
DMLE-ID : 1835
@article{urn:eudml:doc:39079,
     title = {The role of heuristics in automated theorem proving. J.A. Robinson's resolution principle.},
     journal = {Mathware and Soft Computing},
     volume = {3},
     year = {1996},
     pages = {281-293},
     language = {en},
     url = {http://dml.mathdoc.fr/item/urn:eudml:doc:39079}
}
Cordeschi, Roberto. The role of heuristics in automated theorem proving. J.A. Robinson's resolution principle.. Mathware and Soft Computing, Tome 3 (1996) pp. 281-293. http://gdmltest.u-ga.fr/item/urn:eudml:doc:39079/