|
Registro Completo |
|
Biblioteca(s): |
Embrapa Agricultura Digital. |
|
Data corrente: |
04/06/1996 |
|
Data da última atualização: |
17/08/2007 |
|
Autoria: |
SIMARI, G. R.; GARCIA, A. J. |
|
Título: |
A knowledge representation language for defeasible argumentation. |
|
Ano de publicação: |
1995 |
|
Fonte/Imprenta: |
In: SEMINÁRIO INTEGRADO DE SOFTWARE E HARDWARE, 22.; CONFERÊNCIA LATINO-AMERICANA, 21., 1995, Canela. Anais... Porto Alegre: UFRGS, Instituto de Informática, 1995. |
|
Volume: |
v.1 |
|
Páginas: |
p.661-672 |
|
Idioma: |
Inglês |
|
Conteúdo: |
The goal of this work is to define a system for defeasible argumentation, as an extension of logic programming. Here, we define Defensible Logic Programs (DPL), and a notion of defeasible inference from a DLP. The characteristcs of a DLP allow to represent different flavors of the closed world assumption (CWA) just as program clauses, thus a CWA clause could be presented for some predicates and not for others. We will define an argument as a subset of a DLP, and therefore we can use some concepts of an argumentative system [12] in order to define the inference engine of the system. The semantics of a DLP is characterized by sets of positive, negative, undecided and unknown answers. Finally,we will define the behavior of an intepreter based upon this semantics. |
|
Categoria do assunto: |
-- |
|
Marc: |
LEADER 01306naa a2200157 a 4500
001 1002650
005 2007-08-17
008 1995 bl uuuu u00u1 u #d
100 1 $aSIMARI, G. R.
245 $aA knowledge representation language for defeasible argumentation.
260 $c1995
300 $ap.661-672 v.1
490 $vv.1
520 $aThe goal of this work is to define a system for defeasible argumentation, as an extension of logic programming. Here, we define Defensible Logic Programs (DPL), and a notion of defeasible inference from a DLP. The characteristcs of a DLP allow to represent different flavors of the closed world assumption (CWA) just as program clauses, thus a CWA clause could be presented for some predicates and not for others. We will define an argument as a subset of a DLP, and therefore we can use some concepts of an argumentative system [12] in order to define the inference engine of the system. The semantics of a DLP is characterized by sets of positive, negative, undecided and unknown answers. Finally,we will define the behavior of an intepreter based upon this semantics.
700 1 $aGARCIA, A. J.
773 $tIn: SEMINÁRIO INTEGRADO DE SOFTWARE E HARDWARE, 22.; CONFERÊNCIA LATINO-AMERICANA, 21., 1995, Canela. Anais... Porto Alegre: UFRGS, Instituto de Informática, 1995.
Download
Esconder MarcMostrar Marc Completo |
|
Registro original: |
Embrapa Agricultura Digital (CNPTIA) |
|
