Generalized abstract argumentation: A first-order machinery towards ontology debugging

Autores
Moguillansky, Martin Oscar; Rotstein, Nicolas Daniel; Falappa, Marcelo Alejandro
Año de publicación
2010
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
Same as Dung's abstract argumentation framework (AF), the notion of generalized abstract argumentation framework (GenAF) aims at reasoning about inconsistency disregarding any logic for arguments; thus both the knowledge base (KB) and language to express beliefs remain unspecified. Nonetheless, reifying the abstract configuration of the AF argumentation machineries to specific logics may bring about some inconveniences. A GenAF is assumed to eventually relate first-order logic (FOL) formulae to abstract arguments. The main purpose of the generalization is to provide a theory capable of reasoning (following argumentation technics) about inconsistent knowledge bases (KB) expressed in any FOL fragment. Consequently, the notion of argument is related to a single formula in the KB. This allows to share the same primitive elements from both, the framework (arguments) and, the KB (formulae). A framework with such features would not only allow to manage a wide range of knowledge representation languages, but also to cope straightforwardly with the dynamics of knowledge. Once the formalism is presented, we propose a reification to the description logic ALC with the intention to handle ontology debugging. In this sense, since argumentation frameworks reason over graphs that relate arguments through attack, our methodology is proposed to bridge ontological inconsistency sources to attack relations in argumentation. Finally, an argumentation semantics adapted to GenAF's, is proposed as a consistency restoration tool with the objective of debugging and repairing ontologies. © AEPIA and the authors.
Fil: Moguillansky, Martin Oscar. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Ciencias e Ingeniería de la Computación. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación. Instituto de Ciencias e Ingeniería de la Computación; Argentina
Fil: Rotstein, Nicolas Daniel. Universidad Nacional del Sur; Argentina
Fil: Falappa, Marcelo Alejandro. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Ciencias e Ingeniería de la Computación. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación. Instituto de Ciencias e Ingeniería de la Computación; Argentina
Materia
ARGUMENTATION
DESCRIPTION LOGICS
FIRST-ORDER LOGIC
INCONSISTENCY TOLERANCE
ONTOLOGY DEBUGGING
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/66329

