Kleine universelle mehrdimensionale Turingmaschinen. - Hans Kleine Büning; Thomas Ottmann (J. Inf. Process. Cybern., 1977)

Generalized vector addition systems with finite exception sets. - Hans Kleine Büning (FCT, 1979)

Universal Asynchronous Iterative Arrays of Mealy Automata. - Hans Kleine Büning; Lutz Priese (Acta Informatica, 1980)

Decision problems in generalized vector addition systems. - Hans Kleine Büning (Fundam. Informaticae, 1980)

The R. E. Complexity of Decision Problems for Commutative Semi-Thue Systems With Recursive Rule Set. - Egon Börger; Hans Kleine Büning (Math. Log. Q., 1980)

The Reachability Problem for Petri Nets and Decision Problems for Skolem Arithmetic. - Egon Börger; Hans Kleine Büning (Theor. Comput. Sci., 1980)

Classes of Functions over Binary Trees. - Hans Kleine Büning (FCT, 1981)

Some undecidable theories with monadic predicates and without equality. - Hans Kleine Büning (Arch. Math. Log., 1981)

Note on the E. - Hans Kleine Büning (Math. Log. Q., 1982)

Complexity of loop-problems in normed networks. - Hans Kleine Büning (Logic and Machines, 1983)

The early bird problem is unsolvable in a one-dimensional cellular space with 4 states. - Hans Kleine Büning (Acta Cybern., 1983)

A classification of an iterative hierarchy. - Hans Kleine Büning (Arch. Math. Log., 1983)

Durch syntaktische Rekursion definierte Klassen. - Hans Kleine Büning (Math. Log. Q., 1983)

Classes of First Order Formulas Under Various Satisfiability Definitions. - Hans Kleine Büning; Theodor Lettmann (CADE, 1986)

Representation Independent Query and Update Operations on Propositional Definite Horn Formulas. - Hans Kleine Büning; Theodor Lettmann (Computation Theory and Logic, 1987)

On the Computational Complexity of Quantified Horn Clauses. - Marek Karpinski; Hans Kleine Büning; Peter H. Schmitt (CSL, 1987)

Perspektiven für die Logikprogrammierung. - Hans Kleine Büning; Theodor Lettmann (Wissensrepräsentation in Expertensystemen, 1987)

Prolog - Grundlagen und Anwendungen, 2. Auflage. - Hans Kleine Büning; Stefan Schmitgen (Teubner, 1988)

Loop Detection in Propositional Prolog Programs. - Hans Kleine Büning; Ulrich Löwen; Stefan Schmitgen (CSL, 1988)

Optimization Aspects for Propositional Binary Prolog Programs. - Hans Kleine Büning; Ulrich Löwen (J. Inf. Process. Cybern., 1988)

First-Order Formulas in Conjunctive Quantificational Form. - Hans Kleine Büning; Theodor Lettmann (Math. Log. Q., 1988)

Inconsistency of Production Systems. - Hans Kleine Büning; Ulrich Löwen; Stefan Schmitgen (Data Knowl. Eng., 1989)

Projections of Vector Addition System Reachability Sets are Semilinear. - Hans Kleine Büning; Theodor Lettmann; Ernst W. Mayr (Theor. Comput. Sci., 1989)

Optimizing Propositional Calculus Formulas with Regard to Questions of Deducibility - Hans Kleine Büning; Ulrich Löwen (Inf. Comput., 1989)

Subclasses of Quantified Boolean Formulas. - Andreas Flögel; Marek Karpinski; Hans Kleine Büning (CSL, 1990)

Existence of Simple Propositional Formulas. - Hans Kleine Büning (Inf. Process. Lett., 1990)

Equivalence of Propositional Prolog Programs. - Hans Kleine Büning; Ulrich Löwen; Stefan Schmitgen (J. Autom. Reason., 1990)

On the Restricted Equivalence Subclasses of Propositional Logic. - Andreas Flögel; Hans Kleine Büning; Theodor Lettmann (RAIRO Theor. Informatics Appl., 1993)

On generalized Horn formulas and k-resolution. - Hans Kleine Büning (Theor. Comput. Sci., 1993)

