A preliminary study of computational complexity in non-monotonic reasoning
In this work we analyze existing complexity results in the area of non-monotonic reasoning in general and argumentation in particular. Even though the area of argumentation is based on solid theoretical foundations, its main problems rely on the computational complexity of the system that have so fa...
Guardado en:
| Autores principales: | Capobianco, Marcela, Chesñevar, Carlos Iván, Simari, Guillermo Ricardo |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2005
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/21163 |
| Aporte de: |
Ejemplares similares
-
Building precompiled knowledge in ODeLP
por: Capobianco, Marcela, et al.
Publicado: (2006) -
Non prioritized reasoning in intelligent agents
por: Falappa, Marcelo Alejandro, et al.
Publicado: (2003) -
Kolmogorov complexity for possibly infinite computations
por: Figueira, Santiago, et al.
Publicado: (2003) -
Un marco argumentativo abstracto dinámico
por: Rotstein, Nicolás D.
Publicado: (2010) -
On the effect of dynamic environments in defeasible reasoning
por: Capobianco, Marcela
Publicado: (2001)