Sciweavers

24 search results - page 2 / 5
» A Logic Programming Framework for Possibilistic Argumentatio...
Sort
View
COMMA
2008
13 years 5 months ago
A Level-based Approach to Computing Warranted Arguments in Possibilistic Defeasible Logic Programming
Abstract. Possibilistic Defeasible Logic Programming (P-DeLP) is an argumentation framework based on logic programming which incorporates a treatment of possibilistic uncertainty a...
Teresa Alsinet, Carlos Iván Chesñeva...
DLOG
2008
13 years 6 months ago
Consistency Checking for Extended Description Logics
In this paper we consider the extensions of description logics that were proposed to represent uncertain or vague knowledge, focusing on the fuzzy and possibilistic formalisms. We ...
Olivier Couchariere, Marie-Jeanne Lesot, Bernadett...
COMMA
2010
12 years 10 months ago
A characterization of collective conflict for defeasible argumentation
In this paper we define a recursive semantics for warrant in a general defeasible argumentation framework by formalizing a notion of collective (non-binary) conflict among argumen...
Teresa Alsinet, Ramón Béjar, Lluis G...
ENC
2008
IEEE
13 years 10 months ago
Possibilistic-Based Argumentation: An Answer Set Programming Approach
In many fields of automated information processing it becomes crucial to consider together imprecise, uncertain or inconsistent information. Argumentation theory is a suitable fr...
Juan Carlos Nieves, Ulises Cortés, Mauricio...
ASP
2005
Springer
13 years 9 months ago
Possibilistic Stable Model Computing
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...
Pascal Nicolas, Claire Lefèvre