Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

A fast saturation strategy for set-theoretic tableaux

  • Contributed Papers
  • Conference paper
  • First Online:
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 1997)

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

  • 121 Accesses

Abstract

In this paper we present a fast tableau saturation strategy which can be used as an optimized decision procedure for some fragments of set theory.

Such a strategy is based on the use of a model checking technique which guides the saturation process. As a result, it turns out that the saturation process converges much faster than previous decision algorithms either to a closed tableau or to a model satisfying the input formula.

For the sake of simplicity, the strategy is illustrated for the extension MLSS of MLS with the finite enumeration operator {•,•,⋯, •}.

This research was partially supported by C.N.R. of Italy, Research Project No. 95.00411.CT12 (S.E.T.A.), and by MURST 40% project Calcolo algebrico e simbolico.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Caferra and N. Zabel A Method for Simultaneous Search for Refutations and Models by Equational Constraint Solving. Journal of Logic and Computation, 13:613–641, 1992.

    Google Scholar 

  2. D. Cantone and A. Ferro. Techniques of computable set theory with applications to proof verification. Comm. Pure App. Math., 48(9–10):1–45, 1995. Special Issue in honor of J.T. Schwartz.

    Google Scholar 

  3. D. Cantone, A. Ferro, and E. G. Omodeo. Computable Set Theory. Vol. 1. Oxford University Press, 1989. Int. Series of Monographs on Computer Science.

    Google Scholar 

  4. D. Cantone and R. Ruggeri Cannata. Deciding set-theoretic formulae with the predicate finite by a tableau calculus. Matematiche, 50(2):99–118, 1995.

    Google Scholar 

  5. D. Cantone and R. Ruggeri Cannata. A decidable tableau calculus for a fragment of set theory with iterated membership. To appear in Journal of Automated Reasoning, 1997.

    Google Scholar 

  6. M.C. Fitting. First-Order Logic and Automated Theorem Proving. Springer-Verlag, 1990.

    Google Scholar 

  7. A. Ferro, E. G. Omodeo, and J. T. Schwartz. Decision Procedures for Elementary Sublanguages of Set Theory I. Multilevel Syllogistic and Some Extensions. Communications on Pure and Applied Mathematics, 33:599–608, 1980.

    Google Scholar 

  8. T.J. Jech. Set theory. Academic Press, New York, 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica, Università di Catania, Viale A. Doria, 6, I-95125, Catania, Italy

    Domenico Cantone

Authors
  1. Domenico Cantone
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Didier Galmiche

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cantone, D. (1997). A fast saturation strategy for set-theoretic tableaux. In: Galmiche, D. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 1997. Lecture Notes in Computer Science, vol 1227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027409

Download citation

  • DOI: https://doi.org/10.1007/BFb0027409

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62920-7

  • Online ISBN: 978-3-540-69046-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation