Publications
See also my DBLP entry, my Google Scholar profile, my HAL and arXiv profiles, and my DiVA publication list at Linköping University.
2026
- Journal Article Verified SAT Redundancy Checking in SPARK In Ada Lett., 45 (1): 94-101, 2026.
BibTeX for Verified SAT Redundancy Checking in SPARK (opens in a new tab) DOI for Verified SAT Redundancy Checking in SPARK (opens in a new tab) - Journal Article The Relative Strength of #SAT Proof Systems In Journal of Automated Reasoning, 70, 2026.
BibTeX for The Relative Strength of #SAT Proof Systems (opens in a new tab) DOI for The Relative Strength of #SAT Proof Systems (opens in a new tab) - Journal Article The Model Counting Competitions 2021-2023 In Artificial Intelligence, 360, 2026.
BibTeX for The Model Counting Competitions 2021-2023 (opens in a new tab) DOI for The Model Counting Competitions 2021-2023 (opens in a new tab) - Conference Counting Complexity of ASP In Proceedings of the 23rd International Conference on Principles of Knowledge Representation and Reasoning (KR'26), 2026.
BibTeX for Counting Complexity of ASP (opens in a new tab) DOI for Counting Complexity of ASP (opens in a new tab) - Conference Maximum Satisfiability of Simple Temporal Problems In Proceedings of the 35th International Joint Conference on Artificial Intelligence (IJCAI'26), 2026.
BibTeX for Maximum Satisfiability of Simple Temporal Problems (opens in a new tab) - Conference Diversity of Extensions in Abstract Argumentation In Proceedings of the 35th International Joint Conference on Artificial Intelligence (IJCAI'26), 2026.
BibTeX for Diversity of Extensions in Abstract Argumentation (opens in a new tab) - Conference Structure-Aware Encodings of Argumentation Properties for Clique-width In Proceedings of the 40th AAAI Conference on Artificial Intelligence (AAAI'26), Singapore, pages 19294-19302, AAAI Press, 2026.
BibTeX for Structure-Aware Encodings of Argumentation Properties for Clique-width (opens in a new tab) DOI for Structure-Aware Encodings of Argumentation Properties for Clique-width (opens in a new tab) - Conference Abstracting the Indistinguishable in ASP In Proceedings of the 35th International Joint Conference on Artificial Intelligence (IJCAI'26), 2026.
BibTeX for Abstracting the Indistinguishable in ASP (opens in a new tab) - Conference Representative Sets in Propositional Abduction In Proceedings of the 42nd International Conference on Logic Programming (ICLP'26), 2026.
BibTeX for Representative Sets in Propositional Abduction (opens in a new tab) DOI for Representative Sets in Propositional Abduction (opens in a new tab) - Proceedings NII Shonan Seminar NO.238. Model Counting: Theory meets Practice 2026.
BibTeX for NII Shonan Seminar NO.238. Model Counting: Theory meets Practice (opens in a new tab) URL for NII Shonan Seminar NO.238. Model Counting: Theory meets Practice (opens in a new tab) - Workshop Reverse-Engineering Constraint Models from CNFs: An Agentic Approach In Proceedings of the 17th International Workshop on Pragmatics of SAT (PoS'26), 2026.
BibTeX for Reverse-Engineering Constraint Models from CNFs: An Agentic Approach (opens in a new tab)
2025
- Journal Article Complexity of Faceted Explanations in Propositional Abduction In Theory and Practice of Logic Programming, 25 (4): 775-793, 2025.
BibTeX for Complexity of Faceted Explanations in Propositional Abduction (opens in a new tab) DOI for Complexity of Faceted Explanations in Propositional Abduction (opens in a new tab) - Conference Counting and Reasoning with Plans In Proceedings of the 39th Annual AAAI Conference on Artificial Intelligence (AAAI'25), Philadelphia, PA, USA, pages 26688-26696, The AAAI Press, 2025.
BibTeX for Counting and Reasoning with Plans (opens in a new tab) DOI for Counting and Reasoning with Plans (opens in a new tab) - Conference Facets in Argumentation: A Formal Approach to Argument Significance In Proceedings of the 34th International Joint Conference on Artificial Intelligence (IJCAI'25), pages 4491-4499, International Joint Conferences on Artificial Intelligence Organization, 2025.
BibTeX for Facets in Argumentation: A Formal Approach to Argument Significance (opens in a new tab) DOI for Facets in Argumentation: A Formal Approach to Argument Significance (opens in a new tab) - Conference Interactive Exploration of Plan Spaces In Proceedings of the 22nd International Conference on Principles of Knowledge Representation and Reasoning (KR'25), Melbourne, Australia, pages 599-609, IJCAI Organization, 2025.
BibTeX for Interactive Exploration of Plan Spaces (opens in a new tab) DOI for Interactive Exploration of Plan Spaces (opens in a new tab) - Proceedings Informal Proceedings of the 1st International Workshop on Trends in Knowledge Representation and Reasoning (TKR) Montreal, QC, Canada, 2025.
The workshop was co-located with the 34th International Joint Conference on Artificial Intelligence (IJCAI'25).https://tkr2025.krportal.org/ (opens in a new tab)
BibTeX for Informal Proceedings of the 1st International Workshop on Trends in Knowledge Representation and Reasoning (TKR) (opens in a new tab) - Proceedings Optimization and Automated Reasoning for Designing Future Space Missions (Dagstuhl Seminar 25362) In Dagstuhl Reports, 2025.
BibTeX for Optimization and Automated Reasoning for Designing Future Space Missions (Dagstuhl Seminar 25362) (opens in a new tab) URL for Optimization and Automated Reasoning for Designing Future Space Missions (Dagstuhl Seminar 25362) (opens in a new tab) - Proceedings Competitions and Empirical Evaluations in Automated Reasoning (Dagstuhl Seminar 25441) In Dagstuhl Reports, 2025.
BibTeX for Competitions and Empirical Evaluations in Automated Reasoning (Dagstuhl Seminar 25441) (opens in a new tab) URL for Competitions and Empirical Evaluations in Automated Reasoning (Dagstuhl Seminar 25441) (opens in a new tab) - Workshop PlanPilot: Efficient Navigation in Plan Space In Informal Proceedings of the Workshop on Explainable Artificial Intelligence (XAI@IJCAI), 2025.
BibTeX for PlanPilot: Efficient Navigation in Plan Space (opens in a new tab) URL for PlanPilot: Efficient Navigation in Plan Space (opens in a new tab) - Workshop Verified SAT Redundancy Checking in SPARK In Proceedings 29th Ada-Europe International Conference on Reliable Software Technologies (AEiC'25 aka Ada-Europe'25), 2025.
To appear in the WiP track.
BibTeX for Verified SAT Redundancy Checking in SPARK (opens in a new tab) - Demo ICAPS 2025 Demo PlanPilot 2025.
BibTeX for ICAPS 2025 Demo PlanPilot (opens in a new tab) URL for ICAPS 2025 Demo PlanPilot (opens in a new tab) - Demo ICAPS 2025 Teaser PlanPilot 2025.
BibTeX for ICAPS 2025 Teaser PlanPilot (opens in a new tab) URL for ICAPS 2025 Teaser PlanPilot (opens in a new tab) - Tech report The Model Counting Competitions 2021-2023 2025.
BibTeX for The Model Counting Competitions 2021-2023 (opens in a new tab) arXiv for The Model Counting Competitions 2021-2023 (opens in a new tab)
2024
- Journal Article IASCAR: Incremental Answer Set Counting by Anytime Refinement In Theory and Practice of Logic Programming, 24 (3): 505-532, 2024.
BibTeX for IASCAR: Incremental Answer Set Counting by Anytime Refinement (opens in a new tab) DOI for IASCAR: Incremental Answer Set Counting by Anytime Refinement (opens in a new tab) - Journal Article Counting Complexity for Reasoning in Abstract Argumentation In J. Artif. Intell. Res., 80: 805-834, 2024.
BibTeX for Counting Complexity for Reasoning in Abstract Argumentation (opens in a new tab) DOI for Counting Complexity for Reasoning in Abstract Argumentation (opens in a new tab) - Conference Navigating and Querying Answer Sets: How Hard Is It Really and Why? In Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning (KR'24), Hanoi, Vietnam, 2024.
BibTeX for Navigating and Querying Answer Sets: How Hard Is It Really and Why? (opens in a new tab) DOI for Navigating and Querying Answer Sets: How Hard Is It Really and Why? (opens in a new tab) - Conference Forgetting in Counting and Bounded Treewidth In Proceedings of the 36th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'24), Herndon, VA, USA, pages 27-35, IEEE Computer Soc., 2024.
BibTeX for Forgetting in Counting and Bounded Treewidth (opens in a new tab) DOI for Forgetting in Counting and Bounded Treewidth (opens in a new tab) - Conference Rejection in Abstract Argumentation: Harder Than Acceptance? In Proceedings of the 27th European Conference on Artificial Intelligence (ECAI'24), Santiago de Compostela, Spain, Volume 392 of Frontiers in Artificial Intelligence and Applications, pages 3212-3219, IOS Press, 2024.
BibTeX for Rejection in Abstract Argumentation: Harder Than Acceptance? (opens in a new tab) DOI for Rejection in Abstract Argumentation: Harder Than Acceptance? (opens in a new tab) - Conference The Relative Strength of #SAT Proof Systems In Proceedings of the 27th International Conference on Theory and Applications of Satisfiability Testing (SAT'24), Pune, India, Volume 305 of LIPIcs, pages 5:1-5:19, Dagstuhl Publishing, 2024.
BibTeX for The Relative Strength of #SAT Proof Systems (opens in a new tab) DOI for The Relative Strength of #SAT Proof Systems (opens in a new tab) - Conference Epistemic Logic Programs: Non-Ground and Counting Complexity In Proceedings of the 33rd International Joint Conference on Artificial Intelligence (IJCAI'24), Jeju, South Korea, pages 3333-3341, ijcai.org, 2024.
BibTeX for Epistemic Logic Programs: Non-Ground and Counting Complexity (opens in a new tab) DOI for Epistemic Logic Programs: Non-Ground and Counting Complexity (opens in a new tab) - Conference Parallel Empirical Evaluations: Resilience despite Concurrency In Proceedings 38th AAAI Conference on Artificial Intelligence (AAAI'24), Vancouver, Canada, pages 8004-8012, The AAAI Press, 2024.
BibTeX for Parallel Empirical Evaluations: Resilience despite Concurrency (opens in a new tab) DOI for Parallel Empirical Evaluations: Resilience despite Concurrency (opens in a new tab)
2023
- Journal Article The Silent (R)evolution of SAT In Communications of the ACM, 66 (6): 64-72, 2023.
BibTeX for The Silent (R)evolution of SAT (opens in a new tab) DOI for The Silent (R)evolution of SAT (opens in a new tab) - Journal Article Solving Projected Model Counting by Utilizing Treewidth and its Limits In Artificial Intelligence, 314: 103810, 2023.
BibTeX for Solving Projected Model Counting by Utilizing Treewidth and its Limits (opens in a new tab) DOI for Solving Projected Model Counting by Utilizing Treewidth and its Limits (opens in a new tab) - Conference Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation In Proceedings of the 32nd International Joint Conference on Artificial Intelligence (IJCAI'23), Macao, SAR, China, pages 3212-3220, 2023.
BibTeX for Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation (opens in a new tab) DOI for Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation (opens in a new tab) - Conference Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF In Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'23), Boston, MA, USA, pages 1-14, IEEE Computer Soc., 2023.
BibTeX for Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF (opens in a new tab) DOI for Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF (opens in a new tab) - Conference Inconsistent Cores for ASP: The Perks and Perils of Non-monotonicity In Proceedings of the 37th AAAI Conference on Artificial Intelligence (AAAI'23), Washington, DC, USA, pages 6363-6371, The AAAI Press, 2023.
BibTeX for Inconsistent Cores for ASP: The Perks and Perils of Non-monotonicity (opens in a new tab) DOI for Inconsistent Cores for ASP: The Perks and Perils of Non-monotonicity (opens in a new tab) - The Silent (R)evolution of SAT 2023.
BibTeX for The Silent (R)evolution of SAT (opens in a new tab) URL for The Silent (R)evolution of SAT (opens in a new tab)
2022
- Journal Article Default logic and bounded treewidth In Information and Computation, 283: 104675, 2022.
BibTeX for Default logic and bounded treewidth (opens in a new tab) DOI for Default logic and bounded treewidth (opens in a new tab) - Journal Article Exploiting Database Management Systems and Treewidth for Counting In Theory and Practice of Logic Programming, 22 (1): 128-157, 2022.
BibTeX for Exploiting Database Management Systems and Treewidth for Counting (opens in a new tab) DOI for Exploiting Database Management Systems and Treewidth for Counting (opens in a new tab) - Conference Plausibility Reasoning via Projected Answer Set Counting - A Hybrid Approach In Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI'22), pages 2620-2626, International Joint Conferences on Artificial Intelligence Organization, 2022.
BibTeX for Plausibility Reasoning via Projected Answer Set Counting - A Hybrid Approach (opens in a new tab) DOI for Plausibility Reasoning via Projected Answer Set Counting - A Hybrid Approach (opens in a new tab) - Conference A Practical Account into Counting Dung's Extensions by Dynamic Programming In Proceedings of the 16th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR'22), Volume 13416 of Lecture Notes in Computer Science, pages 387-400, Springer Verlag, 2022.
BibTeX for A Practical Account into Counting Dung's Extensions by Dynamic Programming (opens in a new tab) DOI for A Practical Account into Counting Dung's Extensions by Dynamic Programming (opens in a new tab) - Conference A Quantitative Symbolic Approach to Individual Human Reasoning In Proceedings of the 44th Annual Conference on Cognitive Society (CogSci'22), pages 2838-2846, 2022.
BibTeX for A Quantitative Symbolic Approach to Individual Human Reasoning (opens in a new tab) URL for A Quantitative Symbolic Approach to Individual Human Reasoning (opens in a new tab) - Conference IASCAR: Incremental Answer Set Counting by Anytime Refinement In Proceedings of the 16th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR'22), pages 217-230, Springer Verlag, 2022.
BibTeX for IASCAR: Incremental Answer Set Counting by Anytime Refinement (opens in a new tab) DOI for IASCAR: Incremental Answer Set Counting by Anytime Refinement (opens in a new tab) - Conference Rushing and Strolling among Answer Sets -- Navigation Made Easy In Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI'22), The AAAI Press, 2022.
BibTeX for Rushing and Strolling among Answer Sets -- Navigation Made Easy (opens in a new tab) DOI for Rushing and Strolling among Answer Sets -- Navigation Made Easy (opens in a new tab) - Conference Proofs for Propositional Model Counting In Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing (SAT'22), Dagstuhl, Germany, Volume 236 of LIPIcs, pages 30:1-30:24, Dagstuhl Publishing, 2022.
BibTeX for Proofs for Propositional Model Counting (opens in a new tab) DOI for Proofs for Propositional Model Counting (opens in a new tab) - Conference ApproxASP -- A Scalable Approximate Answer Set Counter In Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI'22), The AAAI Press, 2022.
BibTeX for ApproxASP -- A Scalable Approximate Answer Set Counter (opens in a new tab) DOI for ApproxASP -- A Scalable Approximate Answer Set Counter (opens in a new tab) - Proceedings Informal Proceedings of the Workshop on Counting and Sampling (CS'22) 2022.
The workshop was co-located with the 25th International Conference on Theory and Applications of Satisfiability Testing (SAT'22).
BibTeX for Informal Proceedings of the Workshop on Counting and Sampling (CS'22) (opens in a new tab) URL for Informal Proceedings of the Workshop on Counting and Sampling (CS'22) (opens in a new tab) - Workshop Model Counting, its Relationship to Symbolic Quantitative AI, and a Glimpse into Practical Solving (Invited Talk) In Proceedings of the 4th International Workshop on Systems and Algorithms for Formal Argumentation co-located with the 9th International Conference on Computational Models of Argument (COMMA'22), Cardiff, Wales, UK, Volume 3236 of CEUR Workshop Proceedings, pages 1-4, CEUR-WS.org, 2022.
BibTeX for Model Counting, its Relationship to Symbolic Quantitative AI, and a Glimpse into Practical Solving (Invited Talk) (opens in a new tab)
2021
- Journal Article The Model Counting Competition 2020 In ACM Journal of Experimental Algorithmics, 26 (1): 1-26, 2021.
BibTeX for The Model Counting Competition 2020 (opens in a new tab) DOI for The Model Counting Competition 2020 (opens in a new tab) - Journal Article DynASP2.5: Dynamic Programming on Tree Decompositions in Action, in Algorithms In Algorithms, 14 (3), 2021.
BibTeX for DynASP2.5: Dynamic Programming on Tree Decompositions in Action, in Algorithms (opens in a new tab) - Conference Complications for Computational Experiments from Modern Processors In Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming (CP'21), Dagstuhl, Germany, Volume 210 of LIPIcs, pages 25:1-25:21, Dagstuhl Publishing, 2021.
BibTeX for Complications for Computational Experiments from Modern Processors (opens in a new tab) DOI for Complications for Computational Experiments from Modern Processors (opens in a new tab) - Conference Decomposition-Guided Reductions for Argumentation and Treewidth In Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI'21), Virtual, pages 1880-1886, The AAAI Press, 2021.
BibTeX for Decomposition-Guided Reductions for Argumentation and Treewidth (opens in a new tab) DOI for Decomposition-Guided Reductions for Argumentation and Treewidth (opens in a new tab) - Conference Knowledge-Base Degrees of Inconsistency: Complexity and Counting In Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI'21), pages 6349-6357, The AAAI Press, 2021.
BibTeX for Knowledge-Base Degrees of Inconsistency: Complexity and Counting (opens in a new tab) DOI for Knowledge-Base Degrees of Inconsistency: Complexity and Counting (opens in a new tab) - Conference Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization In Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming (CP'21), Dagstuhl, Germany, Volume 210 of LIPIcs, pages 24:1-24:20, Dagstuhl Publishing, 2021.
BibTeX for Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization (opens in a new tab) DOI for Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization (opens in a new tab) - Proceedings Informal Proceedings of the Workshop on Counting and Sampling (CS'21) 2021.
The workshop was co-located with the 24th International Conference on Theory and Applications of Satisfiability Testing (SAT'21).
BibTeX for Informal Proceedings of the Workshop on Counting and Sampling (CS'21) (opens in a new tab) URL for Informal Proceedings of the Workshop on Counting and Sampling (CS'21) (opens in a new tab)
2020
- Conference Solving the Steiner Tree Problem with few Terminals In Proceedings of the 32nd International Conference on Tools with Artificial Intelligence (ICTAI'2020), IEEE Computer Soc., 2020.
BibTeX for Solving the Steiner Tree Problem with few Terminals (opens in a new tab) DOI for Solving the Steiner Tree Problem with few Terminals (opens in a new tab) - Conference Treewidth-Aware Quantifier Elimination and Expansion for QCSP In Proceedings of the 26th International Conference on Principles and Practice of Constraint Programming (CP'20), Volume 12333 of Lecture Notes in Computer Science, pages 248-266, Springer Verlag, 2020.
BibTeX for Treewidth-Aware Quantifier Elimination and Expansion for QCSP (opens in a new tab) DOI for Treewidth-Aware Quantifier Elimination and Expansion for QCSP (opens in a new tab) - Conference A Time Leap Challenge for SAT-Solving In Proceedings of the 26th International Conference Principles and Practice of Constraint Programming (CP'20), Volume 12333 of Lecture Notes in Computer Science, pages 267-285, Springer Verlag, 2020.
BibTeX for A Time Leap Challenge for SAT-Solving (opens in a new tab) DOI for A Time Leap Challenge for SAT-Solving (opens in a new tab) - Conference Breaking Symmetries with RootClique and LexTopSort In Proceedings of the 26th International Conference Principles and Practice of Constraint Programming (CP'20), Volume 12333 of Lecture Notes in Computer Science, pages 267-285, Springer Verlag, 2020.
BibTeX for Breaking Symmetries with RootClique and LexTopSort (opens in a new tab) DOI for Breaking Symmetries with RootClique and LexTopSort (opens in a new tab) - Conference Towards Faster Reasoners by Using Transparent Huge Pages In Proceedings of the 26th International Conference Principles and Practice of Constraint Programming (CP'20), Volume 12333 of Lecture Notes in Computer Science, pages 267-285, Springer Verlag, 2020.
BibTeX for Towards Faster Reasoners by Using Transparent Huge Pages (opens in a new tab) DOI for Towards Faster Reasoners by Using Transparent Huge Pages (opens in a new tab) - Conference Exploiting Database Management Systems and Treewidth for Counting In Proceedings of the 22nd International Symposium on Practical Aspects of Declarative Languages (PADL'20), New Orleans, LA, USA, Volume 12007 of Lecture Notes in Computer Science, pages 151-167, Springer Verlag, 2020.
BibTeX for Exploiting Database Management Systems and Treewidth for Counting (opens in a new tab) DOI for Exploiting Database Management Systems and Treewidth for Counting (opens in a new tab) - Conference Lower Bounds for QBFs of Bounded Treewidth In Proceedings of the IEEE Symposium on Logic in Computer Science (LICS'20), Assoc. Comput. Mach., New York, 2020.
BibTeX for Lower Bounds for QBFs of Bounded Treewidth (opens in a new tab) DOI for Lower Bounds for QBFs of Bounded Treewidth (opens in a new tab) - Proceedings Informal Proceedings of the Workshop on Model Counting (MC'20) 2020.
The workshop was co-located with the 23rd International Conference on Theory and Applications of Satisfiability Testing (SAT'20).
BibTeX for Informal Proceedings of the Workshop on Model Counting (MC'20) (opens in a new tab) URL for Informal Proceedings of the Workshop on Model Counting (MC'20) (opens in a new tab) - Workshop Counting with Bounded Treewidth: Meta Algorithm and Runtime Guarantees In Proceedings of the 18th International Workshop on Non-Monotonic Reasoning (NMR'20), pages 9-18, 2020.
BibTeX for Counting with Bounded Treewidth: Meta Algorithm and Runtime Guarantees (opens in a new tab)
2019
- Journal Article Inconsistency Proofs for ASP: The ASP -- DRUPE Format In Theory and Practice of Logic Programming, 19 (5-6): 891--907, 2019.
BibTeX for Inconsistency Proofs for ASP: The ASP -- DRUPE Format (opens in a new tab) DOI for Inconsistency Proofs for ASP: The ASP -- DRUPE Format (opens in a new tab) - Journal Article A multiparametric view on answer set programming In Ann. Math. Artif. Intell., 86 (1-3): 121-147, 2019.
BibTeX for A multiparametric view on answer set programming (opens in a new tab) DOI for A multiparametric view on answer set programming (opens in a new tab) - Conference The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration In Proceedings of the 14th International Symposium on Parameterized and Exact Computation (IPEC'19), Munich, Germany, Volume 148 of LIPIcs, pages 25:1-25:23, Dagstuhl Publishing, 2019.
BibTeX for The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (opens in a new tab) DOI for The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (opens in a new tab) - Conference An Improved GPU-Based SAT Model Counter In Proceedings of the 25th International Conference on Principles and Practice of Constraint Programming (CP'19), Stamford, CT, USA, pages 491-509, Springer Verlag, 2019.
BibTeX for An Improved GPU-Based SAT Model Counter (opens in a new tab) DOI for An Improved GPU-Based SAT Model Counter (opens in a new tab) - Conference Treewidth and Counting Projected Answer Sets In Proceedings of the 15th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'19), Philadelphia, PA, USA, Volume 11481 of Lecture Notes in Computer Science, pages 105-119, Springer Verlag, 2019.
BibTeX for Treewidth and Counting Projected Answer Sets (opens in a new tab) DOI for Treewidth and Counting Projected Answer Sets (opens in a new tab) - Conference Counting Complexity for Reasoning in Abstract Argumentation In Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI'19), Honolulu, Hawaii, USA, The AAAI Press, 2019.
BibTeX for Counting Complexity for Reasoning in Abstract Argumentation (opens in a new tab) DOI for Counting Complexity for Reasoning in Abstract Argumentation (opens in a new tab) - Proceedings Proceedings of the 12th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP'19) Philadelphia, PA, USA, 2019.
The workshop was co-located with the 15th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR'19)
BibTeX for Proceedings of the 12th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP'19) (opens in a new tab) - Gastbeitrag: Untere Schranken fuer quantifizierte Boole'sche Formeln mit beschraenkter Baumweite In GI Newsletter Fachgruppe Komplexität (8), 2019.
BibTeX for Gastbeitrag: Untere Schranken fuer quantifizierte Boole'sche Formeln mit beschraenkter Baumweite (opens in a new tab) URL for Gastbeitrag: Untere Schranken fuer quantifizierte Boole'sche Formeln mit beschraenkter Baumweite (opens in a new tab) - Tech report SAHRA -- Smart Analysis Health Research Access: Schlussbericht zum Projekt: Teilvorhaben: Aufbau und Betrieb der physischen SAHRA-Plattform und der Softwareplattform Technical Report, data experts, 2019.
BibTeX for SAHRA -- Smart Analysis Health Research Access: Schlussbericht zum Projekt: Teilvorhaben: Aufbau und Betrieb der physischen SAHRA-Plattform und der Softwareplattform (opens in a new tab) DOI for SAHRA -- Smart Analysis Health Research Access: Schlussbericht zum Projekt: Teilvorhaben: Aufbau und Betrieb der physischen SAHRA-Plattform und der Softwareplattform (opens in a new tab)
2018
- Conference Exploiting Treewidth for Projected Model Counting and its Limits In Proceedings on the 21th International Conference on Theory and Applications of Satisfiability Testing (SAT'18), Oxford, UK, Volume 10929 of Lecture Notes in Computer Science, pages 165-184, Springer Verlag, 2018.
BibTeX for Exploiting Treewidth for Projected Model Counting and its Limits (opens in a new tab) DOI for Exploiting Treewidth for Projected Model Counting and its Limits (opens in a new tab) - Conference Default Logic and Bounded Treewidth In Proceedings of the 12th International Conference on Language and Automata Theory and Applications (LATA'18), Bar Ilan, Israel, Lecture Notes in Computer Science, Springer Verlag, 2018.
BibTeX for Default Logic and Bounded Treewidth (opens in a new tab) DOI for Default Logic and Bounded Treewidth (opens in a new tab) - Conference An SMT Approach to Fractional Hypertree Width In Proceedings of the 24th International Conference on Principles and Practice of Constraint Programming (CP'18), Lille, France, Volume 11008 of Lecture Notes in Computer Science, pages 109-127, Springer Verlag, 2018.
BibTeX for An SMT Approach to Fractional Hypertree Width (opens in a new tab) DOI for An SMT Approach to Fractional Hypertree Width (opens in a new tab) - Conference Weighted Model Counting on the GPU by Exploiting Small Treewidth In Proceedings of the 26th Annual European Symposium on Algorithms (ESA'18), Volume 112 of LIPIcs, pages 28:1-28:16, Dagstuhl Publishing, 2018.
BibTeX for Weighted Model Counting on the GPU by Exploiting Small Treewidth (opens in a new tab) DOI for Weighted Model Counting on the GPU by Exploiting Small Treewidth (opens in a new tab) - Conference Exploiting Treewidth for Counting Projected Answer Sets In Proceedings of the 16th International Conference on Principles of Knowledge Representation and Reasoning (KR'18), 2018.
BibTeX for Exploiting Treewidth for Counting Projected Answer Sets (opens in a new tab) - Proceedings Proceedings of the 11th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP'18) Oxford, UK, 2018.
The workshop was co-located with the 34th International Conference on Logic Programming (ICLP'18)
BibTeX for Proceedings of the 11th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP'18) (opens in a new tab) arXiv for Proceedings of the 11th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP'18) (opens in a new tab)
2017
- Conference SAT-Based Local Improvement for Finding Tree Decompositions of Small Width In Proceedings on the 20th International Conference on Theory and Applications of Satisfiability Testing (SAT'17), Melbourne, VIC, Australia, pages 401-411, Springer Verlag, 2017.
BibTeX for SAT-Based Local Improvement for Finding Tree Decompositions of Small Width (opens in a new tab) DOI for SAT-Based Local Improvement for Finding Tree Decompositions of Small Width (opens in a new tab) - Conference Answer Set Solving with Bounded Treewidth Revisited In Proceedings of the 14th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'17), Espoo, Finland, Volume 10377 of Lecture Notes in Computer Science, pages 132-145, 2017.
BibTeX for Answer Set Solving with Bounded Treewidth Revisited (opens in a new tab) DOI for Answer Set Solving with Bounded Treewidth Revisited (opens in a new tab) - Conference DynASP2.5: Dynamic Programming on Tree Decompositions in Action In Proceedings of the 12th International Symposium on Parameterized and Exact Computation (IPEC'17), Dagstuhl Publishing, 2017.
BibTeX for DynASP2.5: Dynamic Programming on Tree Decompositions in Action (opens in a new tab) DOI for DynASP2.5: Dynamic Programming on Tree Decompositions in Action (opens in a new tab) - Workshop Backdoor Trees for Answer Set Programming In Proceedings of the 10th Workshop on Answer Set Programming and Other Computing Paradigms co-located with the 14th International Conference on Logic Programming and Nonmonotonic Reasoning (ASPOCP@LPNMR'17), Espoo, Finland, pages 9:1-14, CEUR Workshop Proceedings, 2017.
BibTeX for Backdoor Trees for Answer Set Programming (opens in a new tab)
2016
- Conference Towards an integrated health research process: A cloud-based approach In Proceedings of the 2016 IEEE International Conference on Big Data (BigData'16), Washington, D.C., USA, pages 2813-2818, IEEE Computer Soc., 2016.
BibTeX for Towards an integrated health research process: A cloud-based approach (opens in a new tab) DOI for Towards an integrated health research process: A cloud-based approach (opens in a new tab) - Conference Strong Backdoors for Default Logic In Proceedings of the 19th International Conference Theory and Applications of Satisfiability Testing (SAT'16), Bordeaux, France, pages 45-59, Springer Verlag, 2016.
BibTeX for Strong Backdoors for Default Logic (opens in a new tab) DOI for Strong Backdoors for Default Logic (opens in a new tab) - Proceedings Proceedings of the 1st Workshop on Trends and Applications of Answer Set Programming (TAASP'16) Klagenfurt, Austria, 2016.
The workshop was co-located with the 39th edition of the German Conference on Artificial Intelligence (KI'16)
BibTeX for Proceedings of the 1st Workshop on Trends and Applications of Answer Set Programming (TAASP'16) (opens in a new tab)
2015
- Journal Article Backdoors to Normality for Disjunctive Logic Programs In ACM Trans. Comput. Log., 17 (1): 1-23, 2015.
BibTeX for Backdoors to Normality for Disjunctive Logic Programs (opens in a new tab) DOI for Backdoors to Normality for Disjunctive Logic Programs (opens in a new tab) - Journal Article Backdoors to Tractable Answer-Set Programming In Artificial Intelligence, 220 (0): 64-103, 2015.
BibTeX for Backdoors to Tractable Answer-Set Programming (opens in a new tab) DOI for Backdoors to Tractable Answer-Set Programming (opens in a new tab) - Journal Article Dual-normal programs -- The forgotten class In Theory and Practice of Logic Programming: 495-510, 2015.
BibTeX for Dual-normal programs -- The forgotten class (opens in a new tab) DOI for Dual-normal programs -- The forgotten class (opens in a new tab) - Thesis Backdoors to Tractability of Disjunctive Answer Set Programming Ph.D. Thesis, Fakultät für Informatik an der Technischen Universität Wien, 2015.
BibTeX for Backdoors to Tractability of Disjunctive Answer Set Programming (opens in a new tab)
2013
- Conference Backdoors to Normality for Disjunctive Logic Programs In Proceedings of the 27th AAAI Conference on Artificial Intelligence (AAAI'13), Bellevue, WA, USA, pages 320-327, The AAAI Press, 2013.
A preliminary version of the paper was presented on the Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP'12).
BibTeX for Backdoors to Normality for Disjunctive Logic Programs (opens in a new tab) DOI for Backdoors to Normality for Disjunctive Logic Programs (opens in a new tab) - Conference Backdoors to Tractability of Answer-Set Programming In Proceedings of the 27th AAAI Conference on Artificial Intelligence (Proceedings of the 18th AAAI-SIGART Doctoral Consortium) (AAAI DC'13), Bellevue, WA, USA, pages 1662-1663, The AAAI Press, 2013.
BibTeX for Backdoors to Tractability of Answer-Set Programming (opens in a new tab)
2012
- Workshop Backdoors to Normality for Disjunctive Logic Programs In Proceedings of the 5th International Workshop Answer Set Programming and Other Computing Paradigms (ASPOCP'12), Budapest, Hungary, Volume abs/cs/1301.1391v2 of CoRR, pages 99-114, 2012.
BibTeX for Backdoors to Normality for Disjunctive Logic Programs (opens in a new tab) - Workshop The Good, the Bad, and the Odd: Cycles in Answer-Set Programs In Proceedings of the 23rd European Summer School in Logic, Language and Information (ESSLLI'11) and in New Directions in Logic, Language and Computation (ESSLLI'10 and ESSLLI'11 Student Sessions, Selected Papers Series), Volume 7415 of Lecture Notes in Computer Science, pages 78-90, Springer Verlag, 2012.
BibTeX for The Good, the Bad, and the Odd: Cycles in Answer-Set Programs (opens in a new tab) DOI for The Good, the Bad, and the Odd: Cycles in Answer-Set Programs (opens in a new tab)
2011
- Journal Article Clause-learning algorithms with many restarts and bounded-width resolution In J. Artif. Intell. Res., 40: 353-373, 2011.
BibTeX for Clause-learning algorithms with many restarts and bounded-width resolution (opens in a new tab) DOI for Clause-learning algorithms with many restarts and bounded-width resolution (opens in a new tab) - Conference Backdoors to Tractable Answer-Set Programming In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI'11), Barcelona, Catalonia, Spain, pages 863-868, The AAAI Press, 2011.
BibTeX for Backdoors to Tractable Answer-Set Programming (opens in a new tab) DOI for Backdoors to Tractable Answer-Set Programming (opens in a new tab)
2009
- Conference Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution In Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing (SAT'09), Swansea, UK, Volume 5584 of Lecture Notes in Computer Science, pages 114-127, Springer Verlag, 2009.
BibTeX for Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution (opens in a new tab) DOI for Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution (opens in a new tab)