| 2019 | FAW | Read-Once Resolutions in Horn Formulas. | Hans Kleine Bning, Piotr Wojciechowski, K. Subramani |
| 2017 | TAMC | On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas. | Hans Kleine Bning, Piotr Wojciechowski, K. Subramani |
| 2014 | ECAI | On the Usage of Behavior Models to Detect ATM Fraud. | Timo Klerx, Maik Anderka, Hans Kleine Bning |
| 2014 | ICPRAM | Automatic ATM Fraud Detection as a Sequence-based Anomaly Detection Problem. | Maik Anderka, Timo Klerx, Steffen Priesterjahn, Hans Kleine Bning |
| 2014 | ICTAI | Model-Based Anomaly Detection for Discrete Event Systems. | Timo Klerx, Maik Anderka, Hans Kleine Bning, Steffen Priesterjahn |
| 2013 | IIWAS | Semi-Automated Software Composition Through Generated Components. | Felix Mohr, Hans Kleine Bning |
| 2013 | SAT | Nested Boolean Functions as Models for Quantified Boolean Formulas. | Uwe Bubeck, Hans Kleine Bning |
| 2012 | AAAI | Learning Behavior Models for Hybrid Timed Systems. | Oliver Niggemann, Benno Stein, Asmir Vodencarevic, Alexander Maier, Hans Kleine Bning |
| 2012 | HIS | Adaptive function approximation in reinforcement learning with an interpolating growing neural gas. | Michael Baumann, Hans Kleine Bning |
| 2011 | ETFA | Identifying behavior models for process plants. | Asmir Vodencarevic, Hans Kleine Bning, Oliver Niggemann, Alexander Maier |
| 2011 | ICAART | Convergence Analysis of a Multiagent Cooperation Model. | Markus Eberling, Hans Kleine Bning |
| 2011 | ICAART | Region-based Heuristics for an Iterative Partitioning Problem in Multiagent Systems. | Thomas Kemmerich, Hans Kleine Bning |
| 2011 | ICMLA | State Aggregation by Growing Neural Gas for Reinforcement Learning in Continuous State Spaces. | Michael Baumann, Hans Kleine Bning |
| 2011 | SAT | Transformations into Normal Forms for Quantified Circuits. | Hans Kleine Bning, Xishun Zhao, Uwe Bubeck |
| 2010 | SAT | Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN. | Uwe Bubeck, Hans Kleine Bning |
| 2009 | SAT | Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits. | Hans Kleine Bning, Xishun Zhao, Uwe Bubeck |
| 2007 | SAT | Bounded Universal Expansion for Preprocessing QBF. | Uwe Bubeck, Hans Kleine Bning |
| 2006 | SAT | Dependency Quantified Horn Formulas: Models and Complexity. | Uwe Bubeck, Hans Kleine Bning |
| 2006 | SAT | Minimal False Quantified Boolean Formulas. | Hans Kleine Bning, Xishun Zhao |
| 2005 | CEC | A new mutation operator for evolution strategies for constrained problems. | Oliver Kramer, Chuan-Kang Ting, Hans Kleine Bning |
| 2005 | GECCO | A mutation operator for evolution strategies to handle constrained problems. | Oliver Kramer, Chuan-Kang Ting, Hans Kleine Bning |
| 2005 | SAT | Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas. | Uwe Bubeck, Hans Kleine Bning, Xishun Zhao |
| 2005 | SAT | Model-Equivalent Reductions. | Xishun Zhao, Hans Kleine Bning |
| 2004 | SAT | Equivalence Models for Quantified Boolean Formulas. | Hans Kleine Bning, Xishun Zhao |
| 2004 | SAT | Equivalence Models for Quantified Boolean Formulas. | Hans Kleine Bning, Xishun Zhao |
| 2003 | CEC | A mating strategy for multi-parent genetic algorithms by integrating tabu search. | Chuan-Kang Ting, Hans Kleine Bning |
| 2003 | SAT | On Boolean Models for Quantified Boolean Horn Formulas. | Hans Kleine Bning, K. Subramani, Xishun Zhao |
| 2003 | SAT | Read-Once Unit Resolution. | Hans Kleine Bning, Xishun Zhao |
| 1998 | CSL | An Upper Bound for Minimal Resolution Refutations. | Hans Kleine Bning |
| 1996 | ALT | Learning a Representation for Optimizable Formulas. | Hans Kleine Bning, Theodor Lettmann |
| 1990 | CSL | Subclasses of Quantified Boolean Formulas. | Andreas Flgel, Marek Karpinski, Hans Kleine Bning |
| 1988 | CSL | Loop Detection in Propositional Prolog Programs. | Hans Kleine Bning, Ulrich Lwen, Stefan Schmitgen |
| 1987 | CSL | On the Computational Complexity of Quantified Horn Clauses. | Marek Karpinski, Hans Kleine Bning, Peter H. Schmitt |
| 1986 | CADE | Classes of First Order Formulas Under Various Satisfiability Definitions. | Hans Kleine Bning, Theodor Lettmann |
| 1981 | FCT | Classes of Functions over Binary Trees. | Hans Kleine Bning |
| 1979 | FCT | Generalized vector addition systems with finite exception sets. | Hans Kleine Bning |