Aussagenlogik - Deduktion und Algorithmen. - Hans Kleine Büning; Theodor Lettmann (Teubner, 1994)

Entwurfsunterstützung in der Hydraulik mit dem System art deco. - Hans Kleine Büning; Ralf Lemmen; Michael Suermann; Marcus Hoffmann; Daniel Curatolo; Benno Stein 001 (Künstliche Intell., 1995)

Resolution for Quantified Boolean Formulas - Hans Kleine Büning; Marek Karpinski; Andreas Flögel (Inf. Comput., 1995)

Learning a Representation for Optimizable Formulas. - Hans Kleine Büning; Theodor Lettmann (ALT, 1996)

On Resolution with Short Clauses. - Michael Buro; Hans Kleine Büning (Ann. Math. Artif. Intell., 1996)

SAT-Problems and Reductions with Respect to the Number of Variables. - Etienne Grandjean; Hans Kleine Büning (J. Log. Comput., 1997)

An Upper Bound for Minimal Resolution Refutations. - Hans Kleine Büning (CSL, 1998)

An Efficient Algorithm for the Minimal Unsatisfiability Problem for a Subclass of CNF. - Gennady Davydov; Inna Davydova; Hans Kleine Büning (Ann. Math. Artif. Intell., 1998)

Propositional logic - deduction and algorithms. - Hans Kleine Büning; Theodor Lettmann (Cambridge University Press, 1999)

Resolution Remains Hard Under Equivalence. - Hans Kleine Büning; Theodor Lettmann (Discret. Appl. Math., 1999)

Complexity Results for Restricted Credulous Default Reasoning. - Xishun Zhao; Decheng Ding; Hans Kleine Büning (AI Commun., 2000)

On subclasses of minimal unsatisfiable formulas. - Hans Kleine Büning (Discret. Appl. Math., 2000)

Satisfiable Formulas Closed Under Replacement. - Hans Kleine Büning; Xishun Zhao (Electron. Notes Discret. Math., 2001)

The Complexity of Read-Once Resolution. - Hans Kleine Büning; Xishun Zhao (Ann. Math. Artif. Intell., 2002)

Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency. - Hans Kleine Büning; Xishun Zhao (Inf. Process. Lett., 2002)

A mating strategy for multi-parent genetic algorithms by integrating tabu search. - Chuan-Kang Ting; Hans Kleine Büning (IEEE Congress on Evolutionary Computation, 2003)

On Boolean Models for Quantified Boolean Horn Formulas. - Hans Kleine Büning; K. Subramani 001; Xishun Zhao (SAT, 2003)

Read-Once Unit Resolution. - Hans Kleine Büning; Xishun Zhao (SAT, 2003)

On the structure of some classes of minimal unsatisfiable formulas. - Hans Kleine Büning; Xishun Zhao (Discret. Appl. Math., 2003)

On Models for Quantified Boolean Formulas. - Hans Kleine Büning; Xishun Zhao (Logic versus Approximation, 2004)

Equivalence Models for Quantified Boolean Formulas. - Hans Kleine Büning; Xishun Zhao (SAT, 2004)

A new mutation operator for evolution strategies for constrained problems. - Oliver Kramer 001; Chuan-Kang Ting; Hans Kleine Büning (Congress on Evolutionary Computation, 2005)

A mutation operator for evolution strategies to handle constrained problems. - Oliver Kramer 001; Chuan-Kang Ting; Hans Kleine Büning (GECCO, 2005)

Towards Online Partitioning of Agent Sets based on Local Information. - Andreas Goebels; Hans Kleine Büning; Steffen Priesterjahn; Alexander Weimer (Parallel and Distributed Computing and Networks, 2005)

Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas. - Uwe Bubeck; Hans Kleine Büning; Xishun Zhao (SAT, 2005)

Model-Equivalent Reductions. - Xishun Zhao; Hans Kleine Büning (SAT, 2005)

Multi Target Partitioning of Sets Based on Local Information. - Andreas Goebels; Hans Kleine Büning; Steffen Priesterjahn; Alexander Weimer (WSTST, 2005)

The complexity of homomorphisms and renamings for minimal unsatisfiable formulas. - Hans Kleine Büning; Daoyun Xu (Ann. Math. Artif. Intell., 2005)

