Π-representation: A clause representation for parallel search

摘要

An extension to the clause form of the first-order predicate calculus is described which facilitates parallel search operations. This notation, called parallel representation (Π-representation), permits the representation of sets of clauses as single “Π-clauses”. Extensions to the operations of unification, factoring, and resolution which apply to this notation are also described, and the advantages of Π-representation with respect to parallel searching, memory utilization, and the use of semantics are discussed.