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

Quoc Bao Vo
2005 Lecture Notes in Computer Science  
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.
doi:10.1007/11589990_91 fatcat:mauzfp77tfdmzgvyvrnh3v4ppa