{"title":"作为数据库存储过程的倒链推理——在真实知识库上的实验","authors":"Tomasz Xieski, R. Siminski","doi":"10.1080/24751839.2018.1479931","DOIUrl":null,"url":null,"abstract":"In this work two approaches of backward chaining inference implementation were compared. The first approach uses a classical, goal driven inference running on the client device — the algorithm implemented within the KBExpertLib library was used. Inference was performed on a rule base buffered in memory structures. The second approach involves implementing inference as a stored procedure, run in the environment of the database server — an original, previously not published algorithm was introduced. Experiments were conducted on real-world knowledge bases with a relatively large number of rules. Experiments were prepared so that one could evaluate the pessimistic complexity of the inference algorithm.","PeriodicalId":314687,"journal":{"name":"2017 IEEE International Conference on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"198200 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Backward chaining inference as a database stored procedure — the experiments on real-world knowledge bases\",\"authors\":\"Tomasz Xieski, R. Siminski\",\"doi\":\"10.1080/24751839.2018.1479931\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work two approaches of backward chaining inference implementation were compared. The first approach uses a classical, goal driven inference running on the client device — the algorithm implemented within the KBExpertLib library was used. Inference was performed on a rule base buffered in memory structures. The second approach involves implementing inference as a stored procedure, run in the environment of the database server — an original, previously not published algorithm was introduced. Experiments were conducted on real-world knowledge bases with a relatively large number of rules. Experiments were prepared so that one could evaluate the pessimistic complexity of the inference algorithm.\",\"PeriodicalId\":314687,\"journal\":{\"name\":\"2017 IEEE International Conference on INnovations in Intelligent SysTems and Applications (INISTA)\",\"volume\":\"198200 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE International Conference on INnovations in Intelligent SysTems and Applications (INISTA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/24751839.2018.1479931\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE International Conference on INnovations in Intelligent SysTems and Applications (INISTA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/24751839.2018.1479931","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Backward chaining inference as a database stored procedure — the experiments on real-world knowledge bases
In this work two approaches of backward chaining inference implementation were compared. The first approach uses a classical, goal driven inference running on the client device — the algorithm implemented within the KBExpertLib library was used. Inference was performed on a rule base buffered in memory structures. The second approach involves implementing inference as a stored procedure, run in the environment of the database server — an original, previously not published algorithm was introduced. Experiments were conducted on real-world knowledge bases with a relatively large number of rules. Experiments were prepared so that one could evaluate the pessimistic complexity of the inference algorithm.