| Publication | Date of Publication | Type |
|---|
| On compact representations of propositional circumscription | 2017-12-04 | Paper |
| Complexity of propositional nested circumscription and nested abnormality theories | 2017-07-12 | Paper |
| Generalizing consistency and other constraint properties to quantified constraints | 2015-09-17 | Paper |
| On the separability of subproblems in Benders decompositions | 2010-02-01 | Paper |
| Exploiting functional dependencies in declarative problem specifications | 2009-07-09 | Paper |
| Evaluating ASP and commercial solvers on the CSPLib | 2009-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3624142 | 2009-04-28 | Paper |
| Compiling problem specifications into SAT | 2007-10-23 | Paper |
| Automated reformulation of specifications by safe delay of constraints | 2007-10-23 | Paper |
| Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 2007-04-30 | Paper |
| Combining relational algebra, SQL, constraint modelling, and local search | 2007-03-23 | Paper |
| Logics in Artificial Intelligence | 2006-10-25 | Paper |
| AI*IA 2005: Advances in Artificial Intelligence | 2006-06-27 | Paper |
| Logic for Programming, Artificial Intelligence, and Reasoning | 2005-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737131 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4475663 | 2004-08-09 | Paper |
| Tractable reasoning via approximation | 2003-02-04 | Paper |
| Preprocessing of intractable problems | 2003-01-14 | Paper |
| An algorithm to evaluate quantified Boolean formulae and its experimental evaluation | 2002-08-20 | Paper |
| An algorithm to evaluate quantified Boolean formulae and its experimental evaluation | 2002-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2763686 | 2002-01-21 | Paper |
| NP-SPEC: An executable specification language for solving all problems in NP | 2001-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4506459 | 2000-09-19 | Paper |
| Semantical and computational aspects of Horn approximations | 2000-08-21 | Paper |
| Propositional lower bounds: Algorithms and complexity | 2000-06-07 | Paper |
| The size of a revised knowledge base | 2000-06-04 | Paper |
| Circumscribing DATALOG: expressive power and complexity | 1998-08-13 | Paper |
| Is intractability of nonmonotonic reasoning a real drawback? | 1998-07-23 | Paper |
| On compact representations of propositional circumscription | 1998-07-22 | Paper |
| On the complexity of entailment in propositional multivalued logics | 1998-04-22 | Paper |
| Using abstract resources to control reasoning | 1998-01-01 | Paper |
| Tractable reasoning in artificial intelligence | 1995-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4835906 | 1995-06-08 | Paper |
| The complexity of propositional closed world reasoning and circumscription | 1995-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4298365 | 1994-08-29 | Paper |
| A survey of complexity results for non-monotonic logics | 1994-01-13 | Paper |
| The complexity of model checking for circumscriptive formulae | 1993-04-01 | Paper |
| An efficient method for eliminating varying predicates from a circumscription | 1992-09-27 | Paper |
