( en | de | ru )

 

Disambiguation of "Woltran, Stefan"

Author of the publication

copydeleteadd this publication to your clipboard
On the Structural Complexity of Grounding - Tackling the ASP Grounding Bottleneck via Epistemic Programs and Treewidth.

, , and . ECAI, volume 372 of Frontiers in Artificial Intelligence and Applications, page 247-254. IOS Press, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Stefan Weiß

Deformation quantization of principal fibre bundles and classical gauge theories. Uni Freiburg, (2009)

Stefan Schwärzler

Graphische Modelle im natürlichsprachlichen Mensch-Maschine-Dialog. TU München, (2010)

Stefan Fröhlich

Modellbasierte Fehlererkennung und Diagnose in Echtzeit am Beispiel einer Brennstoffzelle. Uni Kassel, (2009)

Stefan Tripmaker

Verhältnis und Abgrenzung zwischen Steuerhinterziehung und Betrug. Bucerius Law School Hamburg, (2007)

Stefan Kutter

Molekularer Aufbau und Translokationsmechanismus des Cag-Typ-IV-Sekretionssystems von Helicobacter pylori. Uni München, (2009)
 

Other publications of authors with the same name

Belief Update in the Horn Fragment., , , and . IJCAI, page 1781-1787. ijcai.org, (2018)Complexity Results for Checking Equivalence of Stratified Logic Programs., , , and . IJCAI, page 330-335. (2007)Improved answer-set programming encodings for abstract argumentation., , , , and . Theory Pract. Log. Program., 15 (4-5): 434-448 (2015)Implementing Courcelle's Theorem in a declarative framework for dynamic programming., , and . J. Log. Comput., 27 (4): 1067-1094 (2017)Equivalence between Extended Datalog Programs - A Brief Survey.. Datalog, volume 6702 of Lecture Notes in Computer Science, page 106-119. Springer, (2010)The Hidden Power of Abstract Argumentation Semantics., , and . TAFA, volume 9524 of Lecture Notes in Computer Science, page 146-162. Springer, (2015)Belief Merging within Fragments of Propositional Logic., , , and . ACM Trans. Comput. Log., 17 (3): 20 (2016)Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving., , , , and . Artif. Intell., (2022)Choice logics and their computational properties., , and . Artif. Intell., (2022)A common view on strong, uniform, and other notions of equivalence in answer-set programming.. Theory Pract. Log. Program., 8 (2): 217-234 (2008)