A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Structure-Based Algorithms for Computing Preferred Arguments of Defeasible Knowledge Bases
[chapter]
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