Extension and equivalence problems for clause minimal formulae. - Hans Kleine Büning; Xishun Zhao (Ann. Math. Artif. Intell., 2005)

Dependency Quantified Horn Formulas: Models and Complexity. - Uwe Bubeck; Hans Kleine Büning (SAT, 2006)

Minimal False Quantified Boolean Formulas. - Hans Kleine Büning; Xishun Zhao (SAT, 2006)

Direct Model Checking Matrix Algorithm. - Zhi-Hong Tao; Hans Kleine Büning; Lifu Wang (J. Comput. Sci. Technol., 2006)

Virtual Markets: Q -Learning Sellers with Simple State Representation. - Natalia Akchurina; Hans Kleine Büning (AIS-ADM, 2007)

Bounded Universal Expansion for Preprocessing QBF. - Uwe Bubeck; Hans Kleine Büning (SAT, 2007)

Boolean Functions as Models for Quantified Boolean Formulas. - Hans Kleine Büning; K. Subramani 001; Xishun Zhao (J. Autom. Reason., 2007)

The Complexity of Some Subclasses of Minimal Unsatis able Formulas. - Hans Kleine Büning; Xishun Zhao (J. Satisf. Boolean Model. Comput., 2007)

An Extension of Deficiency and Minimal Unsatisfiability of Quantified Boolean Formulas. - Hans Kleine Büning; Xishun Zhao (J. Satisf. Boolean Model. Comput., 2007)

Models and quantifier elimination for quantified Horn formulas. - Uwe Bubeck; Hans Kleine Büning (Discret. Appl. Math., 2008)

Computational complexity of quantified Boolean formulas with fixed maximal deficiency. - Hans Kleine Büning; Xishun Zhao (Theor. Comput. Sci., 2008)

Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits. - Hans Kleine Büning; Xishun Zhao; Uwe Bubeck (SAT, 2009)

A new 3-CNF transformation by parallel-serial graphs. - Uwe Bubeck; Hans Kleine Büning (Inf. Process. Lett., 2009)

Theory of Quantified Boolean Formulas. - Hans Kleine Büning; Uwe Bubeck (Handbook of Satisfiability, 2009)

Minimal Unsatisfiability and Autarkies. - Hans Kleine Büning; Oliver Kullmann (Handbook of Satisfiability, 2009)

External Coordination Media in Capacity-Constrained Multiagent Systems. - Thomas Kemmerich; Hans Kleine Büning (IAT, 2010)

Self-adaptation Strategies to Favor Cooperation. - Markus Eberling; Hans Kleine Büning (KES-AMSTA (1), 2010)

The Effects of Local Trust Cooperation in Multiagent Systems. - Thomas Schmidt 004; Markus Eberling; Hans Kleine Büning (KES-AMSTA (1), 2010)

Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN. - Uwe Bubeck; Hans Kleine Büning (SAT, 2010)

An upper bound for the circuit complexity of existentially quantified Boolean formulas. - Hans Kleine Büning; Anja Remshagen (Theor. Comput. Sci., 2010)

A Convergent Multiagent Reinforcement Learning Approach for a Subclass of Cooperative Stochastic Games. - Thomas Kemmerich; Hans Kleine Büning (ALA, 2011)

Identifying behavior models for process plants. - Asmir Vodencarevic; Hans Kleine Büning; Oliver Niggemann; Alexander Maier (ETFA, 2011)

Coordination in Large Multiagent Reinforcement Learning Problems. - Thomas Kemmerich; Hans Kleine Büning (IAT, 2011)

Convergence Analysis of a Multiagent Cooperation Model. - Markus Eberling; Hans Kleine Büning (ICAART (2), 2011)

Region-based Heuristics for an Iterative Partitioning Problem in Multiagent Systems. - Thomas Kemmerich; Hans Kleine Büning (ICAART (2), 2011)

Using behavior models for anomaly detection in hybrid systems. - Asmir Vodencarevic; Hans Kleine Büning; Oliver Niggemann; Alexander Maier (ICAT, 2011)

State Aggregation by Growing Neural Gas for Reinforcement Learning in Continuous State Spaces. - Michael Baumann 002; Hans Kleine Büning (ICMLA (1), 2011)

On the Power of Global Reward Signals in Reinforcement Learning. - Thomas Kemmerich; Hans Kleine Büning (MATES, 2011)

Transformations into Normal Forms for Quantified Circuits. - Hans Kleine Büning; Xishun Zhao; Uwe Bubeck (SAT, 2011)

Learning Behavior Models for Hybrid Timed Systems. - Oliver Niggemann; Benno Stein 001; Asmir Vodencarevic; Alexander Maier; Hans Kleine Büning (AAAI, 2012)

Encoding Nested Boolean Functions as Quantified Boolean Formulas. - Uwe Bubeck; Hans Kleine Büning (J. Satisf. Boolean Model. Comput., 2012)

Semi-Automated Software Composition Through Generated Components. - Felix Mohr; Hans Kleine Büning (iiWAS, 2013)

Nested Boolean Functions as Models for Quantified Boolean Formulas. - Uwe Bubeck; Hans Kleine Büning (SAT, 2013)

Reducing Nondeterminism in Automated Service Composition. - Felix Mohr; Theodor Lettmann; Hans Kleine Büning (SOCA, 2013)

On the Usage of Behavior Models to Detect ATM Fraud. - Timo Klerx; Maik Anderka; Hans Kleine Büning (ECAI, 2014)

Automatic ATM Fraud Detection as a Sequence-based Anomaly Detection Problem. - Maik Anderka; Timo Klerx; Steffen Priesterjahn; Hans Kleine Büning (ICPRAM, 2014)

Model-Based Anomaly Detection for Discrete Event Systems. - Timo Klerx; Maik Anderka; Hans Kleine Büning; Steffen Priesterjahn (ICTAI, 2014)

Horn formulas, directed hypergraphs, lattices and closure systems: related formalisms and applications (Dagstuhl Seminar 14201). - Kira V. Adaricheva; Giuseppe F. Italiano; Hans Kleine Büning; György Turán (Dagstuhl Reports, 2014)

Adaptive function approximation in reinforcement learning with an interpolating growing neural gas. - Michael Baumann 002; Hans Kleine Büning (Int. J. Hybrid Intell. Syst., 2014)

Automated Online Service Composition. - Felix Mohr; Alexander Jungmann; Hans Kleine Büning (SCC, 2015)

Learning Boolean specifications. - Uwe Bubeck; Hans Kleine Büning (Artif. Intell., 2015)

The Complexity of Finding Read-Once NAE-Resolution Refutations. - Hans Kleine Büning; Piotr Wojciechowski 002; K. Subramani 001 (ICLA, 2017)

On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas. - Hans Kleine Büning; Piotr Wojciechowski 002; K. Subramani 001 (TAMC, 2017)

Foreword. - Kira V. Adaricheva; Giuseppe F. Italiano; Hans Kleine Büning; György Turán (Theor. Comput. Sci., 2017)

Finding read-once resolution refutations in systems of 2CNF clauses. - Hans Kleine Büning; Piotr Wojciechowski 002; K. Subramani 001 (Theor. Comput. Sci., 2018)

Read-Once Resolutions in Horn Formulas. - Hans Kleine Büning; Piotr Wojciechowski 002; K. Subramani 001 (FAW, 2019)

Restricted Cutting Plane Proofs in Horn Constraint Systems. - Hans Kleine Büning; Piotr Wojciechowski 002; R. Chandrasekaran; K. Subramani 001 (FroCos, 2019)

New Results on Cutting Plane Proofs for Horn Constraint Systems. - Hans Kleine Büning; Piotr Wojciechowski 002; K. Subramani 001 (FSTTCS, 2019)

NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability. - Hans Kleine Büning; Piotr Wojciechowski 002; K. Subramani 001 (Math. Struct. Comput. Sci., 2020)

Theory of Quantified Boolean Formulas. - Hans Kleine Büning; Uwe Bubeck (Handbook of Satisfiability, 2021)

Minimal Unsatisfiability and Autarkies. - Hans Kleine Büning; Oliver Kullmann (Handbook of Satisfiability, 2021)

Classes of propositional UMU formulas and their extensions to minimal unsatisfiable formulas. - Hans Kleine Büning (Theor. Comput. Sci., 2024)