Markus Hecher

Proceedings of the NASA Formal Methods - 16th International Symposium, 2024

Navigating and Querying Answer Sets: How Hard Is It Really and Why?

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, 2024

Easier Ways to Prove Counting Hard: A Dichotomy for Generalized #SAT, Applied to Constraint Graphs.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Quantitative Claim-Centric Reasoning in Logic-Based Argumentation.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Epistemic Logic Programs: Non-Ground and Counting Complexity.

[BibT_eX]

[DOI]

Thomas Eiter

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Bypassing the ASP Bottleneck: Hybrid Grounding by Splitting and Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Finite Groundings for ASP with Functions: A Journey through Consistency.

[BibT_eX]

[DOI]

Lukas Gerlach

David Carral

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

A First Journey into the Complexity of Statistical Statements in Probabilistic Answer Set Programming.

[BibT_eX]

[DOI]

Damiano Azzolini

Proceedings of the Workshop Proceedings of the 40th International Conference on Logic Programming (ICLP-WS 2024) co-located with the 40th International Conference on Logic Programming (ICLP 2024), 2024

Rejection in Abstract Argumentation: Harder Than Acceptance?

[BibT_eX]

[DOI]

Yasir Mahmood

Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

Domain-Based Nucleic-Acid Minimum Free Energy: Algorithmic Hardness and Parameterized Bounds.

[BibT_eX]

[DOI]

Proceedings of the 30th International Conference on DNA Computing and Molecular Programming, 2024

On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Parallel Empirical Evaluations: Resilience despite Concurrency.

[BibT_eX]

[DOI]

Tobias Geibinger

Matthias Schlögel

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

The Silent (R)evolution of SAT.

[BibT_eX]

[DOI]

Daniel Le Berre

Commun. ACM, June, 2023

Advanced tools and methods for treewidth-based problem solving.

[BibT_eX]

[DOI]

it Inf. Technol., May, 2023

Structure-Guided Automated Reasoning.

[BibT_eX]

[DOI]

Max Bannach

CoRR, 2023

Solving Projected Model Counting by Utilizing Treewidth and its Limits.

[BibT_eX]

[DOI]

Artif. Intell., 2023

Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

The Impact of Structure in Answer Set Counting: Fighting Cycles and its Limits.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, 2023

Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation.

[BibT_eX]

[DOI]

Yasir Mahmood

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Treewidth-Aware Complexity for Evaluating Epistemic Logic Programs.

[BibT_eX]

[DOI]

Jorge Fandinno

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

On the Structural Complexity of Grounding - Tackling the ASP Grounding Bottleneck via Epistemic Programs and Treewidth.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Grounding Planning Tasks Using Tree Decompositions and Iterated Solving.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth?

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Inconsistent Cores for ASP: The Perks and Perils of Non-monotonicity.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Exploiting Database Management Systems and Treewidth for Counting.

[BibT_eX]

[DOI]

Patrick Thier

Theory Pract. Log. Program., 2022

Default logic and bounded treewidth.

[BibT_eX]

[DOI]

Irina Schindler

Inf. Comput., 2022

Advanced Tools and Methods for Treewidth-Based Problem Solving - Extended Abstract.

[BibT_eX]

[DOI]

CoRR, 2022

Treewidth-aware reductions of normal ASP to SAT - Is normal ASP harder than SAT after all?

[BibT_eX]

[DOI]

Artif. Intell., 2022

Proofs for Propositional Model Counting.

[BibT_eX]

[DOI]

Valentin Roland

Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing, 2022

A Practical Account into Counting Dung's Extensions by Dynamic Programming.

[BibT_eX]

[DOI]

Ridhwan Dewoprabowo

Piotr Jerzy Gorczyca

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2022

Plausibility Reasoning via Projected Answer Set Counting - A Hybrid Approach.

[BibT_eX]

[DOI]

Mohamed A. Nadeem

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Body-Decoupled Grounding via Solving: A Novel Approach on the ASP Bottleneck.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

ApproxASP - a Scalable Approximate Answer Set Counter.

[BibT_eX]

[DOI]

Kuldeep S. Meel

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Tractable Abstract Argumentation via Backdoor-Treewidth.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Advanced Tools and Methods for Treewidth-Based Problem Solving

[BibT_eX]

[DOI]

