{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T07:12:49Z","timestamp":1767942769851,"version":"3.49.0"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2021,12,14]],"date-time":"2021-12-14T00:00:00Z","timestamp":1639440000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["713999"],"award-info":[{"award-number":["713999"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.46298\/lmcs-17(4:18)2021","type":"journal-article","created":{"date-parts":[[2021,12,14]],"date-time":"2021-12-14T20:19:14Z","timestamp":1639513154000},"source":"Crossref","is-referenced-by-count":11,"title":["Efficient Full Higher-Order Unification"],"prefix":"10.46298","volume":"Volume 17, Issue 4","author":[{"given":"Petar","family":"Vukmirovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Bentkamp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Visa","family":"Nummelin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2021,12,14]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/8837\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/8837\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:18:25Z","timestamp":1687292305000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/6919"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,14]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-17(4:18)2021","relation":{"has-preprint":[{"id-type":"arxiv","id":"2011.09507v2","asserted-by":"subject"},{"id-type":"arxiv","id":"2011.09507v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2011.09507","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2011.09507","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12,14]]},"article-number":"6919"}}