Skip to main content
SpringerLink
Log in

Automated deduction by connection method in an object-oriented environment

  • Chapter
Advances in the Design of Symbolic Computation Systems

Part of the book series: Texts and Monographs in Symbolic Computation ((TEXTSMONOGR))

  • 114 Accesses

Abstract

In this paper issues of a logic deduction tool to be integrated in an object-oriented programming (OOP) environment for the manipulation of mathematical objects are presented.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Bibel, W. (1987): Automated theorem proving. F. Vie weg und Sohn, Wiesbaden.

    MATH  Google Scholar 

  • Eshghi, K., Kowalski, R. (1989): Abduction compared with negation by failure. In: Levi, G., Martelli, A. (eds.): Proceedings Sixth International Conference on Logic Programming, ICLP. MIT Press, Cambridge, MA, pp. 234–254.

    Google Scholar 

  • Fitch, J. (1985): Solving algebraic problems with Reduce. J. Symb. Comput. 1: 211–227.

    Article  MATH  Google Scholar 

  • Jenks, R. D., Trager, B. (1981): A language for computational algebra. SIGPLAN Not. 16/11: 22–29.

    Article  Google Scholar 

  • Miola, A. (ed.) (1990): Design and implementation of symbolic computation systems. Springer, Berlin Heidelberg New York Tokyo (Lecture notes in computer science, vol. 429).

    MATH  Google Scholar 

  • Paterson, M., Wegman, M. (1978): Linear unification. J. Comput. Syst. Sci. 16: 158–167.

    Article  MathSciNet  MATH  Google Scholar 

  • Pelletier, F. (1986): Seventy-five problems for testing automatic theorem provers. J. Autom. Reason. 1: 191–216.

    Article  MathSciNet  Google Scholar 

  • Wang, P., Pavelle, R. (1985): MACSYMA from F to G. J. Symb. Comput. 1: 69–100.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Authors
  1. G. Cioni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Patrizi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Temperini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica e Automazione, Università degli Studi di Roma Tre, Rome, Italy

    Alfonso Miola

  2. Dipartimento di Informatica e Sistemistica, Università degli Studi di Roma “La Sapienza”, Rome, Italy

    Marco Temperini

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Wien

About this chapter

Cite this chapter

Cioni, G., Patrizi, G., Temperini, M. (1997). Automated deduction by connection method in an object-oriented environment. In: Miola, A., Temperini, M. (eds) Advances in the Design of Symbolic Computation Systems. Texts and Monographs in Symbolic Computation. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6531-7_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-6531-7_14

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-82844-1

  • Online ISBN: 978-3-7091-6531-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation