{"title":"高效全高阶统一","authors":"P. Vukmirović, A. Bentkamp, V. Nummelin","doi":"10.46298/lmcs-17(4:18)2021","DOIUrl":null,"url":null,"abstract":"We developed a procedure to enumerate complete sets of higher-order unifiers\nbased on work by Jensen and Pietrzykowski. Our procedure removes many redundant\nunifiers by carefully restricting the search space and tightly integrating\ndecision procedures for fragments that admit a finite complete set of unifiers.\nWe identify a new such fragment and describe a procedure for computing its\nunifiers. Our unification procedure, together with new higher-order term\nindexing data structures, is implemented in the Zipperposition theorem prover.\nExperimental evaluation shows a clear advantage over Jensen and Pietrzykowski's\nprocedure.","PeriodicalId":284975,"journal":{"name":"International Conference on Formal Structures for Computation and Deduction","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"Efficient Full Higher-Order Unification\",\"authors\":\"P. Vukmirović, A. Bentkamp, V. Nummelin\",\"doi\":\"10.46298/lmcs-17(4:18)2021\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We developed a procedure to enumerate complete sets of higher-order unifiers\\nbased on work by Jensen and Pietrzykowski. Our procedure removes many redundant\\nunifiers by carefully restricting the search space and tightly integrating\\ndecision procedures for fragments that admit a finite complete set of unifiers.\\nWe identify a new such fragment and describe a procedure for computing its\\nunifiers. Our unification procedure, together with new higher-order term\\nindexing data structures, is implemented in the Zipperposition theorem prover.\\nExperimental evaluation shows a clear advantage over Jensen and Pietrzykowski's\\nprocedure.\",\"PeriodicalId\":284975,\"journal\":{\"name\":\"International Conference on Formal Structures for Computation and Deduction\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-11-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Formal Structures for Computation and Deduction\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.46298/lmcs-17(4:18)2021\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Formal Structures for Computation and Deduction","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.46298/lmcs-17(4:18)2021","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We developed a procedure to enumerate complete sets of higher-order unifiers
based on work by Jensen and Pietrzykowski. Our procedure removes many redundant
unifiers by carefully restricting the search space and tightly integrating
decision procedures for fragments that admit a finite complete set of unifiers.
We identify a new such fragment and describe a procedure for computing its
unifiers. Our unification procedure, together with new higher-order term
indexing data structures, is implemented in the Zipperposition theorem prover.
Experimental evaluation shows a clear advantage over Jensen and Pietrzykowski's
procedure.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
