作者: Daniel H. Fishman , Jack Minker
DOI: 10.1016/0004-3702(75)90005-3
关键词:
摘要: Abstract An extension to the clause form of first-order predicate calculus is described which facilitates parallel search operations. This notation, called representation (Π-representation), permits sets clauses as single “Π-clauses”. Extensions operations unification, factoring, and resolution apply this notation are also described, advantages Π-representation with respect searching, memory utilization, use semantics discussed.