34
D.W. LOVELAND
[DP1] Davis, M. and H. Putnam.· A computing procedure for
quantification theory.
Jour. Assoc. for Computing Ma.ch.,
1960, 201-215.
(DS1] Downey, P.J., R. Sethi and R. Tarjan. Variations on the com-
mon subexpression problem.
Jour. Assoc.for Comput. Jla.ch.,
to appear.
[Fil] Fitch, F.B.
Symbolic .frJgic, a.n Jn.trod.uction.
Ronald Press,
New York, 1952.
[Fl1] Floyd, R. Assigning meaning to programs.
Ma.thema.tica.l
Aspects of Computer Science
(Schwartz, Ed.),
Amer. Ma.th.
Soc., Providence, 1967, 19-32.
[FN1] Fikes, R.E. and N.J. Nilsson. STRIPS: a new approach to the
application of theorem proving to problem solving.
Art;J.
Jn.tell.,
1971, 189-208.
[FOl] Ferro, A., E.G. Omodeo and J.T. Schwartz. Decision pro-
cedures for elementary sublanguages of set theory 1:
Multi-level syllogistic and sQme extensions.
Commun. Pure
a.ntl Appl. Ma.th.,
1980, 599-608.
[GC1] Good, D., R.M. Cohen and J. Keeton-Williams. Principles of
proving concurrent programs in Gypsy.
Proc. Si:zth Conf. on
Principles of
Progr.
La.ng.,
1979.
[Gel] Gelemter, H. Realization of a geometry theorem-proving
machine. Proc.
Jn.tem.. Conf. ln.forma.tion Proc.,
Paris:UNESCO House, 1959, 273-282. Also in
Computers a.ntl
'Jhought
(Feigenbaum and Feldman, Eds.), McGraw-Hill,
1963, 134-152.
[Ge2] Gentzen, G. Untersuchungen uber
~as
logische Schliessen.
Jla.thema.tische Zeitschri/t,
1934, 176-210, 405-431.
[GH1] Gelemter, H., J.R. Hanson and D.W. Loveland. Empirical
explorations of the geometry-theorem proving machine.
Proc.
West. Joint Computer Conf.,
1960, 143-147. Also in
Computing a.nd. 'Jhought
(Feigenbaum and Feldman, Eds.),
McGraw-Hill, 1963, 153-163.
Previous Page Next Page