Pruning Search Space in Defeasible Argumentation

Details Pruning Search Space in Defeasible Argumentation Pruning Search Space in Defeasible Argumentation

2004-05-27

arxiv.org/abs/cs/0405106v1

Proc. of the Workshop on Advances and Trends in Search in Artificial Intelligence, pp.40-47. International Conf. of the Chilea

Computer Science

Artificial Intelligence

11 pages

Scientific paper

Defeasible argumentation has experienced a considerable growth in AI in the last decade. Theoretical results have been combined with development of practical applications in AI & Law, Case-Based Reasoning and various knowledge-based systems. However, the dialectical process associated with inference is computationally expensive. This paper focuses on speeding up this inference process by pruning the involved search space. Our approach is twofold. On one hand, we identify distinguished literals for computing defeat. On the other hand, we restrict ourselves to a subset of all possible conflicting arguments by introducing dialectical constraints.

Affiliated with

Also associated with

No associations

Rating

Pruning Search Space in Defeasible Argumentation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Pruning Search Space in Defeasible Argumentation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pruning Search Space in Defeasible Argumentation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-270052