id CONICETDig_bc5d46eaeb8b07d3bfced04fc7adf8bb
oai_identifier_str oai:ri.conicet.gov.ar:11336/66329
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Generalized abstract argumentation: A first-order machinery towards ontology debuggingMoguillansky, Martin OscarRotstein, Nicolas DanielFalappa, Marcelo AlejandroARGUMENTATIONDESCRIPTION LOGICSFIRST-ORDER LOGICINCONSISTENCY TOLERANCEONTOLOGY DEBUGGINGhttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1Same as Dung's abstract argumentation framework (AF), the notion of generalized abstract argumentation framework (GenAF) aims at reasoning about inconsistency disregarding any logic for arguments; thus both the knowledge base (KB) and language to express beliefs remain unspecified. Nonetheless, reifying the abstract configuration of the AF argumentation machineries to specific logics may bring about some inconveniences. A GenAF is assumed to eventually relate first-order logic (FOL) formulae to abstract arguments. The main purpose of the generalization is to provide a theory capable of reasoning (following argumentation technics) about inconsistent knowledge bases (KB) expressed in any FOL fragment. Consequently, the notion of argument is related to a single formula in the KB. This allows to share the same primitive elements from both, the framework (arguments) and, the KB (formulae). A framework with such features would not only allow to manage a wide range of knowledge representation languages, but also to cope straightforwardly with the dynamics of knowledge. Once the formalism is presented, we propose a reification to the description logic ALC with the intention to handle ontology debugging. In this sense, since argumentation frameworks reason over graphs that relate arguments through attack, our methodology is proposed to bridge ontological inconsistency sources to attack relations in argumentation. Finally, an argumentation semantics adapted to GenAF's, is proposed as a consistency restoration tool with the objective of debugging and repairing ontologies. © AEPIA and the authors.Fil: Moguillansky, Martin Oscar. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Ciencias e Ingeniería de la Computación. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación. Instituto de Ciencias e Ingeniería de la Computación; ArgentinaFil: Rotstein, Nicolas Daniel. Universidad Nacional del Sur; ArgentinaFil: Falappa, Marcelo Alejandro. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Ciencias e Ingeniería de la Computación. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación. Instituto de Ciencias e Ingeniería de la Computación; ArgentinaSociedad Iberoamericana de Inteligencia Artificial2010-03info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/66329Moguillansky, Martin Oscar; Rotstein, Nicolas Daniel; Falappa, Marcelo Alejandro; Generalized abstract argumentation: A first-order machinery towards ontology debugging; Sociedad Iberoamericana de Inteligencia Artificial; Inteligencia Artificial; 14; 46; 3-2010; 17-331137-36011988-3064CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/http://journaldocs.iberamia.org/articles/626/article%20%281%29.pdfinfo:eu-repo/semantics/altIdentifier/doi/10.4114/ia.v14i46.1510info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-29T10:01:59Zoai:ri.conicet.gov.ar:11336/66329instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-29 10:01:59.855CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Generalized abstract argumentation: A first-order machinery towards ontology debugging
title Generalized abstract argumentation: A first-order machinery towards ontology debugging
spellingShingle Generalized abstract argumentation: A first-order machinery towards ontology debugging
Moguillansky, Martin Oscar
ARGUMENTATION
DESCRIPTION LOGICS
FIRST-ORDER LOGIC
INCONSISTENCY TOLERANCE
ONTOLOGY DEBUGGING
title_short Generalized abstract argumentation: A first-order machinery towards ontology debugging
title_full Generalized abstract argumentation: A first-order machinery towards ontology debugging
title_fullStr Generalized abstract argumentation: A first-order machinery towards ontology debugging
title_full_unstemmed Generalized abstract argumentation: A first-order machinery towards ontology debugging
title_sort Generalized abstract argumentation: A first-order machinery towards ontology debugging
dc.creator.none.fl_str_mv Moguillansky, Martin Oscar
Rotstein, Nicolas Daniel
Falappa, Marcelo Alejandro
author Moguillansky, Martin Oscar
author_facet Moguillansky, Martin Oscar
Rotstein, Nicolas Daniel
Falappa, Marcelo Alejandro
author_role author
author2 Rotstein, Nicolas Daniel
Falappa, Marcelo Alejandro
author2_role author
author
dc.subject.none.fl_str_mv ARGUMENTATION
DESCRIPTION LOGICS
FIRST-ORDER LOGIC
INCONSISTENCY TOLERANCE
ONTOLOGY DEBUGGING
topic ARGUMENTATION
DESCRIPTION LOGICS
FIRST-ORDER LOGIC
INCONSISTENCY TOLERANCE
ONTOLOGY DEBUGGING
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv Same as Dung's abstract argumentation framework (AF), the notion of generalized abstract argumentation framework (GenAF) aims at reasoning about inconsistency disregarding any logic for arguments; thus both the knowledge base (KB) and language to express beliefs remain unspecified. Nonetheless, reifying the abstract configuration of the AF argumentation machineries to specific logics may bring about some inconveniences. A GenAF is assumed to eventually relate first-order logic (FOL) formulae to abstract arguments. The main purpose of the generalization is to provide a theory capable of reasoning (following argumentation technics) about inconsistent knowledge bases (KB) expressed in any FOL fragment. Consequently, the notion of argument is related to a single formula in the KB. This allows to share the same primitive elements from both, the framework (arguments) and, the KB (formulae). A framework with such features would not only allow to manage a wide range of knowledge representation languages, but also to cope straightforwardly with the dynamics of knowledge. Once the formalism is presented, we propose a reification to the description logic ALC with the intention to handle ontology debugging. In this sense, since argumentation frameworks reason over graphs that relate arguments through attack, our methodology is proposed to bridge ontological inconsistency sources to attack relations in argumentation. Finally, an argumentation semantics adapted to GenAF's, is proposed as a consistency restoration tool with the objective of debugging and repairing ontologies. © AEPIA and the authors.
Fil: Moguillansky, Martin Oscar. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Ciencias e Ingeniería de la Computación. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación. Instituto de Ciencias e Ingeniería de la Computación; Argentina
Fil: Rotstein, Nicolas Daniel. Universidad Nacional del Sur; Argentina
Fil: Falappa, Marcelo Alejandro. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Ciencias e Ingeniería de la Computación. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación. Instituto de Ciencias e Ingeniería de la Computación; Argentina
description Same as Dung's abstract argumentation framework (AF), the notion of generalized abstract argumentation framework (GenAF) aims at reasoning about inconsistency disregarding any logic for arguments; thus both the knowledge base (KB) and language to express beliefs remain unspecified. Nonetheless, reifying the abstract configuration of the AF argumentation machineries to specific logics may bring about some inconveniences. A GenAF is assumed to eventually relate first-order logic (FOL) formulae to abstract arguments. The main purpose of the generalization is to provide a theory capable of reasoning (following argumentation technics) about inconsistent knowledge bases (KB) expressed in any FOL fragment. Consequently, the notion of argument is related to a single formula in the KB. This allows to share the same primitive elements from both, the framework (arguments) and, the KB (formulae). A framework with such features would not only allow to manage a wide range of knowledge representation languages, but also to cope straightforwardly with the dynamics of knowledge. Once the formalism is presented, we propose a reification to the description logic ALC with the intention to handle ontology debugging. In this sense, since argumentation frameworks reason over graphs that relate arguments through attack, our methodology is proposed to bridge ontological inconsistency sources to attack relations in argumentation. Finally, an argumentation semantics adapted to GenAF's, is proposed as a consistency restoration tool with the objective of debugging and repairing ontologies. © AEPIA and the authors.
publishDate 2010
dc.date.none.fl_str_mv 2010-03
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/66329
Moguillansky, Martin Oscar; Rotstein, Nicolas Daniel; Falappa, Marcelo Alejandro; Generalized abstract argumentation: A first-order machinery towards ontology debugging; Sociedad Iberoamericana de Inteligencia Artificial; Inteligencia Artificial; 14; 46; 3-2010; 17-33
1137-3601
1988-3064
CONICET Digital
CONICET
url http://hdl.handle.net/11336/66329
identifier_str_mv Moguillansky, Martin Oscar; Rotstein, Nicolas Daniel; Falappa, Marcelo Alejandro; Generalized abstract argumentation: A first-order machinery towards ontology debugging; Sociedad Iberoamericana de Inteligencia Artificial; Inteligencia Artificial; 14; 46; 3-2010; 17-33
1137-3601
1988-3064
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/http://journaldocs.iberamia.org/articles/626/article%20%281%29.pdf
info:eu-repo/semantics/altIdentifier/doi/10.4114/ia.v14i46.1510
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Sociedad Iberoamericana de Inteligencia Artificial
publisher.none.fl_str_mv Sociedad Iberoamericana de Inteligencia Artificial
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1844613819103444992
score 13.069144