AI 2005: Advances in Artificial Intelligence

Volume 3809 of the series Lecture Notes in Computer Science pp 834-838

Structure-Based Algorithms for Computing Preferred Arguments of Defeasible Knowledge Bases

  • Quoc Bao VoAffiliated withSchool of Computer Science and Information Technology, RMIT University

* Final gross prices may vary according to local VAT.

Get Access


In this paper we present several efficient computational procedures for defeasible reasoning while the plausible and well-defined semantics, viz.preferred models and stable models, are not given up. The proposed algorithms exploit the structural information of defeasible knowledge bases to facilitate efficient computational models.