SU Yi-la. Correctness Proof of the Existential Entailment Algorithm of β-Problem Solver Markup Language[J]. Journal of Beijing University of Technology, 2012, 38(3): 396-400. DOI: 10.3969/j.issn.0254-0037.2012.03.015
Citation:
SU Yi-la. Correctness Proof of the Existential Entailment Algorithm of β-Problem Solver Markup Language[J]. Journal of Beijing University of Technology, 2012, 38(3): 396-400. DOI: 10.3969/j.issn.0254-0037.2012.03.015
SU Yi-la. Correctness Proof of the Existential Entailment Algorithm of β-Problem Solver Markup Language[J]. Journal of Beijing University of Technology, 2012, 38(3): 396-400. DOI: 10.3969/j.issn.0254-0037.2012.03.015
Citation:
SU Yi-la. Correctness Proof of the Existential Entailment Algorithm of β-Problem Solver Markup Language[J]. Journal of Beijing University of Technology, 2012, 38(3): 396-400. DOI: 10.3969/j.issn.0254-0037.2012.03.015
Correctness Proof of the Existential Entailment Algorithm of β-Problem Solver Markup Language
Based on the existential entailment algorithm proposed,this paper proves the correctness of the existential entailment algorithm by combining production rules.The algorithm provides a sound and complete inference procedure for nonrecursive β-PSML knowledge base in which the description logic component is confirmable.