Skip to main content
SpringerLink
Log in

Nonstandard set theories and information management

  • Published:
Journal of Intelligent Information Systems Aims and scope Submit manuscript

Abstract

The merits of set theory as a foundational tool in mathematics stimulate its use in various areas of artificial intelligence, in particular intelligent information systems. In this paper, a study of various nonstandard treatments of set theory from this perspective is offered. Applications of these alternative set theories to information or knowledge management are surveyed.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • AczelP. (1988).Nonwellfounded Sets. Number 14 in CSLI Lecture Notes, Center for the Study of Language and Information, Stanford, CA.

    Google Scholar 

  • Akman, V. and Pakkan, M. (1993). HYPERSOLVER: A Graphical Tool for Commonsense Set Theory. In L. Gün, R. Önvural, and E. Gelenbe (eds.),Proceedings of Eight International Symposium on Computer and Information Sciences, Istanbul, Turkey.

  • BarwiseJ. (1975).Admissible Sets and Structures, Berlin: Springer-Verlag.

    Google Scholar 

  • BarwiseJ. (1977). An Introduction to First Order Logic. In J.Barwise (ed.),Handbook of Mathematical Logic (pp. 5–46), North-Holland, Amsterdam.

    Google Scholar 

  • BarwiseJ. (1985). Model-Theoretic Logics: Background and Aims. In J.Barwise and S.Feferman (eds.),Model-Theoretic Logics (pp. 3–23), New York: Springer-Verlag.

    Google Scholar 

  • BarwiseJ. (1989a). Situations, Sets, and the Axiom of Foundation. In J. Barwise,The Situation in Logic (pp. 177–200), Number 17 in CSLI Lecture Notes, Center for the Study of Language and Information, Stanford, CA.

    Google Scholar 

  • BarwiseJ. (1989b). Situated Set Theory. In J. Barwise,The Situation in Logic (pp. 289–292), Number 17 in CSLI Lecture Notes, Center for the Study of Language and Information, Stanford, CA.

    Google Scholar 

  • BarwiseJ. (1989c). AFA and the Unification of Information. In J. Barwise,The Situation in Logic (pp. 277–283), Number 17 in CSLI Lecture Notes, Center for the Study of Language and Information, Stanford, CA.

    Google Scholar 

  • BarwiseJ. (1989d). On the Model Theory of Common Knowledge. In J. Barwise,The Situation in Logic (pp. 201–220), Number 17 in CSLI Lecture Notes, Center for the Study of Language and Information, Stanford, CA.

    Google Scholar 

  • BarwiseJ. (1990). Consistency and Logical Consequence. In J.M.Dunn and A.Gupta (eds.),Truth or Consequences (pp. 111–122), Holland: Kluwer, Dordrecht.

    Google Scholar 

  • BarwiseJ. (1992).Applying AFA: Notes for a Tutorial on Nonwellfounded Sets, Manuscript, Department of Mathematics, Indiana University, Bloomington, IN.

    Google Scholar 

  • BarwiseJ. and EtchemendyJ. (1987).The Liar: An Essay on Truth and Circularity, New York: Oxford University Press.

    Google Scholar 

  • BarwiseJ. and MossL.S. (1991). Hypersets.Mathematical Intelligence, 13, 31–41.

    Google Scholar 

  • BarwiseJ. and PerryJ. (1983).Situations and Attitudes, Cambridge, MA: MIT Press.

    Google Scholar 

  • BoyerR., LuskE., McCuneW., OverbeekR., StickelM., and WosL. (1986). Set Theory in First Order Logic.Journal of Automated Reasoning, 2, 287–327.

    Google Scholar 

  • BrachmanR.J. and SchmolzeJ.G. (1985). An Overview of the KL-ONE Knowledge Representation System.Cognitive Science, 9, 171–216.

    Google Scholar 

  • BrownF.M. (1978). Towards the Automation of Set Theory and its Logic.Artificial Intelligence, 10, 281–316.

    Google Scholar 

  • CowenR. (1993). Some Connections Between Set Theory and Computer Science. InProceedings of Third Kurt Gödel Colloquium, Number 713 in Lecture Notes in Computer Science, Berlin: Springer-Verlag.

    Google Scholar 

  • Dionne, R., Mays, E., and Oles, F.J. (1992). A Nonwellfounded Approach to Terminological Cycles. InProceeding of AAAI-3-92, San Jose, CA.

  • FefermanS. (1984). Toward Useful Type-Free Theories, I.Journal of Symbolic Logic, 49, 75–111.

    Google Scholar 

  • FraenkelA.A., Bar-HillelY., and LevyA. (1973).Foundations of Set Theory, North-Holland, Amsterdam.

    Google Scholar 

  • GilmoreP. (1974). The Consistency of Partial Set Theory without Extensionality. In T.J.Jech (ed.),Axiomatic Set Theory (pp. 147–153), American Mathematical Society, Providence, RI.

    Google Scholar 

  • GilmoreP. (1993). Logic, Sets, and Mathematics.The Mathematical Intelligencer, 15, 10–19.

    Google Scholar 

  • GoldblattR. (1984).Topoi: The Categorial Analysis of Logic, North-Holland, Amsterdam.

    Google Scholar 

  • HalmosP.R. (1974).Naive Set Theory, New York: Springer-Verlag.

    Google Scholar 

  • vanHeijenhoortJ. (1967).From Frege to Gödel, Cambridge, MA: Harvard University Press.

    Google Scholar 

  • McCarthyJ. (1959). Programs with Common Sense. In V.Lifschitz (ed.),Formalizing Common Sense: Papers by John McCarthy (pp. 9–16), Ablex, Norwood, NJ.

    Google Scholar 

  • McCarthyJ. (1983). Artificial Intelligence Needs More Emphasis on Basic Research: President's Quarterly Message.AI Magazine, 4, 5.

    Google Scholar 

  • McCarthyJ. (1984). We Need Better Standards for Artificial Intelligence Research: President's Message.AI Magazine, 5, 7–8.

    Google Scholar 

  • McCarthy, J. (1985). Acceptance Address,International Joint Conference on Artificial Intelligence (IJCAI) Award for Research Excellence, Los Angeles, CA.

  • MisloveM.W., MossL.S., and OlesF.J. (1990). Partial Sets. In R.Cooper, K.Mukai, and J.Perry (eds.),Situation Theory and Its Applications I (pp. 117–131), Number 22 in CSLI Lecture Notes, Center for the Study of Language and Information, Stanford, CA.

    Google Scholar 

  • MisloveM.W., MossL.S., and OlesF.J. (1991). Nonwellfounded Sets Modeled as Ideal Fixed Points.Information and Computation, 93, 16–54.

    Google Scholar 

  • Pakkan, M. (1993).Solving Equations in the Universe of Hypersets, M.S. Thesis, Department of Computer Engineering and Information Science, Bilkent University, Ankara, Turkey.

  • ParsonsC. (1977). What is the Iterative Conception of Set? In R.E.Butts and J.Hintikka (eds.),Logic, Foundations of Mathematics, and Computability Theory (pp. 339–345), Holland: Kluwer, Dordrecht.

    Google Scholar 

  • PerlisD. (1985). Languages with Self-Reference I: Foundations.Artificial Intelligence, 25, 301–322.

    Google Scholar 

  • PerlisD. (1988). Commonsense Set Theory. In P.Maes and D.Nardi (eds.),Meta-Level Architectures and Reflection (pp. 87–98), Elsevier, Amsterdam.

    Google Scholar 

  • QuaifeA. (1992). Automated Deduction in von Neumann-Bernays-Gödel Set Theory.Journal of Automated Reasoning, 8, 91–147.

    Google Scholar 

  • QuineW.V. (1937). New Foundations for Mathematical Logic.American Mathematical Monthly, 44, 70–80.

    Google Scholar 

  • ShoenfieldJ.R. (1977). Axioms of Set Theory. In J.Barwise (ed.),Handbook of Mathematical Logic (pp. 321–344), North-Holland, Amsterdam.

    Google Scholar 

  • SuppesP. (1972).Axiomatic Set Theory, New York: Dover.

    Google Scholar 

  • TilesM. (1989).The Philosophy of Set Theory, UK: Basil Blackwell, Oxford.

    Google Scholar 

  • WhiteheadA.N. and RussellB. (1910).Principia Mathematica, Three Volumes, Cambridge, UK: Cambridge University Press.

    Google Scholar 

  • WoodsW.A. (1991). Understanding Subsumption and Taxonomy: A Framework for Progress. In J.F.Sowa (ed.),Principles of Semantic Networks, San Mateo, CA: Morgan Kaufmann.

    Google Scholar 

  • YasukawaH. and YokotaK. (1991).Labeled Graphs as Semantics of Objects, Manuscript,QUIXOTE Project, Institute for New Generation Computer Technology (ICOT), Tokyo.

    Google Scholar 

  • Yokota, K. and Yasukawa, H. (1992). Towards and Integrated Knowledge-Base Management System: Overview of R&D on Databases and Knowledge-Bases in the FGCS Project. InProceedings of Fifth Generation Computer Systems, Tokyo.

  • ZadroznyW. (1989). Cardinalities and Well-Orderings in a Common-Sense Set Theory. In R.J.Brachman, H.J.Levesque, and R.Reiter (eds.),Proceedings of First International Conference on Principles of Knowledge Representation and Reasoning (pp. 486–497), San Mateo, CA: Morgan Kaufmann.

    Google Scholar 

  • Zadrozny, W. and Kim, M. (1993). Computational Mereology: A Prolegomenon Illuminated by a Study of PartOf Relations for Multimedia Indexing. InProceedings of Bar-Ilan Symposium on the Foundations of AI (BISFAI-93), Israel.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering and Information Science, Bilkent University, Bilkent, 06533, Ankara, Turkey

    Varol Akman

  2. Department of Computer Engineering, Bosphorus University, Bebek, 80815, Istanbul, Turkey

    Müjdat Pakkan

Authors
  1. Varol Akman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Müjdat Pakkan
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Akman, V., Pakkan, M. Nonstandard set theories and information management. J Intell Inf Syst 6, 5–31 (1996). https://doi.org/10.1007/BF00712384

Download citation

  • Issue Date:

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

Keywords

Search

Navigation