<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Alexis De Colnet | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/alexis-de-colnet/</link><atom:link href="https://ac.tuwien.ac.at/team/alexis-de-colnet/index.xml" rel="self" type="application/rss+xml"/><description>Alexis De Colnet</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Thu, 01 Jan 2026 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>Alexis De Colnet</title><link>https://ac.tuwien.ac.at/team/alexis-de-colnet/</link></image><item><title>LLM-Guided Semantic Vtrees for SDD Compilation</title><link>https://ac.tuwien.ac.at/publication/llm-guided-semantic-vtrees-for-sdd-compilation/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/llm-guided-semantic-vtrees-for-sdd-compilation/</guid><description/></item><item><title>OBDDs, SDDs, and Circuits of Bounded Width: Completeness Matters</title><link>https://ac.tuwien.ac.at/publication/obdds-sdds-and-circuits-of-bounded-width-completeness-matters/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/obdds-sdds-and-circuits-of-bounded-width-completeness-matters/</guid><description/></item><item><title>ASP-QRAT: A Conditionally Optimal Dual Proof System for ASP</title><link>https://ac.tuwien.ac.at/publication/asp-qrat-a-conditionally-optimal-dual-proof-system-for-asp/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/asp-qrat-a-conditionally-optimal-dual-proof-system-for-asp/</guid><description/></item><item><title>Compilation and Fast Model Counting beyond CNF</title><link>https://ac.tuwien.ac.at/publication/compilation-and-fast-model-counting-beyond-cnf/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/compilation-and-fast-model-counting-beyond-cnf/</guid><description/></item><item><title>Hardness of Random Reordered Encodings of Parity for Resolution and CDCL</title><link>https://ac.tuwien.ac.at/publication/hardness-of-random-reordered-encodings-of-parity-for-resolution-and-cdcl/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/hardness-of-random-reordered-encodings-of-parity-for-resolution-and-cdcl/</guid><description/></item></channel></rss>