<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Johannes K. Fichte | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/johannes-k.-fichte/</link><atom:link href="https://ac.tuwien.ac.at/team/johannes-k.-fichte/index.xml" rel="self" type="application/rss+xml"/><description>Johannes K. Fichte</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Thu, 01 Jun 2023 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>Johannes K. Fichte</title><link>https://ac.tuwien.ac.at/team/johannes-k.-fichte/</link></image><item><title>The Silent (R)evolution of SAT</title><link>https://ac.tuwien.ac.at/publication/the-silent-r-evolution-of-sat/</link><pubDate>Thu, 01 Jun 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-silent-r-evolution-of-sat/</guid><description/></item><item><title>Inconsistent Cores for ASP: The Perks and Perils of Non-Monotonicity</title><link>https://ac.tuwien.ac.at/publication/inconsistent-cores-for-asp-the-perks-and-perils-of-non-monotonicity/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/inconsistent-cores-for-asp-the-perks-and-perils-of-non-monotonicity/</guid><description/></item><item><title>A Time Leap Challenge for SAT-Solving</title><link>https://ac.tuwien.ac.at/publication/a-time-leap-challenge-for-sat-solving/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-time-leap-challenge-for-sat-solving/</guid><description/></item><item><title>Breaking Symmetries with RootClique and LexTopsort</title><link>https://ac.tuwien.ac.at/publication/breaking-symmetries-with-rootclique-and-lextopsort-2/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/breaking-symmetries-with-rootclique-and-lextopsort-2/</guid><description/></item><item><title>Breaking Symmetries with RootClique and LexTopsort</title><link>https://ac.tuwien.ac.at/publication/breaking-symmetries-with-rootclique-and-lextopsort/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/breaking-symmetries-with-rootclique-and-lextopsort/</guid><description/></item><item><title>An SMT Approach to Fractional Hypertree Width</title><link>https://ac.tuwien.ac.at/publication/an-smt-approach-to-fractional-hypertree-width-2/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-smt-approach-to-fractional-hypertree-width-2/</guid><description/></item><item><title>An SMT Approach to Fractional Hypertree Width</title><link>https://ac.tuwien.ac.at/publication/an-smt-approach-to-fractional-hypertree-width/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-smt-approach-to-fractional-hypertree-width/</guid><description/></item><item><title>SAT-Based Local Improvement for Finding Tree Decompositions of Small Width</title><link>https://ac.tuwien.ac.at/publication/sat-based-local-improvement-for-finding-tree-decompositions-of-small-width-2/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/sat-based-local-improvement-for-finding-tree-decompositions-of-small-width-2/</guid><description/></item><item><title>SAT-Based Local Improvement for Finding Tree Decompositions of Small Width</title><link>https://ac.tuwien.ac.at/publication/sat-based-local-improvement-for-finding-tree-decompositions-of-small-width/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/sat-based-local-improvement-for-finding-tree-decompositions-of-small-width/</guid><description/></item></channel></rss>