{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T03:53:20Z","timestamp":1781927600566,"version":"3.54.5"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2022,4,14]],"date-time":"2022-04-14T00:00:00Z","timestamp":1649894400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>The concept of uniform interpolant for a quantifier-free formula from a given\nformula with a list of symbols, while well-known in the logic literature, has\nbeen unknown to the formal methods and automated reasoning community for a long\ntime. This concept is precisely defined. Two algorithms for computing\nquantifier-free uniform interpolants in the theory of equality over\nuninterpreted symbols (EUF) endowed with a list of symbols to be eliminated are\nproposed. The first algorithm is non-deterministic and generates a uniform\ninterpolant expressed as a disjunction of conjunctions of literals, whereas the\nsecond algorithm gives a compact representation of a uniform interpolant as a\nconjunction of Horn clauses. Both algorithms exploit efficient dedicated DAG\nrepresentations of terms. Correctness and completeness proofs are supplied,\nusing arguments combining rewrite techniques with model theory.<\/jats:p>","DOI":"10.46298\/lmcs-18(2:2)2022","type":"journal-article","created":{"date-parts":[[2022,4,20]],"date-time":"2022-04-20T14:13:28Z","timestamp":1650464008000},"source":"Crossref","is-referenced-by-count":4,"title":["Uniform Interpolants in EUF: Algorithms using DAG-representations"],"prefix":"10.46298","volume":"Volume 18, Issue 2","author":[{"given":"Silvio","family":"Ghilardi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4216-5199","authenticated-orcid":false,"given":"Alessandro","family":"Gianola","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Deepak","family":"Kapur","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"25203","published-online":{"date-parts":[[2022,4,14]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/9354\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/9354\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:19:39Z","timestamp":1687292379000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/7257"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,14]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-18(2:2)2022","relation":{"has-preprint":[{"id-type":"arxiv","id":"2002.09784v3","asserted-by":"subject"},{"id-type":"arxiv","id":"2002.09784v2","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2002.09784","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2002.09784","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,14]]},"article-number":"7257"}}