Abstract

AbstractOne of the recent trends in research about abstract argumentation is the study of how incomplete knowledge can be integrated to argumentation frameworks (AFs). In this paper, we survey main results on Incomplete AFs (IAFs), following two directions: how hard is it to reason with IAFs? And what can be expressed with IAFs? We show that two generalizations of IAFs, namely Rich IAFs and Constrained IAFs, despite having a higher expressive power than IAFs, have the same complexity regarding classical reasoning tasks.KeywordsAbstract argumentationUncertaintyIncomplete knowledgeComputational complexity

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.