Conversion of Predicate-Calculus Axioms to Corresponding Deterministic Programs
Sandewall · IEEE Transactions on Computers · 1976
The problem of converting axioms in predicate calculus to deterministic programs, which are to be used as "rules" by a general problem solver (GPS)-type supervisor is considered. It is shown that this can be done, but that the "objects" must then contain procedure closures or "FUNARG-expressions" which are later applied.