This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Conversion of Predicate-Calculus Axioms to Corresponding Deterministic Programs
April 1976 (vol. 25 no. 4)
pp. 342-346
E. Sandewall, Linkoeping University
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.
Index Terms:
Closure, deduction, FUNARG-expression, nondeterministic, retrieval, theorem proving.
Citation:
E. Sandewall, "Conversion of Predicate-Calculus Axioms to Corresponding Deterministic Programs," IEEE Transactions on Computers, vol. 25, no. 4, pp. 342-346, April 1976, doi:10.1109/TC.1976.1674615
Usage of this product signifies your acceptance of the Terms of Use.