Frontiers in Artificial Intelligence and Applications 359, IOS Press, ISBN: 978-1-64368-345-4, 2022

2021

Werkzeuge und Methoden zum Lösen von Problemen mittels Baumweite .

[BibT_eX]

[DOI]

Proceedings of the Ausgezeichnete Informatikdissertationen 2021., 2021

Advanced tools and methods for treewidth-based problem solving

[BibT_eX]

[DOI]

PhD thesis, 2021

Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2021

The Model Counting Competition 2020.

[BibT_eX]

[DOI]

Florim Hamiti

ACM J. Exp. Algorithmics, 2021

DynASP2.5: Dynamic Programming on Tree Decompositions in Action.

[BibT_eX]

[DOI]

Algorithms, 2021

Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting.

[BibT_eX]

[DOI]

Thomas Eiter

Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

Decomposition-Guided Reductions for Argumentation and Treewidth.

[BibT_eX]

[DOI]

Yasir Mahmood

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

aspmc: An Algebraic Answer Set Counter.

[BibT_eX]

[DOI]

Thomas Eiter

Proceedings of the International Conference on Logic Programming 2021 Workshops co-located with the 37th International Conference on Logic Programming (ICLP 2021), 2021

Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization.

[BibT_eX]

[DOI]

Valentin Roland

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

Complications for Computational Experiments from Modern Processors.

[BibT_eX]

[DOI]

Ciaran McCreesh

Anas Shahab

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

Knowledge-Base Degrees of Inconsistency: Complexity and Counting.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard.

[BibT_eX]

[DOI]

Jorge Fandinno

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology.

[BibT_eX]

[DOI]

Patrick Thier

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

Lower Bounds for QBFs of Bounded Treewidth.

[BibT_eX]

[DOI]

Andreas Pfandler

Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

Solving the Steiner Tree Problem with few Terminals.

[BibT_eX]

[DOI]

André Schidler

Proceedings of the 32nd IEEE International Conference on Tools with Artificial Intelligence, 2020

Structural Decompositions of Epistemic Logic Programs.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Logic Programming 2020 Workshop Proceedings co-located with 36th International Conference on Logic Programming (ICLP 2020), 2020

Breaking Symmetries with RootClique and LexTopSort.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2020

A Time Leap Challenge for SAT-Solving.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2020

Treewidth-Aware Quantifier Elimination and Expansion for QCSP.

[BibT_eX]

[DOI]

Maximilian F. I. Kieler

Proceedings of the Principles and Practice of Constraint Programming, 2020

2019

Inconsistency Proofs for ASP: The ASP - DRUPE Format.

[BibT_eX]

[DOI]

Mario Alviano

Carmine Dodaro

Tobias Philipp

Jakob Rath

Theory Pract. Log. Program., 2019

TE-ETH: Lower Bounds for QBFs of Bounded Treewidth.

[BibT_eX]

[DOI]

Andreas Pfandler

CoRR, 2019

Answer Set Solving exploiting Treewidth and its Limits.

[BibT_eX]

[DOI]

CoRR, 2019

Treewidth and Counting Projected Answer Sets.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2019

The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper).

[BibT_eX]

[DOI]

Muhammad Ayaz Dzulfikar

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

An Improved GPU-Based SAT Model Counter.

[BibT_eX]

[DOI]

Markus Zisser

Proceedings of the Principles and Practice of Constraint Programming, 2019

2018

Dynamic Programming on Tree Decompositions with D-FLAT.

[BibT_eX]

[DOI]

Künstliche Intell., 2018

Exploiting Treewidth for Projected Model Counting and Its Limits.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018

Exploiting Treewidth for Counting Projected Answer Sets.

[BibT_eX]

[DOI]

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, 2018

Weighted Model Counting on the GPU by Exploiting Small Treewidth.

[BibT_eX]

[DOI]

Markus Zisser

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

An SMT Approach to Fractional Hypertree Width.

[BibT_eX]

[DOI]

Neha Lodha

Proceedings of the Principles and Practice of Constraint Programming, 2018

2017

Answer Set Solving with Bounded Treewidth Revisited.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2017

2016

D-FLAT<sup>2</sup>: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2016

Counting Answer Sets via Dynamic Programming.

[BibT_eX]

[DOI]

CoRR, 2016

On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions.

[BibT_eX]

[DOI]

Bernhard Bliem