Skip to main content

On fairness in distributed automated deduction

  • Conference paper
  • First Online:
STACS 93 (STACS 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 665))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S.Anantharaman, J.Hsiang, Automated Proofs of the Moufang Identities in Alternative Rings, JAR, Vol. 6, No. 1, 76–109, 1990.

    Google Scholar 

  2. L.Bachmair, N.Dershowitz and J.Hsiang, Orderings for Equational Proofs, in Proc. of LICS-86, 346–357, 1986.

    Google Scholar 

  3. L.Bachmair, Proofs Methods for Equational Theories, Ph.D. Thesis, Dept. of Computer Science, Univ. of Illinois at Urbana, 1987.

    Google Scholar 

  4. L.Bachmair, H.Ganzinger, Non-Clausal Resolution and Superposition with Selection and Redundancy Criteria, in Proc. of LPAR-92, LNAI 624, 273–284, 1992.

    Google Scholar 

  5. M.P.Bonacina, J.Hsiang, On fairness of completion-based theorem proving strategies, in R.V. Book (ed.), Proc. of RTA-91, LNCS 488, 348–360, 1991.

    Google Scholar 

  6. M.P.Bonacina, J.Hsiang, Towards a Foundation of Completion Procedures as Semidecision Procedures, submitted and Tech. Rep. Dept. of Computer Science, SUNY at Stony Brook, Aug. 1991.

    Google Scholar 

  7. M.P.Bonacina, Distributed Automated Deduction, Ph.D. Thesis, Dept. of Computer Science, SUNY at Stony Brook, Dec. 1992.

    Google Scholar 

  8. J.D.Christian, High-Performance Permutative Completion, Ph.D. Thesis, Univ. of Texas at Austin, and MCC Tech. Rep. ACT-AI-303-89, Aug. 1989.

    Google Scholar 

  9. S.E.Conry, D.J.Macintosh and R.A.Meyer, DARES: A Distributed Automated REasoning System, in Proc. of AAAI-90, 78–85, 1990.

    Google Scholar 

  10. J.Denzinger, Distributed knowledge-based deduction using the team work method, Tech. Rep., Univ. of Kaiserslautern, 1991.

    Google Scholar 

  11. D.J.Hawley, A Buchberger Algorithm for Distributed Memory Multi-Processors, in Proc. of the Int. Conf. of the Austrian Center for Parallel Computation, Linz, Oct. 1991.

    Google Scholar 

  12. J.Hsiang, M.Rusinowitch, On word problems in equational theories, in Th.Ottman (ed.), Proc. of ICALP-87, LNCS 267, 54–71, 1987.

    Google Scholar 

  13. G.Huet, A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm, JCSS, Vol. 23, 11–21, 1981.

    Google Scholar 

  14. A.Jindal, R.Overbeek and W.Kabat, Exploitation of parallel processing for implementing high-performance deduction systems, JAR, Vol. 8, 23–38, 1992.

    Google Scholar 

  15. D.Kapur. H.Zhang, RRL: a Rewrite Rule Laboratory, in E.Lusk, R.Overbeek (eds.), Proc. of CADE-9, LNCS 310, 768–770, 1988.

    Google Scholar 

  16. C.Kirchner. P.Viry, Implementing Parallel Rewriting, in B.Fronhöfer and G.Wrightson (eds.), Parallelization in Inference Systems, LNAI 590, 123–138, 1992.

    Google Scholar 

  17. D.W.Loveland, Automated Theorem Proving: A Logical Basis, North-Holland, Amsterdam, 1978.

    Google Scholar 

  18. E.L.Lusk, W.W.McCune, Experiments with ROO: a Parallel Automated Deduction System, in B.Fronhöfer and G.Wrightson (eds.), Parallclization in Inference Systems, LNAI 590, 139–162, 1992.

    Google Scholar 

  19. W.W.McCune, OTTER 2.0 Users Guide, Tech. Rep. ANL-90/9, Argonne National Lab., Mar. 1990.

    Google Scholar 

  20. M.Rusinowitch, Theorem-proving with Resolution and Superposition, JSC, Vol. 11, No. 1 & 2, 21–50, Jan./Feb. 1991.

    Google Scholar 

  21. K.Siegl, Gröbner Bases Computation in STRAND: A Case Study for Concurrent Symbolic Computation in Logic Programming Languages, M.S. Thesis and Tech. Rep. 90-54.0, RISC-LINZ, Nov. 1990.

    Google Scholar 

  22. R.Socher-Ambrosius, How to Avoid the Derivation of Redundant Clauses in Reasoning Systems, in JAR, Vol. 9, No. 1, Aug. 1992.

    Google Scholar 

  23. M.E.Stickel, The Path-Indexing Method for Indexing Terms, Tech. Note 473, SRI Int., Oct. 1989.

    Google Scholar 

  24. J.-P.Vidal, The Computation of Gröbner Bases on A Shared Memory Multiprocessor, in A.Miola (ed.), Proc. of DISCO-90, LNCS 429, 81–90, 1990 and Tech. Rep. CMU-CS-90-163, Aug. 1990.

    Google Scholar 

  25. K.A.Yelick, S.J.Garland, A Parallel Completion Procedure for Term Rewriting Systems, in D.Kapur (ed.), Proc. of CADE-11, LNAI 607, 109–123, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

P. Enjalbert A. Finkel K. W. Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bonacina, M.P., Hsiang, J. (1993). On fairness in distributed automated deduction. In: Enjalbert, P., Finkel, A., Wagner, K.W. (eds) STACS 93. STACS 1993. Lecture Notes in Computer Science, vol 665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-56503-5_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56503-1

  • Online ISBN: 978-3-540-47574-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics