Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

25

ENC
2008
IEEE

favoriteEmaildiscussreport

145views Theoretical Computer Science» more ENC 2008»

Possibilistic-Based Argumentation: An Answer Set Programming Approach

13 years 11 months ago

Possibilistic-Based Argumentation: An Answer Set Programming Approach

Download www.lsi.upc.edu

In many ﬁelds of automated information processing it becomes crucial to consider together imprecise, uncertain or inconsistent information. Argumentation theory is a suitable framework for practical and uncertain reasoning, where arguments could support conclusions. We present a possibilistic-based argumentation approach which is based on a possibilistic disjunctive language. This speciﬁcation language is able to capture incomplete information and incomplete states of a knowledge base at the same time.

Juan Carlos Nieves, Ulises Cortés, Mauricio

Real-time Traffic

Argumentation Theory | ENC 2008 | Possibilistic Disjunctive Language | Possibilistic-based Argumentation Approach | Theoretical Computer Science |

claim paper

Related Content

» Defeasibility in Answer Set Programs via Argumentation Theories

» Towards a General Argumentation System based on AnswerSet Programming

» Inferring acceptable arguments with Answer Set Programming

» Applications of Preferences using Answer Set Programming

» Probabilistic Reasoning With Answer Sets

» On the Relationship of Defeasible Argumentation and Answer Set Programming

» WizArg Visual Argumentation Framework Solving Wizard

» A Translational Approach to Constraint Answer Set Solving

» Answer Sets for Consistent Query Answering in Inconsistent Databases

Post Info
More Details (n/a)

Added	29 May 2010
Updated	29 May 2010
Type	Conference
Year	2008
Where	ENC
Authors	Juan Carlos Nieves, Ulises Cortés, Mauricio Osorio

Comments (0)