Unique name assumption

Unique name assumption

The Unique Name Assumption (UNA) is a concept from ontology languages and Description Logics. In logics with the unique name assumption, different names always refer to different entities in the world [Stuart J. Russell and Peter Norvig, Artificial Intelligence, A Modern Approach, Second Edition, Prentis Hall, Upper Saddle River, New Jersey, 2003, page 133] . The ontology language OWL does not make this assumption, but provides explicit constructs to express that two names denote distinct entities [ [http://www.w3.org/TR/owl-ref/] OWL Web Ontology Language Reference] .
* owl:sameAs is the OWL property that states that two given named individuals have the same identity.
* owl:differentFrom is the OWL property that states that two given named individuals have different identities.

ee also

* Closed World Assumption

References


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Assumption College of Davao — Infobox University name = Assumption College of Davao established = 1958 type = Private Pre school, Tertiary, Secondary, College, Vocational, Roman Catholic location = J.P. Cabaguio Avenue, Davao City, Philippines website=… …   Wikipedia

  • Closed world assumption — The closed world assumption (CWA) is the presumption that what is not currently known to be true, is false. The same name also refers to a logical formalization of this assumption by Raymond Reiter. The opposite of the closed world assumption is… …   Wikipedia

  • Family name — Last name redirects here. For the song, see Last Name. Family name Frankenstein, an example of compound German family names which were typical for Jews (New Jewish Cemetery, Prague) A family name (in Western contexts often referred to as a last… …   Wikipedia

  • List of band name etymologies — This is a list of band names with their name origins explained and referenced. CompactTOC8 name=Contents side=yes center=yes right= align= nobreak=yes top= num=yes sym= symnum= custom2= custom3= seealso=yes notesfirst= refs=yes notes= extlinks=… …   Wikipedia

  • Planner (programming language) — Planner (often seen in publications as PLANNER although it is not an acronym) is a programming language designed by Carl Hewitt at MIT, and first published in 1969. First, subsets such as Micro Planner and Pico Planner were implemented, and then… …   Wikipedia

  • Description logic — (DL) is a family of formal knowledge representation languages. It is more expressive than propositional logic but has more efficient decision problems than first order predicate logic. DL is used in artificial intelligence for formal reasoning on …   Wikipedia

  • Дескрипционная логика — Описательные логики[1] или дескрипционные логики[2][источник не указан 861 день](сокр. ДЛ, англ. description logics, иногда используется неточный перевод: дескриптивные логики)  семейство языков представления знаний …   Википедия

  • Lógica de descripción — Las lógicas de descripción, también llamadas lógicas descriptivas (DL por description logics) son una familia de lenguajes de representación del conocimiento que pueden ser usados para representar conocimiento terminológico de un dominio de… …   Wikipedia Español

  • UNA — may refer to:* National University of Asunción, Paraguay s oldest and biggest university * United Nations Association * Una, South Carolina * Union of North America * Ukrainian People s Army, the military of a short lived Ukrainian Republic,… …   Wikipedia

  • Directory Information Tree — A Directory Information Tree (DIT) is data represented in a hierarchical tree like structure consisting of the Distinguished names (DNs) of the directory entries.Both the X.500 protocols and the Lightweight Directory Access Protocol (LDAP) use… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”