TY - GEN
A1 - Meissner, Adam
A2 - Korbicz, Józef - red.
A2 - Uciński, Dariusz - red.
PB - Zielona Góra: Uniwersytet Zielonogórski
N2 - A 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 the "ALC" description 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.
L1 - http://zbc.uz.zgora.pl/Content/46900/AMCS_2011_21_1_6.pdf
L2 - http://zbc.uz.zgora.pl/Content/46900
KW - parallel reasoning
KW - lean deduction
KW - "ALC" description logic
KW - Oz language
T1 - Experimental analysis of some computation rules in a simple parallel reasoning system for the "ALC" description logic
UR - http://zbc.uz.zgora.pl/dlibra/docmetadata?id=46900
ER -