Algorithm for parallel subsumption
Thesis/Dissertation
·
OSTI ID:5569035
Many current automated theorem provers use a refutation procedure based on some version of the principle of resolution. These methods normally lead to the generation of large numbers of new clauses. Subsumption is a process that eliminates the superfluous clauses from the clause space, thus speeding up the proof. The research presented in this thesis is concerned with the design and implementation of a subsumption algorithm that exploits the parallelism provided by a multiprocessor. For portability, all coding is done in the programming language C. Monitors are used as the synchronization mechanism. Correct performance in both a multiprocessor and uniprocessor mode is stressed. The parallel tests were run on Denelcor HEP located at Argonne National Laboratory.
- Research Organization:
- Missouri Univ., Rolla (USA)
- OSTI ID:
- 5569035
- Country of Publication:
- United States
- Language:
- English
Similar Records
Theoretical and implementational aspects of parallel-link, resolution in connection graphs
New test generation algorithm for digital circuits and its artificial intelligence based implementation
Design and implementation of an OR-parallel logic programming system
Thesis/Dissertation
·
Mon Dec 31 23:00:00 EST 1984
·
OSTI ID:5220048
New test generation algorithm for digital circuits and its artificial intelligence based implementation
Thesis/Dissertation
·
Mon Dec 31 23:00:00 EST 1984
·
OSTI ID:5790944
Design and implementation of an OR-parallel logic programming system
Thesis/Dissertation
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:7135317