Skip to main content
SpringerLink
Log in

Combining Sets with Integers

  • Conference paper
  • First Online:
Book cover Frontiers of Combining Systems (FroCoS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2309))

Included in the following conference series:

Abstract

We present a decision procedure for a constraint language combining stratified sets of ur-elements with integers in the presence of a cardinality operator. Our decision procedure is an extension of the Nelson-Oppen combination method specifically tailored to the combination domain of sets, integers, and ur-elements.

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. Domenico Cantone and Vincenzo Cutello. A decision procedure for set-theoretic formulae involving rank and cardinality comparison. In A. Bertoni, C. Böhm,and P. Miglioli,eds., Proceedings of the 3rd Italian Conference on Theoretical Computer Science,pages 150–163. World Scientific,1989.

    Google Scholar 

  2. Domenico Cantone, Vincenzo Cutello, and Jacob T. Schwartz. Decision problems for Tarski’s and Presburger arithmetics extended with sets. In Proceedings of the fourth Computer Science Logic Workshop, volume 533 of Lecture Notes in Computer Science,pages 95–109. Springer,1990.

    Google Scholar 

  3. Domenico Cantone and Calogero G. Zarba. A tableau calculus for integrating firstorder reasoning with elementary set theory reasoning. In Roy Dyckhoff, ed., Automated Reasoning with Analytic Tableaux and Related Methods, volume 1847 of Lecture Notes in Artificial Intelligence, pages 143–159. Springer,2000.

    Google Scholar 

  4. Alfredo Ferro, Eugenio G. Omodeo, and Jacob T. Scwhartz. Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions. Communications on Pure and Applied Mathematics, 33(5):599–608, 1980.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  6. Cesare Tinelli and Mehdi T. Harandi. A new correctness proof of the Nelson-Oppen combination procedure. In Franz Baader and Klaus U. Schulz,eds., Frontiers of Combining Systems, volume 3 of Applied Logic Series,pages 103–120. Kluwer Academic Publishers, 1996.

    Google Scholar 

  7. John Venn. On the diagrammatic and mechanical representation of propositions and reasonings. The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science, 9(59):1–18, 1880.

    Google Scholar 

  8. Calogero G. Zarba. Combining lists with integers. In Rajeev Gorè, Alexander Leitsch, and Tobias Nipkow, eds., International Joint Conference on Automated Reasoning (Short Papers), Technical Report DII 11/01, pages 170–179. University of Siena, Italy, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Stanford University, Stanford

    Calogero G. Zarba

  2. University of Catania, Catania

    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. DIST, Università di Genova, Viale Causa 13, 15145, Genova, Italy

    Alessandro Armando

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zarba, C.G. (2002). Combining Sets with Integers. In: Armando, A. (eds) Frontiers of Combining Systems. FroCoS 2002. Lecture Notes in Computer Science(), vol 2309. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45988-X_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-45988-X_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation