A Dynamic Boolean Knowledge Base
暂无分享，去创建一个
This paper presents an implemented architecture for easy conception and reorganization of a Boolean knowledge base. As new definitions are added through seamless interaction, the base spontaneously brings up intermingled taxonomies of concepts, which are crucial for knowledge navigation. Complex constraints may be programmatically added by grounding first-order rules. This is illustrated with an example from elementary school geometry.
[1] Lenhart K. Schubert,et al. PARTS INFERENCE: Closed and Semi-Closed Partitioning Graphs , 1981, IJCAI.
[2] Lakhdar Sais,et al. Automatic Extraction of Functional Dependencies , 2004, SAT.
[3] Sébastien Ferré,et al. Camelis: Organizing and Browsing a Personal Photo Collection with a Logical Information System , 2007, CLA.
[4] Sharad Malik,et al. Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).