lntroducing generalized specificity in logic programming
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 auton...
| Autores principales: | , , , |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2000
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/23656 |
| Aporte de: |
| id |
I19-R120-10915-23656 |
|---|---|
| record_format |
dspace |
| institution |
Universidad Nacional de La Plata |
| institution_str |
I-19 |
| repository_str |
R-120 |
| collection |
SEDICI (UNLP) |
| language |
Inglés |
| topic |
Ciencias Informáticas Knowledge Representation Formalisms and Methods Logic Programming Nonmonotonic reasoning and belief revision |
| spellingShingle |
Ciencias Informáticas Knowledge Representation Formalisms and Methods Logic Programming Nonmonotonic reasoning and belief revision Stolzenburg, Frieder García, Alejandro Javier Chesñevar, Carlos Iván Simari, Guillermo Ricardo lntroducing generalized specificity in logic programming |
| topic_facet |
Ciencias Informáticas Knowledge Representation Formalisms and Methods Logic Programming Nonmonotonic reasoning and belief revision |
| 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 |
| format |
Objeto de conferencia Objeto de conferencia |
| author |
Stolzenburg, Frieder García, Alejandro Javier Chesñevar, Carlos Iván Simari, Guillermo Ricardo |
| author_facet |
Stolzenburg, Frieder García, Alejandro Javier Chesñevar, Carlos Iván Simari, Guillermo Ricardo |
| author_sort |
Stolzenburg, Frieder |
| title |
lntroducing generalized specificity in logic programming |
| 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 |
| publishDate |
2000 |
| url |
http://sedici.unlp.edu.ar/handle/10915/23656 |
| work_keys_str_mv |
AT stolzenburgfrieder lntroducinggeneralizedspecificityinlogicprogramming AT garciaalejandrojavier lntroducinggeneralizedspecificityinlogicprogramming AT chesnevarcarlosivan lntroducinggeneralizedspecificityinlogicprogramming AT simariguillermoricardo lntroducinggeneralizedspecificityinlogicprogramming |
| bdutipo_str |
Repositorios |
| _version_ |
1764820466072027137 |