Efficient Knowledge Base Management in DCSP

Details Efficient Knowledge Base Management in DCSP Efficient Knowledge Base Management in DCSP

2010-09-30

arxiv.org/abs/1009.6127v1

International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.3, September 2010, 21-31

Computer Science

Artificial Intelligence

11 pages

Scientific paper

10.5121/ijasuc.2010.1302

DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI that can be formalized as DSCPs. With the increasing complexity and problem size of the application problems in AI, the required storage place in searching and the average searching time are increasing too. Thus, to use a limited storage place efficiently in solving DCSP becomes a very important problem, and it can help to reduce searching time as well. This paper provides an efficient knowledge base management approach based on general usage of hyper-resolution-rule in consistence algorithm. The approach minimizes the increasing of the knowledge base by eliminate sufficient constraint and false nogood. These eliminations do not change the completeness of the original knowledge base increased. The proofs are given as well. The example shows that this approach decrease both the new nogoods generated and the knowledge base greatly. Thus it decreases the required storage place and simplify the searching process.

Affiliated with

Also associated with

No associations

Rating

Efficient Knowledge Base Management in DCSP 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 Efficient Knowledge Base Management in DCSP, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Knowledge Base Management in DCSP will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-243241