The Hybrid Reasoning Algorithm of ß-PSML

Abstract

For solving problems in a large-scale distributed Web environment, we proposed β-PSML (Problem Solver Markup Language). We have studied the theoretical problems of β-PSML constructed by combining description logic and Horn clauses. In the nonrecursive case, we show that a single step of applying a Horn clause needs to be replaced by a more sophisticated reasoning step in β-PSML. We call it as the hybrid reasoning algorithm. We described the hybrid reasoning algorithm in this paper. Hybrid reasoning algorithm provides a sound and complete inference procedure for nonrecursive β-PSML knowledge bases in which the description logic component is decidable.