Skip to main content
SpringerLink
Log in

Combining Sets with Elements

  • Chapter
Verification: Theory and Practice

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

Abstract

We address the problem of combining decision procedures for sets with decision procedures for objects that are not (necessarily) sets. We present Nelson-Oppen-based and tableau-based combination methods, we prove their correctness, analyze their complexity, and we describe heuristics that aim for efficiency.

This research was supported in part by NSF grants CCR-01-21403, CCR-02-20134 and CCR-02-09237, by ARO grant DAAD19-01-1-0723, by ARPA/AF contracts F33615-00-C-1693 and F33615-99-C-3014, and by NAVY/ONR contract N00014-03-1-0939.

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

  1. E. T. Bell. Exponential numbers. American Mathematical Monthly, 41:411–419, 1934.

    Article  MathSciNet  Google Scholar 

  2. D. Cantone, A. Ferro, and E. G. Omodeo. Computable Set Theory, volume 6 of International Series of Monographs on Computer Science. Clarendon Press, 1989.

    Google Scholar 

  3. M. D’Agostino. Are tableaux an improvement on truth tables? Journal of Logic, Language and Information, 1(3):235–252, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  4. N. G. de Bruijn. Asymptotic Methods in Analysis. North-Holland Publishing Company, 1958.

    Google Scholar 

  5. A. Ferro and E. G. Omodeo. An efficient validity test for formulae in extensional two-level syllogistic. Le Matematiche, 33:130–137, 1978.

    MATH  MathSciNet  Google Scholar 

  6. M. C. Fitting. First-Order Logic and Automated Theorem Proving. Graduate Texts in Computer Science. Springer, 2nd edition, 1996.

    Google Scholar 

  7. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2):245–257, 1979.

    Article  MATH  Google Scholar 

  8. M. Presburger. Über die vollständigkeit eines gewissen systems der arithmetik ganzer zahlen, in welchen die addition als einzige operation hervortritt. In Comptes Rendus du Premier Congrès des Mathématicienes des Pays Slaves, pages 92-101, 1929.

    Google Scholar 

  9. R. M. Smullyan. First-Order Logic. Springer, 1968.

    Google Scholar 

  10. C. Tinelli and M. T. Harandi. A new correctness proof of the Nelson-Oppen combination procedure. In F. Baader and K. U. Schulz, editors, Frontiers of Combining Systems, volume 3 of Applied Logic Series, pages 103-120. Kluwer Academic Publishers, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Stanford University, Gates Building, Stanford, CA, 94305, USA

    Calogero G. Zarba

Authors
  1. Calogero G. Zarba
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Tel Aviv University, Ramat Aviv, Tel Aviv, 69978, Israel

    Nachum Dershowitz

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Zarba, C.G. (2003). Combining Sets with Elements. In: Dershowitz, N. (eds) Verification: Theory and Practice. Lecture Notes in Computer Science, vol 2772. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39910-0_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39910-0_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21002-3

  • Online ISBN: 978-3-540-39910-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation