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

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.

• Type: Conference
• Year: 2005
• Where: AUSAI
• Authors: Quoc Bao Vo
• Keywords: Artificial Intelligence, AUSAI 2005, Defeasible Knowledge Bases, Defeasible Reasoning, Efficient Computational Procedures