{"title":"号角集的包容性分辨率","authors":"Li Dafa","doi":"10.1109/AIHAS.1992.636897","DOIUrl":null,"url":null,"abstract":"Let L1 v C1 and L2 V Cz be two parent clauses, where L1 and Lz are positive literals, C1 and C2 are clauses. If L1 and Lz have a most general unifier U and there is the most general substitution X such that ClaX 5 C ~ U A , then CzaX is called an inclusive resolvent of L1 v Cl and L2 v C2. The problem is whether the inclusive resolution is complete. The lifting lemma for inclusive resolution is proved, then it is proved that the inclusive resolution is complete for Horn sets. The present paper gives the inclusion algorithm, and the inclusion theorem is proved.","PeriodicalId":442147,"journal":{"name":"Proceedings of the Third Annual Conference of AI, Simulation, and Planning in High Autonomy Systems 'Integrating Perception, Planning and Action'.","volume":"85 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Inclusive Resolution for Horn Sets\",\"authors\":\"Li Dafa\",\"doi\":\"10.1109/AIHAS.1992.636897\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let L1 v C1 and L2 V Cz be two parent clauses, where L1 and Lz are positive literals, C1 and C2 are clauses. If L1 and Lz have a most general unifier U and there is the most general substitution X such that ClaX 5 C ~ U A , then CzaX is called an inclusive resolvent of L1 v Cl and L2 v C2. The problem is whether the inclusive resolution is complete. The lifting lemma for inclusive resolution is proved, then it is proved that the inclusive resolution is complete for Horn sets. The present paper gives the inclusion algorithm, and the inclusion theorem is proved.\",\"PeriodicalId\":442147,\"journal\":{\"name\":\"Proceedings of the Third Annual Conference of AI, Simulation, and Planning in High Autonomy Systems 'Integrating Perception, Planning and Action'.\",\"volume\":\"85 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-07-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Third Annual Conference of AI, Simulation, and Planning in High Autonomy Systems 'Integrating Perception, Planning and Action'.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AIHAS.1992.636897\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Third Annual Conference of AI, Simulation, and Planning in High Autonomy Systems 'Integrating Perception, Planning and Action'.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AIHAS.1992.636897","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
设L1 v C1和L2 v Cz为两个父子句，其中L1和Lz是正数，C1和C2是子句。如果L1和Lz有一个最一般的统一子U并且有一个最一般的替换X使得ClaX 5c ~ ua，那么CzaX就被称为l1v Cl和l2v C2的包容解。问题在于包容性解决方案是否完整。首先证明了包含分辨的提升引理，然后证明了Horn集合的包含分辨是完全的。本文给出了包含算法，并证明了包含定理。
Let L1 v C1 and L2 V Cz be two parent clauses, where L1 and Lz are positive literals, C1 and C2 are clauses. If L1 and Lz have a most general unifier U and there is the most general substitution X such that ClaX 5 C ~ U A , then CzaX is called an inclusive resolvent of L1 v Cl and L2 v C2. The problem is whether the inclusive resolution is complete. The lifting lemma for inclusive resolution is proved, then it is proved that the inclusive resolution is complete for Horn sets. The present paper gives the inclusion algorithm, and the inclusion theorem is proved.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
