Abstract
Experimental analysis of some computation rules in a simple parallel reasoning system for theALCdescription logicA computation rule determines the order of selecting premises during an inference process. In this paper we empirically analyse three particular computation rules in a tableau-based, parallel reasoning system for theALCdescription logic, which is built in the relational programming model in the Oz language. The system is constructed in the lean deduction style, namely, it has the form of a small program containing only basic mechanisms, which assure soundness and completeness of reasoning. In consequence, the system can act as a convenient test-bed for comparing various inference algorithms and their elements. We take advantage of this property and evaluate the studied methods of selecting premises with regard to their efficiency and speedup, which can be obtained by parallel processing.
Subject
Applied Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference24 articles.
1. Logic-based subsumption architecture;E. Amir;Artificial Intelligence,2004
2. Towards parallel classifcation of TBoxes;M. Aslani,2008
3. An overview of tableau algorithms for description logics;F. Baader;Studia Logica,2001
4. leanTAP: Lean, tableau-based deduction;B. Beckert;Journal of Automated Reasoning,1995
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献