{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T06:47:46Z","timestamp":1776494866644,"version":"3.51.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,10,29]]},"abstract":"<jats:p>A central computational task in database theory, finite model theory, and computer science at large is the evaluation of a first-order sentence on a finite structure. In the context of this task, the \\emph{width} of a sentence, defined as the maximum number of free variables over all subformulas, has been established as a crucial measure, where minimizing width of a sentence (while retaining logical equivalence) is considered highly desirable. An undecidability result rules out the possibility of an algorithm that, given a first-order sentence, returns a logically equivalent sentence of minimum width; this result motivates the study of width minimization via syntactic rewriting rules, which is this article's focus. For a number of common rewriting rules (which are known to preserve logical equivalence), including rules that allow for the movement of quantifiers, we present an algorithm that, given a positive first-order sentence $\u03d5$, outputs the minimum-width sentence obtainable from $\u03d5$ via application of these rules. We thus obtain a complete algorithmic understanding of width minimization up to the studied rules; this result is the first one -- of which we are aware -- that establishes this type of understanding in such a general setting. Our result builds on the theory of term rewriting and establishes an interface among this theory, query evaluation, and structural decomposition theory.<\/jats:p>","DOI":"10.46298\/lmcs-22(2:6)2026","type":"journal-article","created":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T06:00:08Z","timestamp":1776492008000},"source":"Crossref","is-referenced-by-count":0,"title":["Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity"],"prefix":"10.46298","volume":"Volume 22, Issue 2","author":[{"given":"Hubie","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Mengel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2026,4,18]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/2411.10229v4","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/2411.10229v4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T06:00:08Z","timestamp":1776492008000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/14793"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,18]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-22(2:6)2026","relation":{"has-preprint":[{"id-type":"arxiv","id":"2411.10229v2","asserted-by":"subject"},{"id-type":"arxiv","id":"2411.10229v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2411.10229","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2411.10229","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,18]]},"article-number":"14793"}}