{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:01:32Z","timestamp":1753887692263},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>In this paper, we present a general strategy that enables the translation of tableau proofs using different Skolemization rules into machine-checkable proofs. It is part of a framework that enables (i) instantiation of the strategy into algorithms for different sets of tableau rules (e.g., different logics) and (ii) easy soundness proof which relies on the local extensibility of user-defined rules. Furthermore, we propose an instantiation of this strategy for first-order tableaux that handles notably pre-inner Skolemization rules, which is, as far as the authors know, the first one in the literature. This deskolemization strategy has been implemented in the Go\u00e9land [17] automated theorem prover, enabling an export of its proofs to Coq [8] and Lambdapi [2]. Finally, we have evaluated the algorithm performances for inner and pre-inner Skolemization rules through the certification of proofs from some categories of the TPTP [39] library.<\/jats:p>","DOI":"10.29007\/g1tm","type":"proceedings-article","created":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T22:10:10Z","timestamp":1716847810000},"page":"246-227","source":"Crossref","is-referenced-by-count":1,"title":["A Generic Deskolemization Strategy"],"prefix":"10.29007","volume":"100","author":[{"given":"Johann","family":"Rosain","sequence":"first","affiliation":[]},{"given":"Richard","family":"Bonichon","sequence":"additional","affiliation":[]},{"given":"Julie","family":"Cailler","sequence":"additional","affiliation":[]},{"given":"Olivier","family":"Hermant","sequence":"additional","affiliation":[]}],"member":"11545","event":{"name":"Proceedings of 25th Conference on Logic for Programming, Artificial Intelligence and Reasoning"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T22:10:17Z","timestamp":1716847817000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/VgpS"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/g1tm","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}