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

  • Quoc Bao Vo
Conference paper

DOI: 10.1007/11589990_91

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3809)
Cite this paper as:
Vo Q.B. (2005) Structure-Based Algorithms for Computing Preferred Arguments of Defeasible Knowledge Bases. In: Zhang S., Jarvis R. (eds) AI 2005: Advances in Artificial Intelligence. AI 2005. Lecture Notes in Computer Science, vol 3809. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Quoc Bao Vo
    • 1
  1. 1.School of Computer Science and Information TechnologyRMIT UniversityMelbourneAustralia

Personalised recommendations