Model contractions on description logics

Autores
Falappa, Marcelo Alejandro; Moguillansky, Martín O.
Año de publicación
2007
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
When using tableaux algorithms to reason about Description Logics (DLs), new information is inferred from the models considered while trying to achieve knowledge satisfiability. By focusing the ontology change problem, we consider an environment where DLs are the logical formalization to express knowledge bases in the web, and the integration of distributed ontologies is developed under new extensions of the belief revision theories originally exposed in [1]. Hence, a reinforced theory arises in order to properly apply change operations over models, considering new inferred information and assumed beliefs in each possible world. As a result, a new type of contraction operator is proposed and its success postulate analyzed.
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
Informática
belief revision
description logics
tableau calculi
ontology change
Nonmonotonic reasoning and belief revision
Algorithms
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/23573
Acceder
id SEDICI_ceb1eeecf745bb6bd7e730c9e433e962
oai_identifier_str oai:sedici.unlp.edu.ar:10915/23573
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Model contractions on description logicsFalappa, Marcelo AlejandroMoguillansky, Martín O.Ciencias InformáticasInformáticabelief revisiondescription logicstableau calculiontology changeNonmonotonic reasoning and belief revisionAlgorithmsWhen using tableaux algorithms to reason about Description Logics (DLs), new information is inferred from the models considered while trying to achieve knowledge satisfiability. By focusing the ontology change problem, we consider an environment where DLs are the logical formalization to express knowledge bases in the web, and the integration of distributed ontologies is developed under new extensions of the belief revision theories originally exposed in [1]. Hence, a reinforced theory arises in order to properly apply change operations over models, considering new inferred information and assumed beliefs in each possible world. As a result, a new type of contraction operator is proposed and its success postulate analyzed.Red de Universidades con Carreras en Informática (RedUNCI)2007-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf1524-1536http://sedici.unlp.edu.ar/handle/10915/23573enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-10-15T10:48:09Zoai:sedici.unlp.edu.ar:10915/23573Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-10-15 10:48:09.585SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Model contractions on description logics
title Model contractions on description logics
spellingShingle Model contractions on description logics
Falappa, Marcelo Alejandro
Ciencias Informáticas
Informática
belief revision
description logics
tableau calculi
ontology change
Nonmonotonic reasoning and belief revision
Algorithms
title_short Model contractions on description logics
title_full Model contractions on description logics
title_fullStr Model contractions on description logics
title_full_unstemmed Model contractions on description logics
title_sort Model contractions on description logics
dc.creator.none.fl_str_mv Falappa, Marcelo Alejandro
Moguillansky, Martín O.
author Falappa, Marcelo Alejandro
author_facet Falappa, Marcelo Alejandro
Moguillansky, Martín O.
author_role author
author2 Moguillansky, Martín O.
author2_role author
dc.subject.none.fl_str_mv Ciencias Informáticas
Informática
belief revision
description logics
tableau calculi
ontology change
Nonmonotonic reasoning and belief revision
Algorithms
topic Ciencias Informáticas
Informática
belief revision
description logics
tableau calculi
ontology change
Nonmonotonic reasoning and belief revision
Algorithms
dc.description.none.fl_txt_mv When using tableaux algorithms to reason about Description Logics (DLs), new information is inferred from the models considered while trying to achieve knowledge satisfiability. By focusing the ontology change problem, we consider an environment where DLs are the logical formalization to express knowledge bases in the web, and the integration of distributed ontologies is developed under new extensions of the belief revision theories originally exposed in [1]. Hence, a reinforced theory arises in order to properly apply change operations over models, considering new inferred information and assumed beliefs in each possible world. As a result, a new type of contraction operator is proposed and its success postulate analyzed.
Red de Universidades con Carreras en Informática (RedUNCI)
description When using tableaux algorithms to reason about Description Logics (DLs), new information is inferred from the models considered while trying to achieve knowledge satisfiability. By focusing the ontology change problem, we consider an environment where DLs are the logical formalization to express knowledge bases in the web, and the integration of distributed ontologies is developed under new extensions of the belief revision theories originally exposed in [1]. Hence, a reinforced theory arises in order to properly apply change operations over models, considering new inferred information and assumed beliefs in each possible world. As a result, a new type of contraction operator is proposed and its success postulate analyzed.
publishDate 2007
dc.date.none.fl_str_mv 2007-10
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/23573
url http://sedici.unlp.edu.ar/handle/10915/23573
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.format.none.fl_str_mv application/pdf
1524-1536
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1846063908429758464
score 13.22299

Publicaciones similares