<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="de">
	<id>https://iccl.inf.tu-dresden.de/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Nikolai+K%C3%A4fer</id>
	<title>International Center for Computational Logic - Benutzerbeiträge [de]</title>
	<link rel="self" type="application/atom+xml" href="https://iccl.inf.tu-dresden.de/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Nikolai+K%C3%A4fer"/>
	<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/web/Spezial:Beitr%C3%A4ge/Nikolai_K%C3%A4fer"/>
	<updated>2026-06-04T08:02:26Z</updated>
	<subtitle>Benutzerbeiträge</subtitle>
	<generator>MediaWiki 1.43.1</generator>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Article3115&amp;diff=43448</id>
		<title>Article3115</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Article3115&amp;diff=43448"/>
		<updated>2025-10-30T11:55:53Z</updated>

		<summary type="html">&lt;p&gt;Nikolai Käfer: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Clemens |ErsterAutorNachname=Dubslaff |FurtherAuthors=Nils Husung; Nikolai Käfer }} {{Article |Referiert=1 |Title=Tailoring binary decision diagram compilation for feature models |To appear=0 |Year=2025 |Journal=Journal of Systems and Software |Volume=231 }} {{Publikation Details |Abstract=The compilation of feature models into binary decision diagrams (BDDs) is a major challenge in the area of configurable…“&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Publikation Erster Autor&lt;br /&gt;
|ErsterAutorVorname=Clemens&lt;br /&gt;
|ErsterAutorNachname=Dubslaff&lt;br /&gt;
|FurtherAuthors=Nils Husung; Nikolai Käfer&lt;br /&gt;
}}&lt;br /&gt;
{{Article&lt;br /&gt;
|Referiert=1&lt;br /&gt;
|Title=Tailoring binary decision diagram compilation for feature models&lt;br /&gt;
|To appear=0&lt;br /&gt;
|Year=2025&lt;br /&gt;
|Journal=Journal of Systems and Software&lt;br /&gt;
|Volume=231&lt;br /&gt;
}}&lt;br /&gt;
{{Publikation Details&lt;br /&gt;
|Abstract=The compilation of feature models into binary decision diagrams (BDDs) is a major challenge in the area of configurable systems analysis. For many large-scale feature models such as the variants of the prominent Linux product line, BDDs could not yet be obtained due to exceeding state-of-the-art compilation capabilities. Until now, BDD compilation has been mainly considered on standard settings of existing BDD tools, barely exploiting advanced techniques or tuning parameters. In this article, we conduct a comprehensive study on how to configure various techniques from the literature and thus improve compilation performance for feature models given in conjunctive normal form. Specifically, we evaluate preprocessing for satisfiability solving (SAT), variable and clause ordering heuristics, as well as non-standard and multi-threaded BDD construction schemes. Our experiments on recent feature models demonstrate that BDD compilation of feature models greatly benefits from these techniques. We show that our methods enable BDD compilations of many large-scale feature models within seconds, including the whole eCos feature model collection for which a compilation was previously infeasible.&lt;br /&gt;
|ISSN=0164-1212&lt;br /&gt;
|DOI Name=10.1016/j.jss.2025.112566&lt;br /&gt;
|Projekt=CPEC&lt;br /&gt;
|Forschungsgruppe=Algebraische und logische Grundlagen der Informatik&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nikolai Käfer</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings1511262239&amp;diff=43445</id>
		<title>Inproceedings1511262239</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings1511262239&amp;diff=43445"/>
		<updated>2025-10-30T11:49:07Z</updated>

		<summary type="html">&lt;p&gt;Nikolai Käfer: en-dash fix&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Publikation Erster Autor&lt;br /&gt;
|ErsterAutorVorname= Nikolai&lt;br /&gt;
|ErsterAutorNachname=Käfer&lt;br /&gt;
}}&lt;br /&gt;
{{Inproceedings&lt;br /&gt;
|Title=CPrAA – A Checker for Probabilistic Abstract Argumentation&lt;br /&gt;
|Booktitle=Frontiers in Artificial Intelligence and Applications&lt;br /&gt;
|Editor=Toni, Francesca and Polberg, Sylwia and Booth, Richard and Caminada, Martin and Kido, Hiroyuki&lt;br /&gt;
|Year=2022&lt;br /&gt;
|Publisher=IOS Press&lt;br /&gt;
}}&lt;br /&gt;
{{Publikation Details&lt;br /&gt;
|DOI Name=10.3233/FAIA220172&lt;br /&gt;
|Forschungsgruppe=Algebraische und logische Grundlagen der Informatik&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nikolai Käfer</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3416&amp;diff=42467</id>
		<title>Inproceedings3416</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3416&amp;diff=42467"/>
		<updated>2025-06-06T10:57:03Z</updated>

		<summary type="html">&lt;p&gt;Nikolai Käfer: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Nikolai |ErsterAutorNachname=Käfer |FurtherAuthors=Sven Apel; Christel Baier; Clemens Dubslaff; Holger Hermanns }} {{Inproceedings |Referiert=1 |Title=When to Sample from Feature Diagrams? |To appear=0 |Year=2025 |Month=Mai |Booktitle=Proceedings of the 19th International Working Conference on Variability Modelling of Software-Intensive Systems |Pages=11-20 |Publisher=Association for Computing Machinery |Ser…“&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Publikation Erster Autor&lt;br /&gt;
|ErsterAutorVorname=Nikolai&lt;br /&gt;
|ErsterAutorNachname=Käfer&lt;br /&gt;
|FurtherAuthors=Sven Apel; Christel Baier; Clemens Dubslaff; Holger Hermanns&lt;br /&gt;
}}&lt;br /&gt;
{{Inproceedings&lt;br /&gt;
|Referiert=1&lt;br /&gt;
|Title=When to Sample from Feature Diagrams?&lt;br /&gt;
|To appear=0&lt;br /&gt;
|Year=2025&lt;br /&gt;
|Month=Mai&lt;br /&gt;
|Booktitle=Proceedings of the 19th International Working Conference on Variability Modelling of Software-Intensive Systems&lt;br /&gt;
|Pages=11-20&lt;br /&gt;
|Publisher=Association for Computing Machinery&lt;br /&gt;
|Series=VaMoS &#039;25&lt;br /&gt;
}}&lt;br /&gt;
{{Publikation Details&lt;br /&gt;
|DOI Name=10.1145/3715340.3715442&lt;br /&gt;
|Projekt=CPEC&lt;br /&gt;
|Forschungsgruppe=Algebraische und logische Grundlagen der Informatik&lt;br /&gt;
|BibTex=@inproceedings{kafer.etal_2025,&lt;br /&gt;
  title = {When to {{Sample}} from {{Feature Diagrams}}?},&lt;br /&gt;
  booktitle = {Proceedings of the 19th {{International Working Conference}} on {{Variability Modelling}} of {{Software-Intensive Systems}}},&lt;br /&gt;
  author = {Käfer, Nikolai and Apel, Sven and Baier, Christel and Dubslaff, Clemens and Hermanns, Holger},&lt;br /&gt;
  year = {2025},&lt;br /&gt;
  month = may,&lt;br /&gt;
  series = {{{VaMoS}} &#039;25},&lt;br /&gt;
  pages = {11--20},&lt;br /&gt;
  publisher = {Association for Computing Machinery},&lt;br /&gt;
  address = {New York, NY, USA},&lt;br /&gt;
  doi = {10.1145/3715340.3715442},&lt;br /&gt;
  abstract = {Uniform random sampling (URS) has many applications in configurable systems analysis. Usually, feature models consisting of a hierarchical feature diagram and additional side constraints specify the space of valid configurations to be sampled from. However, URS has predominately been applied on feature models translated a priori into conjunctive normal form (CNF). In this work, we study URS approaches that instead operate directly on feature diagrams and provide a comparative evaluation of their performance against well-established URS tools for CNF representations. Our findings suggest that translating feature models to CNF offers advantages, even in the presence of only few side constraints.},&lt;br /&gt;
  isbn = {9798400714412}&lt;br /&gt;
}&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nikolai Käfer</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Nikolai_K%C3%A4fer&amp;diff=42466</id>
		<title>Nikolai Käfer</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Nikolai_K%C3%A4fer&amp;diff=42466"/>
		<updated>2025-06-06T10:52:38Z</updated>

		<summary type="html">&lt;p&gt;Nikolai Käfer: Abschlussarbeiten anzeigen&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Mitarbeiter&lt;br /&gt;
|Vorname=Nikolai&lt;br /&gt;
|Nachname=Käfer&lt;br /&gt;
|Forschungsgruppe=Algebraische und logische Grundlagen der Informatik&lt;br /&gt;
|Stellung=Doktorand&lt;br /&gt;
|Ehemaliger=0&lt;br /&gt;
|Email=nikolai.kaefer@tu-dresden.de&lt;br /&gt;
|Raum=APB 3007&lt;br /&gt;
|Bild=5L0A6772.jpg&lt;br /&gt;
|DBLP=https://dblp.org/pid/305/2943.html&lt;br /&gt;
|Google Scholar=https://scholar.google.de/citations?user=WlrvF_QAAAAJ&lt;br /&gt;
|Publikationen anzeigen=1&lt;br /&gt;
|Abschlussarbeiten anzeigen=1&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Nikolai Käfer</name></author>
	</entry>
</feed>