A Logic-Based Theory of Deductive Arguments
|
Descargar SCORM
Este recurso ha sido solicitado 1 veces (0 veces en los últimos 31 días).
Para poder solicitar este recurso debe identificarse como usuario de la biblioteca
|
| |
Ver
Detalles del recurso
|
|
|
A Logic-Based Theory of Deductive Arguments
|
| Id. |
42064660 |
| Idioma |
inglés
|
| Titulo |
A Logic-Based Theory of Deductive Arguments |
| Localización |
http://citeseer.ist.psu.edu/629122.html
|
| Versión |
1.0 |
| Estado |
Final
|
| Descripción |
We explore a framework for argumentation (based on classical logic) in which an
argument is a pair where the first item in the pair is a minimal consistent set of
formulae that proves the second item (which is a formula). We provide some basic
definitions for arguments, and various kinds of counter-arguments (defeaters).
This leads us to the definition of canonical undercuts which we argue are the only
defeaters that we need to take into account. We then motivate and formalise the
notion of argument trees and argument structures which provide a way of exhaustively
collating arguments and counter-arguments. We use argument structures as
the basis of our general proposal for argument aggregation. |
| Tipo |
ps |
| Palabras clave |
A Logic-Based Theory of Deductive Arguments |
| Tipo de Interactividad |
Expositivo
|
| Nivel de Interactividad |
muy bajo
|
| Audiencia |
Estudiante
Profesor
Autor
|
| Estructura |
Atomic |
| Coste |
no
|
| Copyright |
sí
|
|
unrestricted |
| Formatos |
ps |
| Requerimientos técnicos |
Browser: Any |
| Relación |
[IsBasedOn] http://www.cs.ucl.ac.uk/staff/a.hunter/papers/agg.ps
[References] oai:CiteSeerPSU:88311
[References] oai:CiteSeerPSU:79198
[References] oai:CiteSeerPSU:1907
[References] oai:CiteSeerPSU:7707
[References] oai:CiteSeerPSU:57082
[References] oai:CiteSeerPSU:25289
[References] oai:CiteSeerPSU:285081
[References] oai:CiteSeerPSU:679970
[References] oai:CiteSeerPSU:259514
|
| Fecha de contribución |
31-mar-2009 |
|
|
|
|
Valoración de los usuarios
No hay ninguna valoración para este recurso. Sea el primero en
valorar este recurso.
|
|
|
|