On the reconstruction of proofs in distributed theorem proving: A modified clause-diffusion method

Journal of Symbolic Computation

Volumn 21, Issue 4-6, 1996, Pages 507-522

  Bonacina, Maria Paola ^a  

^a The University of Iowa   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030117899     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1996.0028     Document Type: Article

References (13)

1. Avenhaus, J., Denzinger, J. (1993). Distributing equational theorem proving. In Kirchner, C., (ed.), Fifth Conf. on Rewriting Techniques and Applications, Montreal, Canada, June 1993, volume 690 of Lecture Notes in Computer Science, pp. 62-76. Berlin, Springer-Verlag.
2. Bachmair, L., Dershowitz, N., Plaisted, D.A. (1989). Completion without failure. In Ait-Kaci, H., Nivat, M., (eds), Resolution of Equations in Algebraic Structures - Rewriting Techniques, volume 2, pp. 1-30, New York, Academic Press.
3. Bachmair, L., Ganzinger, H. (1992). Non-clausal resolution and superposition with selection and redundancy criteria. In Voronkov, A., (ed.), Logic Programming and Automated Reasoning, volume 624 of Lecture Notes in Artificial Intelligence, pp. 273-284. Berlin, Springer-Verlag.
4. Bonacina, M.P. (1994). On the reconstruction of proofs in distributed theorem proving with contraction: a modified Clause-Diffusion method. In Hong, H., (ed.), First Int. Symp. on Parallel Symbolic Computation, Linz, Austria, September 1994, volume 5 of Lecture Notes Series in Computing, pp. 22-33. Singapore, World Scientific.
5. Bonacina, M.P., Hsiang, J. (1994). Parallelization of deduction strategies: an analytical study. J. Automated Reasoning, 13:1-33.
6. Bonacina, M.P., Hsiang, J. (1995a). The Clause-Diffusion methodology for distributed deduction. Fundamenta Informaticae, 24:177-207.
7. Bonacina, M.P., Hsiang, J. (1995b). Distributed deduction by Clause-Diffusion: the Aquarius prover. J. Symbolic Computation, 19:245-267.
8. Bonacina, M.P., McCune, W.W. (1994). Distributed theorem proving by Peers. In Bundy, A., (ed.), Twelfth Conf. on Automated Deduction, Nancy, France, June 1994, volume 814 of Lecture Notes in Artificial Intelligence, pp. 841-845. Berlin, Springer-Verlag.
9. Denzinger, J., Schulz, S. (1994). Recording, analysing and presenting distributed deduction processes. In Hong, H., (ed.), First Int. Symp. on Parallel Symbolic Computation, Linz, Austria, September 1994, volume 5 of Lecture Notes Series in Computing, pp. 114-123. Singapore, World Scientific.
10. Hsiang, J., Rusinowitch, M. (1987). On word problems in equational theories. In Ottman, T., (ed.), Fourteenth Int. Conf. on Automata, Languages and Programming, Karlsruhe, Germany, July 1987, volume 267 of Lecture Notes in Computer Science, pp. 54-71. Berlin, Springer-Verlag.
11. Lusk, E.L., McCune, W.W. (1992). Experiments with ROO: a parallel automated deduction system. In Fronhöfer, B., Wrightson, G., (eds), Parallelization in Inference Systems, volume 590 of Lecture Notes in Artificial Intelligence, pp. 139-162. Berlin, Springer-Verlag.
12. McCune, W.W. (1994). Otter 3.0 reference manual and guide. Technical Report 6, Mathematics and Computer Science Division, Argonne National Laboratory.
13. Suttner, C.B., Schumann, J. (1994). Parallel automated theorem proving. In Kanal, L., Kumar, V., Kitano, H., Suttner, C.B., (eds), Parallel Processing for Artificial Intelligence, Amsterdam, Elsevier.