Incremental Knowledge Compilation Using the Extension Rule

Knowledge compilation by using the extension rule (KCER) has been recognized as a novel compilation approach, although this method can only deal with static knowledge bases. This paper proposes a novel incremental knowledge compilation method by using the extension rule so that it can tackle knowledge compilation problems in the dynamic environment. The method does not recompile the whole knowledge base, while it is to use the information of compiling original knowledge base to speed up the compiling process. The experimental results show that this method can deal with dynamic knowledge bases efficiently

[1]  Chu Jianfeng,et al.  An Efficient Parallel Anomaly Detection Algorithm Based on Hierarchical Clustering , 2013, J. Networks.

[2]  Yin Ming.  Possibilistic Extension Rules for Reasoning and Knowledge Compilation , 2010 .

[3]  Marco Cadoli,et al.  A Survey on Knowledge Compilation , 1997, AI Commun..

[4]  Christian J. Muise,et al.  Dsharp: Fast d-DNNF Compilation with sharpSAT , 2012, Canadian Conference on AI.

[5]  Alvaro del Val.  Tractable Databases: How to Make Propositional Unit Resolution Complete Through Compilation , 1994, KR.

[6]  Pierre Marquis,et al.  Knowledge Compilation Using Theory Prime Implicates , 1995, IJCAI.

[7]  Heng Wang,et al.  Hand Gesture Target Model Updating and Result Forecasting Algorithm based on Mean Shift , 2013, J. Multim..

[8]  Bart Selman,et al.  Knowledge compilation and theory approximation , 1996, JACM.

[9]  Robert Schrag,et al.  Compilation for Critically Constrained Knowledge Bases , 1996, AAAI/IAAI, Vol. 1.

[10]  Zhang Yimin,et al.  Theorem Proving Based on the Extension Rule , 2003 .

[11]  Pierre Marquis,et al.  A Knowledge Compilation Map , 2002, J. Artif. Intell. Res..

[12]  Christos H. Papadimitriou,et al.  Incremental Recompilation of Knowledge , 1994, AAAI.

[13]  Raymond Reiter,et al.  Foundations of Assumption-based Truth Maintenance Systems: Preliminary Report , 1987, AAAI.

[14]  Jigui Sun,et al.  Theorem Proving Based on the Extension Rule , 2004, Journal of Automated Reasoning.

[15]  Jigui Sun,et al.  Knowledge Compilation Using the Extension Rule , 2004, Journal of Automated Reasoning.

[16]  Yin Ming.  Solving #SAT Using Extension Rules , 2009 .

[17]  Xia Wu,et al.  Possibilistic Extension Rules for Reasoning and Knowledge Compilation: Possibilistic Extension Rules for Reasoning and Knowledge Compilation , 2011 .

[18]  Ke Xu,et al.  An Algorithm for Detecting Group in Mobile Social Network , 2012, J. Networks.

[19]  Guoyong Shi,et al.  A survey on binary decision diagram approaches to symbolic analysis of analog integrated circuits , 2011, Analog Integrated Circuits and Signal Processing.

[20]  Andreas Koch,et al.  Malacoda: Towards high-level compilation of network security applications on reconfigurable hardware , 2012, 2012 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS).

[21]  Alvaro del Val.  An Analysis of Approximate Knowledge Compilation , 1995, IJCAI.