lntroducing generalized specificity in logic programming

Autores
Stolzenburg, Frieder; García, Alejandro Javier; Chesñevar, Carlos Iván; Simari, Guillermo Ricardo
Año de publicación
2000
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
Most formalisms for representing common-sense knowledge allow incomplete and potentially inconsistent information. When strong negation is also allowed, contradictory conclusions can arise. A criterion for deciding between them is needed. The aim of this paper is to investigate an inherent and autonomous comparison criterion, based on specificity as defined in [19, 22]. In contrast to other approaches, we consider not only defeasible, but also strict knowledge. Our criterion is context-sensitive, i.e. preference among defeasible rules is determined dynamically during the dialectical analysis. We show how specificity can be defined in terms of two different approaches: activation sets and derivation trees. This allows us to get a more syntactic criterion that can be implemented in a computationally attractive way. The resulting definitions may be applied in general rule-based formalisms. We present theorems linking both characterizations. Finally we discuss other frameworks for defeasible reasoning in which preference handling is considered explicitly
Área: Informática Teórica - Inteligencia Artificial - Lenguajes - Compiladores
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
Knowledge Representation Formalisms and Methods
Logic Programming
Nonmonotonic reasoning and belief revision
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/23656

id SEDICI_db56e9ebee2acc19422471f676120797
oai_identifier_str oai:sedici.unlp.edu.ar:10915/23656
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling lntroducing generalized specificity in logic programmingStolzenburg, FriederGarcía, Alejandro JavierChesñevar, Carlos IvánSimari, Guillermo RicardoCiencias InformáticasKnowledge Representation Formalisms and MethodsLogic ProgrammingNonmonotonic reasoning and belief revisionMost formalisms for representing common-sense knowledge allow incomplete and potentially inconsistent information. When strong negation is also allowed, contradictory conclusions can arise. A criterion for deciding between them is needed. The aim of this paper is to investigate an inherent and autonomous comparison criterion, based on specificity as defined in [19, 22]. In contrast to other approaches, we consider not only defeasible, but also strict knowledge. Our criterion is context-sensitive, i.e. preference among defeasible rules is determined dynamically during the dialectical analysis. We show how specificity can be defined in terms of two different approaches: activation sets and derivation trees. This allows us to get a more syntactic criterion that can be implemented in a computationally attractive way. The resulting definitions may be applied in general rule-based formalisms. We present theorems linking both characterizations. Finally we discuss other frameworks for defeasible reasoning in which preference handling is considered explicitlyÁrea: Informática Teórica - Inteligencia Artificial - Lenguajes - CompiladoresRed de Universidades con Carreras en Informática (RedUNCI)2000-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/23656enginfo: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-09-29T10:55:31Zoai:sedici.unlp.edu.ar:10915/23656Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 10:55:31.805SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv lntroducing generalized specificity in logic programming
title lntroducing generalized specificity in logic programming
spellingShingle lntroducing generalized specificity in logic programming
Stolzenburg, Frieder
Ciencias Informáticas
Knowledge Representation Formalisms and Methods
Logic Programming
Nonmonotonic reasoning and belief revision
title_short lntroducing generalized specificity in logic programming
title_full lntroducing generalized specificity in logic programming
title_fullStr lntroducing generalized specificity in logic programming
title_full_unstemmed lntroducing generalized specificity in logic programming
title_sort lntroducing generalized specificity in logic programming
dc.creator.none.fl_str_mv Stolzenburg, Frieder
García, Alejandro Javier
Chesñevar, Carlos Iván
Simari, Guillermo Ricardo
author Stolzenburg, Frieder
author_facet Stolzenburg, Frieder
García, Alejandro Javier
Chesñevar, Carlos Iván
Simari, Guillermo Ricardo
author_role author
author2 García, Alejandro Javier
Chesñevar, Carlos Iván
Simari, Guillermo Ricardo
author2_role author
author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
Knowledge Representation Formalisms and Methods
Logic Programming
Nonmonotonic reasoning and belief revision
topic Ciencias Informáticas
Knowledge Representation Formalisms and Methods
Logic Programming
Nonmonotonic reasoning and belief revision
dc.description.none.fl_txt_mv Most formalisms for representing common-sense knowledge allow incomplete and potentially inconsistent information. When strong negation is also allowed, contradictory conclusions can arise. A criterion for deciding between them is needed. The aim of this paper is to investigate an inherent and autonomous comparison criterion, based on specificity as defined in [19, 22]. In contrast to other approaches, we consider not only defeasible, but also strict knowledge. Our criterion is context-sensitive, i.e. preference among defeasible rules is determined dynamically during the dialectical analysis. We show how specificity can be defined in terms of two different approaches: activation sets and derivation trees. This allows us to get a more syntactic criterion that can be implemented in a computationally attractive way. The resulting definitions may be applied in general rule-based formalisms. We present theorems linking both characterizations. Finally we discuss other frameworks for defeasible reasoning in which preference handling is considered explicitly
Área: Informática Teórica - Inteligencia Artificial - Lenguajes - Compiladores
Red de Universidades con Carreras en Informática (RedUNCI)
description Most formalisms for representing common-sense knowledge allow incomplete and potentially inconsistent information. When strong negation is also allowed, contradictory conclusions can arise. A criterion for deciding between them is needed. The aim of this paper is to investigate an inherent and autonomous comparison criterion, based on specificity as defined in [19, 22]. In contrast to other approaches, we consider not only defeasible, but also strict knowledge. Our criterion is context-sensitive, i.e. preference among defeasible rules is determined dynamically during the dialectical analysis. We show how specificity can be defined in terms of two different approaches: activation sets and derivation trees. This allows us to get a more syntactic criterion that can be implemented in a computationally attractive way. The resulting definitions may be applied in general rule-based formalisms. We present theorems linking both characterizations. Finally we discuss other frameworks for defeasible reasoning in which preference handling is considered explicitly
publishDate 2000
dc.date.none.fl_str_mv 2000-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/23656
url http://sedici.unlp.edu.ar/handle/10915/23656
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
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_ 1844615814822494208
score 13.070432