Skip to main content
SpringerLink
Log in

Automated Theorem Proving in a Combination of Theories with Disjoint Signatures

  • Conference paper
  • First Online:
SOFSEM’ 98: Theory and Practice of Informatics (SOFSEM 1998)

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

  • 424 Accesses

Abstract

We present a method for automated theorem proving in a combination of theories with disjoint signatures. The Nelson-Oppen combination technique for decision procedures is used to combine separate theorem provers in different theories. The provers being combined are based on the Prolog Technology Theorem Proving method and they use the SLD resolution (alternatively Model Elimination) as an inference system. Our approach enables to tune up the provers for different theories separately and increases the effciency of automated theorem proving in a combination of theories.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

  1. Apt K.R, Introduction to Logic Programming (Revised and Extended Version), Report CS-R8826, Centre for Math. and Comp. Science, 1986 Amsterdam

    Google Scholar 

  2. Baader F., Tinelli C.: A New Approach for Combining Decision Procedures for the Word Problem and Its Connection to the Nelson-Oppen Combination method, pg. 19–33in proc. CADE-14, LNAI 1249, ed. W. McCune, Springer 1997

    Google Scholar 

  3. Baumgartner P., Furbach U.: Model Elimination Without Contrapositives and its Application to PTTP, in Proc. CADE-14, LNAI 1249, ed. W. McCune, Springer 1997

    Google Scholar 

  4. Bjorner N.S., Stickel M.E., Uribe, T.E.: A Practical Integration of First-Order Reasoning and Decision procedures, pg. 101–115 in proc. CADE-14, LNAI 1249, ed. W. McCune, Springer 1997

    Google Scholar 

  5. Boulton R.J.: Combining Decision Procedures in the HOL system, pg. 75–89, LNCS 971, Higher Order Logic Theorem Proving and Its Applications, 1995

    Google Scholar 

  6. Burstall R.M, Sanella D.T.: Structured theories in LCF, Proceedings of the 8th Colloquium on Trees in Algebra and Programming, L’Aquila, Italy, 1983

    Google Scholar 

  7. Busch H.: First-Order Automation for Higher-Order-Logic Theorem Proving, pg. 97–112, LNCS 859, Higher Order Logic Theorem Proving and Its Applications 1994

    Google Scholar 

  8. Chang C.L., Lee R.C.: Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York, 1973

    MATH  Google Scholar 

  9. Dahn B.I., Gehne J., Honigmann Th., Wolf A.: Integration of Automated and Interactive Theorem Proving in ILF, pg. 57–60 in proc. CADE-14, LNAI 1249, ed. W. McCune, Springer 1997

    Google Scholar 

  10. Harper R., Sanella D., Tarlecki A.: Structured theory presentations and logic representations, p. 113–160, Annals of pure and Applied Logic, North Holland 1994

    Google Scholar 

  11. Harrison J.: First Order Logic in Practice, Proceedings of FTP97 Workshop, 1997, RISC report No 97-50

    Google Scholar 

  12. Nelson G., Oppen C.: Simplification by cooperating Decision Procedures, pg. 245–257, ACM Transactions on Programming Languages and Systems, 1/2, 1979

    Article  Google Scholar 

  13. Nilsson N.J.: Principles of Artificial Intelligence, Tioga Publishing Co., Palo Alto, California (1980), 193–275

    MATH  Google Scholar 

  14. Plaisted D.A.: Non-Horn Clause Logic Programming Without Contrapositives, pg. 287–325, Journal of Automated Reasoning 4(1988)

    Article  MATH  MathSciNet  Google Scholar 

  15. Reif W., Schellhorn G.: Proving properties of Finite Enumerations: A Problem Set for Automated Theorem Provers, Technical Report Nr. 97-12, Department of Computer Science, University of Ulm

    Google Scholar 

  16. Reif W., Schellhorn G.: Theorem Proving in Large Theories, Proceedings of FTP97 Workshop, 1997, RISC report No 97-50

    Google Scholar 

  17. Shostak, R.E.: Deciding combinations of theories, LNCS 138, 6th Conference on Automated Deduction, (CADE 6), LNCS 138, ed. D.W. Loveland, Springer 1982

    Google Scholar 

  18. Stickel M.E.: A Prolog technology theorem prover: a new exposition and implementation in Prolog, pg. 109–128, Theoretical Computer Science 104 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  19. Stickel M.E.: A Prolog Technology Theorem Prover: Implementation by an Extended Prolog Compiler, pg. 353–380, Journal of Automated Reasoning 4 (1988)

    Google Scholar 

  20. Tinelli. C., Harandi. M.: A new correctness proof of the Nelson-Oppen combination procedure, proc. of the 1st International Workshop Frontiers of Combining Systems, 1996

    Google Scholar 

  21. Vanousek P.: Implication based theorem proving (in Czech), Diploma Thesis, MFF Charles University Prague, 1995

    Google Scholar 

  22. Vanousek P.: Automated Theorem Proving in Structured Theory Specifications (Choosing implementional environment), Tech rep. 98-03, MFF Charles University Prague, 1998

    Google Scholar 

  23. Vanousek P.: Automated Theorem Proving in Structured Theory Specifications, Dissertation Thesis (in progress), MFF Charles University Parague, 1998

    Google Scholar 

  24. Wirsing M., Proofs In Structured Specifications, MIP-9008, 1991 University Passau

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dpt. of theoretical Computer Science MFF, Charles University, Malostranské nám. 25, 118 00, Prague 1, Czech Republic

    Pavel Anousek

Authors
  1. Pavel Anousek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Comenius University, SK-84215, Bratislava, Slovakia

    Branislav Rovan

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Anousek, P. (1998). Automated Theorem Proving in a Combination of Theories with Disjoint Signatures. In: Rovan, B. (eds) SOFSEM’ 98: Theory and Practice of Informatics. SOFSEM 1998. Lecture Notes in Computer Science, vol 1521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49477-4_37

Download citation

  • DOI: https://doi.org/10.1007/3-540-49477-4_37

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-49477-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation