A Programming Tool for Management of a Predicate-Calculus-Oriented Data Base

This paper describes a LISP program, called PCDB, for storage and retrieval in a data base of predicate calculus (PC) formulas. The PCDB pacxage uses standardized representations of PC formulas, where ground unit clauses are stored efficiently, e.g. on the property-lists of their arguments, and other clauses have other representation. The major part of the PCDB package is a function generator, which accepts declarations of PC relations and functions, and Which also accepts "rules" (= non-ground axioms intended for use in deduction) Declarations and rules are used to generate efficient code for storage and retrieval of "facts" (usually = ground unit clauses) in and from the data base. This generation process may be characterized as a "compilation" of the rules (from predicate calculus to LISP).

[1]  Lewis M. Norton Experiments with a Heuristic Theorem-Proving Program for Predicate Calculus with Equality , 1971, Artif. Intell..

[2]  C. Cordell Green,et al.  The Application of Theorem Proving to Question-Answering Systems , 1969, Outstanding Dissertations in the Computer Sciences.

[3]  Nils J. Nilsson,et al.  A mobius automation: an application of artificial intelligence techniques , 1969, IJCAI 1969.

[4]  Nils J. Nilsson,et al.  A Mobile Automaton: An Application of Artificial Intelligence Techniques , 1969, IJCAI.

[5]  Zohar Manna,et al.  Towards automatic program synthesis , 1971, Symposium on Semantics of Algorithmic Languages.

[6]  Zohar Manna,et al.  Toward automatic program synthesis , 1971, Symposium on Semantics of Algorithmic Languages.