| Publication | Date of Publication | Type |
|---|
| Witnesses for Answer Sets of Logic Programs | 2023-04-05 | Paper |
| Characterizing causal action theories and their implementations in answer set programming | 2017-09-29 | Paper |
| A Model for Phase Transition of Random Answer-Set Programs | 2017-07-12 | Paper |
| Recycling computed answers in rewrite systems for abduction | 2017-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5740448 | 2016-07-26 | Paper |
| A formalization of programs in first-order logic with a discrete linear order | 2016-04-22 | Paper |
| Computing Loops with at Most One External Support Rule | 2015-09-17 | Paper |
| Position systems in dynamic domains | 2015-04-23 | Paper |
| Turner’s Logic of Universal Causation, Propositional Logic, and Logic Programming | 2013-10-10 | Paper |
| Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs | 2012-11-13 | Paper |
| From Turner’s Logic of Universal Causation to the Logic of GK | 2012-07-23 | Paper |
| Discovering theorems in game theory: two-person games with unique pure Nash equilibrium payoffs | 2012-05-23 | Paper |
| Ordered completion for first-order logic programs on finite structures | 2012-05-23 | Paper |
| Weight constraint programs with evaluable functions | 2011-11-08 | Paper |
| Two equivalence results for two-person strict games | 2011-03-28 | Paper |
| Designing competitions between teams of individuals | 2010-09-02 | Paper |
| Computer-aided proofs of Arrow's and other impossibility theorems | 2009-09-14 | Paper |
| Logic Programming | 2009-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3624060 | 2009-04-28 | Paper |
| Loop formulas for circumscription | 2007-10-23 | Paper |
| A characterization of answer sets for logic programs | 2007-08-31 | Paper |
| Logic Programming and Nonmonotonic Reasoning | 2006-06-23 | Paper |
| ASSAT: computing answer sets of a logic program by SAT solvers | 2006-02-07 | Paper |
| How to progress a database | 2003-08-28 | Paper |
| Abduction in logic programming: A new definition and an abductive procedure based on rewriting | 2002-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535119 | 2002-07-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2767052 | 2002-01-28 | Paper |
| On strongest necessary and weakest sufficient conditions | 2001-08-20 | Paper |
| Ability and knowing how in the situation calculus | 2001-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934652 | 2000-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955333 | 2000-05-25 | Paper |
| What robots can do: robot programs and effective achievability | 1999-01-12 | Paper |
| Applications of the situation calculus to formalizing control and strategic information: the Prolog cut operator | 1999-01-12 | Paper |
| An ordering on subgoals for planning | 1998-06-11 | Paper |
| Rules as actions: A situation calculus semantics for logic programs | 1998-02-04 | Paper |
| Provably correct theories of action | 1998-02-02 | Paper |
| GOLOG: A logic programming language for dynamic domains | 1997-10-23 | Paper |
| A logic of knowledge and justified assumption | 1993-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3493310 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3484810 | 1988-01-01 | Paper |
