| Publication | Date of Publication | Type |
|---|
| Optimal planning with expressive action languages as constraint optimization | 2024-05-29 | Paper |
| Translation-based approaches for solving disjunctive temporal problems with preferences | 2019-10-25 | Paper |
| Ideal and real belief about belief | 2019-04-29 | Paper |
| Twelve Years of QBF Evaluations: QSAT Is PSPACE-Hard and It Shows | 2017-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3457218 | 2015-12-11 | Paper |
| A subset-matching size-bounded cache for testing satisfiability in modal logics | 2015-06-17 | Paper |
| Combining approaches for solving satisfiability problems with qualitative preferences | 2014-09-24 | Paper |
| \textsf{TSAT++}: an open platform for satisfiability modulo theories | 2013-09-25 | Paper |
| Algorithms for Solving Satisfiability Problems with Qualitative Preferences | 2012-07-23 | Paper |
| An action-based approach to the formal specification and automatic analysis of business processes under authorization constraints | 2012-05-11 | Paper |
| Introducing Preferences in Planning as Satisfiability | 2011-06-10 | Paper |
| Solving satisfiability problems with preferences | 2010-11-19 | Paper |
| sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning | 2010-09-29 | Paper |
| Theory and Applications of Satisfiability Testing | 2009-07-24 | Paper |
| On the relation among answer set solvers | 2009-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3624018 | 2009-04-28 | Paper |
| optsat: A Tool for Solving SAT Related Optimization Problems | 2008-10-30 | Paper |
| Principles and Practice of Constraint Programming – CP 2004 | 2008-09-09 | Paper |
| Answer set programming based on propositional satisfiability | 2007-01-30 | Paper |
| The SAT-based approach to separation logic | 2007-01-24 | Paper |
| Formal Methods in Computer-Aided Design | 2006-10-20 | Paper |
| Logic Programming | 2006-06-27 | Paper |
| AI*IA 2005: Advances in Artificial Intelligence | 2006-06-27 | Paper |
| Nonmonotonic causal theories | 2006-02-07 | Paper |
| SAT-based planning in complex domains: Concurrency, constraints and nondeterminism | 2006-02-07 | Paper |
| Backjumping for quantified Boolean logic satisfiability | 2006-02-07 | Paper |
| Mechanizing Mathematical Reasoning | 2006-01-10 | Paper |
| Theory and Applications of Satisfiability Testing | 2005-12-16 | Paper |
| Theory and Applications of Satisfiability Testing | 2005-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737124 | 2004-08-11 | Paper |
| SAT vs. Translation Based decision procedures for modal logics: a comparative evaluation | 2004-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708926 | 2003-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4804909 | 2003-05-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4799252 | 2003-03-18 | Paper |
| Ideal and real belief about belief | 2003-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551177 | 2002-09-04 | Paper |
| SAT-based decision procedures for classical modal logics | 2002-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4539620 | 2002-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4539619 | 2002-07-10 | Paper |
| SAT-based decision procedures for classical modal logics | 2001-11-21 | Paper |
| Towards an efficient library for SAT: A manifesto | 2001-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723426 | 2001-07-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721199 | 2001-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4518913 | 2001-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4518914 | 2001-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4935597 | 2000-06-13 | Paper |
| Representing action: indeterminacy and ramifications | 1998-06-30 | Paper |
| Embedding complex decision procedures inside an interactive theorem prover. | 1997-05-12 | Paper |
| Structured proof procedures | 1997-03-03 | Paper |
| A multicontext architecture for formalizing complex reasoning | 1995-11-20 | Paper |
