A simple example for nqthm: modeling locking

Yesterday I visited with Stan Letovsky of Andersen Consulting, Chicago. The purpose of the visit was to explore the possibility of using Boyer-Moore theorem prover [Boyer-Moore 88, Boyer-Moore 79], or something like it, in some capacity related to their part in the KBSA (Knowledge-Based Software Assistant) project, [kbsa 83]. Stan proposed a little example for us to work on, which I’ll describe presently.

[1]  Robert S. Boyer,et al.  A computational logic handbook , 1979, Perspectives in computing.

[2]  Matt Kaufmann.  An Interactive Enhancement to the Boyer-Moore Theorem Prover , 1988, CADE.

[3]  Robert S. Boyer,et al.  Computational Logic , 1990, ESPRIT Basic Research Series.

[4]  Robert Balzer,et al.  Report on a knowledge-based software assistant , 1986 .