Result: Argument-based expansion operators in possibilistic defeasible logic programming : Characterization and logical properties

Title:
Argument-based expansion operators in possibilistic defeasible logic programming : Characterization and logical properties
Authors:
CHESNEVAR, Carlos I, SIMARI, Guillermo R, GODO, Lluis, ALSINET, Teresa
Source:
Symbolic and quantitative approaches to reasoning with uncertainty (Barcelona, 6-8 July 2005)Lecture notes in computer science. :353-365
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 16 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Intelligence artificielle, Artificial intelligence, Argumentation, Argumentación, Circonscription, Circumscription, Circonscripción, Incertitude, Uncertainty, Incertidumbre, Inférence, Inference, Inferencia, Intelligence artificielle, Artificial intelligence, Inteligencia artificial, Langage programmation logique, Logic programming languages, Logique floue, Fuzzy logic, Lógica difusa, Modélisation, Modeling, Modelización, Programmation logique, Logical programming, Programación lógica, Théorie possibilité, Possibility theory, Teoría posibilidad, Théorie programmation, Programming theory
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Departament of Computer Science - Universitat de Lleida, C/Jaume II, 69, 25001 Lleida, Spain
Department of Computer Science and Engineering - Universidad Nacional del Sur, Alem 1253, (8000) Bahía Blanca, Argentina
Artificial Intelligence Research Institute (IIIA-CSIC), Campus UAB, 08193 Bellaterra, Barcelona, Spain
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=16991307
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.16991307
Database:
PASCAL Archive

Further Information

Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well the treatment of possibilistic uncertainty and fuzzy knowledge at object-language level. Defeasible argumentation in general and P-DeLP in particular provide a way of modelling non-monotonic inference. From a logical viewpoint, capturing defeasible inference relationships for modelling argument and warrant is particularly important, as well as the study of their logical properties. This paper analyzes two non-monotonic operators for P-DeLP which model the expansion of a given program P by adding new weighed facts associated with argument conclusions and warranted literals, resp. Different logical properties for the proposed expansion operators are studied and contrasted with a traditional SLD-based Horn logic. We will show that this analysis provides useful comparison criteria that can be extended and applied to other argumentation frameworks.