Abstract :
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.
Keywords :
Closure, deduction, FUNARG-expression, nondeterministic, retrieval, theorem proving.; Artificial intelligence; Calculus; Computer aided software engineering; Computer languages; Control systems; Global Positioning System; High level languages; Information retrieval; Closure, deduction, FUNARG-expression, nondeterministic, retrieval, theorem proving.;
