Structure-based algorithms for computing preferred arguments of defeasible knowledge bases

Authors:
Quoc Bao Vo
Affiliations:
School of Computer Science and Information Technology, RMIT University, Melbourne, Australia
Venue:
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
Year:
2005

Citing 10
Cited 0

Semantical considerations on nonmonotonic logic

Artificial Intelligence
A rational reconstruction of nonmonotonic truth maintenance systems (research note)

Artificial Intelligence
Autoepistemic logic

Journal of the ACM (JACM)
The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Hard problems for simple default logics

Artificial Intelligence - Special issue on knowledge representation
An abstract, argumentation-theoretic approach to default reasoning

Artificial Intelligence
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A machine program for theorem-proving

Communications of the ACM
Cognitive Carpentry: A Blueprint for how to Build a Person

Cognitive Carpentry: A Blueprint for how to Build a Person
Answer set programming and plan generation

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.