| Publication | Date of Publication | Type |
|---|
| MaxSAT-based bi-objective Boolean optimization | 2024-07-12 | Paper |
| Improvements to the implicit hitting set approach to pseudo-Boolean optimization | 2024-07-12 | Paper |
| Incremental maximum satisfiability | 2024-07-12 | Paper |
| Computing MUS-based inconsistency measures | 2024-05-29 | Paper |
| Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation | 2023-12-12 | Paper |
| ICCMA 2023: Benchmarks and raw results | 2023-09-15 | Dataset |
| Computing smallest MUSes of quantified Boolean formulas | 2023-04-04 | Paper |
| Clause redundancy and preprocessing in maximum satisfiability | 2022-12-07 | Paper |
| SAT competition 2020 | 2021-12-13 | Paper |
| Acceptance in incomplete argumentation frameworks | 2021-11-02 | Paper |
| Declarative Algorithms and Complexity Results for Assumption-Based Argumentation | 2021-08-05 | Paper |
| Strong Refinements for Hard Problems in Argumentation Dynamics | 2021-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4999322 | 2021-07-06 | Paper |
| Discovering causal graphs with cycles and latent confounders: an exact branch-and-bound approach | 2020-02-26 | Paper |
| Unifying reasoning and core-guided search for maximum satisfiability | 2020-02-18 | Paper |
| Preprocessing argumentation frameworks via replacement patterns | 2020-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5215685 | 2020-02-12 | Paper |
| Synthesizing Argumentation Frameworks from Examples | 2019-11-26 | Paper |
| Solving Graph Problems via Potential Maximal Cliques | 2019-03-27 | Paper |
| Cautious reasoning in ASP via minimal models and unsatisfiable cores | 2018-12-04 | Paper |
| Synthesizing Argumentation Frameworks from Examples | 2018-07-12 | Paper |
| Subsumed Label Elimination for Maximum Satisfiability | 2018-07-12 | Paper |
| A constraint optimization approach to causal discovery from subsampled time series data | 2017-11-17 | Paper |
| Improving MCS enumeration via caching | 2017-11-15 | Paper |
| Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation | 2017-10-24 | Paper |
| From structured to abstract argumentation: assumption-based acceptance via AF reasoning | 2017-09-05 | Paper |
| Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability | 2017-02-22 | Paper |
| Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets and Complexity | 2017-02-17 | Paper |
| Pakota: A System for Enforcement in Abstract Argumentation | 2016-11-30 | Paper |
| LMHS: A SAT-IP Hybrid MaxSAT Solver | 2016-09-05 | Paper |
| MaxSAT-Based Cutting Planes for Learning Graphical Models | 2016-07-25 | Paper |
| Separating OR, SUM, and XOR circuits | 2016-04-18 | Paper |
| Synchronous counting and computational algorithm design | 2015-12-11 | Paper |
| Complexity-sensitive decision procedures for abstract argumentation | 2015-08-27 | Paper |
| Clause Elimination for SAT and QSAT | 2015-08-25 | Paper |
| Weak models of distributed computing, with connections to modal logic | 2015-03-25 | Paper |
| Answer Set Solver Backdoors | 2015-01-14 | Paper |
| Weak models of distributed computing, with connections to modal logic | 2014-12-05 | Paper |
| Conditional Lower Bounds for Failed Literals and Related Techniques | 2014-09-26 | Paper |
| Finding Efficient Circuits for Ensemble Computation | 2013-08-12 | Paper |
| Formula Preprocessing in MUS Extraction | 2013-08-05 | Paper |
| Simulating circuit-level simplifications on CNF | 2013-07-05 | Paper |
| Revisiting Hyper Binary Resolution | 2013-06-04 | Paper |
| Inprocessing Rules | 2012-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3089145 | 2011-08-24 | Paper |
| Efficient CNF Simplification Based on Binary Implication Graphs | 2011-06-17 | Paper |
| Clause Elimination Procedures for CNF Formulas | 2010-10-12 | Paper |
| Reconstructing Solutions after Blocked Clause Elimination | 2010-09-29 | Paper |
| Testing and debugging techniques for answer set solver development | 2010-08-19 | Paper |
| Blocked Clause Elimination | 2010-04-27 | Paper |
| A Module-Based Framework for Multi-language Constraint Modeling | 2009-11-10 | Paper |
| Max-ASP: Maximum Satisfiability of Answer Set Programs | 2009-11-10 | Paper |
| Limitations of restricted branching in clause learning | 2009-08-06 | Paper |
| Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs | 2009-03-05 | Paper |
| Justification-Based Local Search with Adaptive Noise Strategies | 2009-01-27 | Paper |
| Extended ASP Tableaux and rule redundancy in normal logic programs | 2008-12-18 | Paper |
| The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study | 2008-09-29 | Paper |
| Limitations of Restricted Branching in Clause Learning | 2008-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3429155 | 2007-03-30 | Paper |
| Unrestricted vs restricted cut in a tableau method for Boolean circuits | 2006-01-23 | Paper |
