01306naa a2200157 a 450000100080000000500110000800800410001910000180006024500700007826000090014830000180015749000080017552007760018370000180095977301710097710026502007-08-17       1995    bl uuuu     u00u1 u    #d1 aSIMARI, G. R.  aA knowledge representation language for defeasible argumentation.  c1995  ap.661-672 v.1  vv.1  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.1 aGARCIA, A. J.  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.