{"title":"The Hybrid Reasoning Algorithm of ß-PSML","authors":"Yila Su","doi":"10.1109/CASoN.2009.10","DOIUrl":null,"url":null,"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.","PeriodicalId":425748,"journal":{"name":"2009 International Conference on Computational Aspects of Social Networks","volume":"158 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Computational Aspects of Social Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CASoN.2009.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
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.