Closed world assumption

from Wikipedia, the free encyclopedia

The closed world assumption (German: acceptance to the world seclusion ) in the modeling of situations ( knowledge representation ) states that anything not explicitly than can be proved true, as is wrongly : Everything is therefore not modeled, exist in your model neither and is not provable, i.e. wrong, that is, not deducible. In predicate logic , this assumption does not hold.

Examples

Examples of closed world assumption

Bus or train timetables
If a bus or train is scheduled to depart every hour on the hour, the reverse conclusion that it does not depart at other times is entirely legitimate (and even mandatory).

Example for open world assumption

Directory assistance system
If a number is in the system, information about it can be given. It cannot be closed, however, who is not in the phone book does not have a telephone , as there are people who cannot be entered. The assumption that the world is closed makes no sense here.

literature

  • Marco Cadoli, Maurizio Lenzerini: The complexity of propositional closed world reasoning and circumscription . In: Academic Press (Ed.): Journal of Computer and System Sciences . tape 48 , no. 2 , April 1994, pp. 255-310 , doi : 10.1016 / S0022-0000 (05) 80004-2 .
  • T. Eiter, G. Gottlob (1993). Propositional circumscription and extended closed world reasoning are -complete. Theoretical Computer Science , 114: 231-45.
  • A. Rajasekar, J. Lobo, and J. Minker (1989). Weak generalized closed world assumption. Journal of Automated Reasoning , 5: 293-307.
  • V. Lifschitz (1985). Closed-world databases and circumscription. Artificial Intelligence , 27: 229-35.
  • Jack Minker (1982). On indefinite databases and the closed world assumption. In Proceedings of the Sixth International Conference on Automated Deduction (CADE'82) , pp. 292-308.
  • Ray Reiter (1978). On closed world data bases. In H. Gallaire and J. Minker, editors, Logic and Data Bases , pp. 119-40. Plenary Publ. Co., New York.
  • Y. Duan, C. Cruz (2011), Formalizing Semantic of Natural Language through Conceptualization from Existence. International Journal of Innovation, Management and Technology , 2 (1): 37-42.