NASA NTRS · 19740021432
Global parallel unification for large question-answering systems
Abstract
An efficient means of storing data in a first-order predicate calculus theorem-proving system is described. The data structure is oriented for large scale question-answering (QA) systems. An algorithm is outlined which uses the data structure to unify a given literal in parallel against all literals in all clauses in the data base. The data structure permits a compact representation of data within a QA system. Some suggestions are made for heuristics which can be used to speed-up the unification algorithm in systems.
Keep this discovery
Explore connections, maps & timelines
Auguston, J. G., Minker, J.. 1974-06-01. Global parallel unification for large question-answering systems. https://ntrs.nasa.gov/citations/19740021432
Cite the original work for its findings. Save a collection to share your selection of sources.