Author(s): Hong Jiang
Journal: International Journal of Ad Hoc, Sensor & Ubiquitous Computing
ISSN 0976-2205
Volume: 1;
Issue: 3;
Start page: 21;
Date: 2010;
VIEW PDF
DOWNLOAD PDF 
Original page
Keywords: Distributed Constraint Satisfaction Problem | hyper-resolution-rule | knowledge base management
ABSTRACT
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 asDSCPs. With the increasing complexity and problem size of the application problems in AI, the requiredstorage place in searching and the average searching time are increasing too. Thus, to use a limitedstorage place efficiently in solving DCSP becomes a very important problem, and it can help to reducesearching time as well. This paper provides an efficient knowledge base management approach based ongeneral usage of hyper-resolution-rule in consistence algorithm. The approach minimizes the increasing ofthe knowledge base by eliminate sufficient constraint and false nogood. These eliminations do not changethe completeness of the original knowledge base increased. The proofs are given as well. The exampleshows that this approach decrease both the new nogoods generated and the knowledge base greatly. Thusit decreases the required storage place and simplify the searching process.
Journal: International Journal of Ad Hoc, Sensor & Ubiquitous Computing
ISSN 0976-2205
Volume: 1;
Issue: 3;
Start page: 21;
Date: 2010;
VIEW PDF
DOWNLOAD PDF Original pageKeywords: Distributed Constraint Satisfaction Problem | hyper-resolution-rule | knowledge base management
ABSTRACT
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 asDSCPs. With the increasing complexity and problem size of the application problems in AI, the requiredstorage place in searching and the average searching time are increasing too. Thus, to use a limitedstorage place efficiently in solving DCSP becomes a very important problem, and it can help to reducesearching time as well. This paper provides an efficient knowledge base management approach based ongeneral usage of hyper-resolution-rule in consistence algorithm. The approach minimizes the increasing ofthe knowledge base by eliminate sufficient constraint and false nogood. These eliminations do not changethe completeness of the original knowledge base increased. The proofs are given as well. The exampleshows that this approach decrease both the new nogoods generated and the knowledge base greatly. Thusit decreases the required storage place and simplify the searching process.