Hans Kleine Büning

120 papers A* 1A 16B 17C 5Misc 1Journal 50Unranked 23

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Classes of propositional UMU formulas and their extensions to minimal unsatisfiable formulas. Theor. Comput. Sci. Hans Kleine Büning
2021	—	`ch.`	Minimal Unsatisfiability and Autarkies. Handbook of Satisfiability Hans Kleine Büning, Oliver Kullmann
2021	—	`ch.`	Theory of Quantified Boolean Formulas. Handbook of Satisfiability Hans Kleine Büning, Uwe Bubeck
2020	J	`jnl`	NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability. Math. Struct. Comput. Sci. Hans Kleine Büning, Piotr Wojciechowski, K. Subramani
2019	—	`conf`	New Results on Cutting Plane Proofs for Horn Constraint Systems. FSTTCS Hans Kleine Büning, Piotr Wojciechowski, K. Subramani
2019	Misc	`conf`	Read-Once Resolutions in Horn Formulas. FAW Hans Kleine Büning, Piotr Wojciechowski, K. Subramani
2019	—	`conf`	Restricted Cutting Plane Proofs in Horn Constraint Systems. FroCos Hans Kleine Büning, Piotr Wojciechowski, R. Chandrasekaran, K. Subramani
2018	J	`jnl`	Finding read-once resolution refutations in systems of 2CNF clauses. Theor. Comput. Sci. Hans Kleine Büning, Piotr Wojciechowski, K. Subramani
2017	J	`jnl`	Foreword. Theor. Comput. Sci. Kira V. Adaricheva, Giuseppe F. Italiano, Hans Kleine Büning, György Turán
2017	C	`conf`	On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas. TAMC Hans Kleine Büning, Piotr Wojciechowski, K. Subramani
2017	—	`conf`	The Complexity of Finding Read-Once NAE-Resolution Refutations. ICLA Hans Kleine Büning, Piotr Wojciechowski, K. Subramani
2016	J	`jnl`	On the computational complexity of read once resolution decidability in 2CNF formulas. CoRR Hans Kleine Büning, Piotr Wojciechowski, K. Subramani
2015	—	`conf`	Automated Online Service Composition. SCC Felix Mohr, Alexander Jungmann, Hans Kleine Büning
2015	J	`jnl`	Learning Boolean specifications. Artif. Intell. Uwe Bubeck, Hans Kleine Büning
2014	J	`jnl`	Adaptive function approximation in reinforcement learning with an interpolating growing neural gas. Int. J. Hybrid Intell. Syst. Michael Baumann, Hans Kleine Büning
2014	C	`conf`	Automatic ATM Fraud Detection as a Sequence-based Anomaly Detection Problem. ICPRAM Maik Anderka, Timo Klerx, Steffen Priesterjahn, Hans Kleine Büning
2014	J	`jnl`	Horn formulas, directed hypergraphs, lattices and closure systems: related formalisms and applications (Dagstuhl Seminar 14201). Dagstuhl Reports Kira V. Adaricheva, Giuseppe F. Italiano, Hans Kleine Büning, György Turán
2014	B	`conf`	Model-Based Anomaly Detection for Discrete Event Systems. ICTAI Timo Klerx, Maik Anderka, Hans Kleine Büning, Steffen Priesterjahn
2014	A	`conf`	On the Usage of Behavior Models to Detect ATM Fraud. ECAI Timo Klerx, Maik Anderka, Hans Kleine Büning
2013	A	`conf`	Nested Boolean Functions as Models for Quantified Boolean Formulas. SAT Uwe Bubeck, Hans Kleine Büning
2013	—	`conf`	Reducing Nondeterminism in Automated Service Composition. SOCA Felix Mohr, Theodor Lettmann, Hans Kleine Büning
2013	C	`conf`	Semi-Automated Software Composition Through Generated Components. iiWAS Felix Mohr, Hans Kleine Büning
2012	C	`conf`	Adaptive function approximation in reinforcement learning with an interpolating growing neural gas. HIS Michael Baumann, Hans Kleine Büning
2012	J	`jnl`	Encoding Nested Boolean Functions as Quantified Boolean Formulas. J. Satisf. Boolean Model. Comput. Uwe Bubeck, Hans Kleine Büning
2012	A*	`conf`	Learning Behavior Models for Hybrid Timed Systems. AAAI Oliver Niggemann, Benno Stein, Asmir Vodencarevic, Alexander Maier, Hans Kleine Büning
2011	—	`conf`	A Convergent Multiagent Reinforcement Learning Approach for a Subclass of Cooperative Stochastic Games. ALA Thomas Kemmerich, Hans Kleine Büning
2011	—	`conf`	Convergence Analysis of a Multiagent Cooperation Model. ICAART (2) Markus Eberling, Hans Kleine Büning
2011	—	`conf`	Coordination in Large Multiagent Reinforcement Learning Problems. IAT Thomas Kemmerich, Hans Kleine Büning
2011	C	`conf`	Identifying behavior models for process plants. ETFA Asmir Vodencarevic, Hans Kleine Büning, Oliver Niggemann, Alexander Maier
2011	—	`conf`	On the Power of Global Reward Signals in Reinforcement Learning. MATES Thomas Kemmerich, Hans Kleine Büning
2011	—	`conf`	Region-based Heuristics for an Iterative Partitioning Problem in Multiagent Systems. ICAART (2) Thomas Kemmerich, Hans Kleine Büning
2011	—	`conf`	State Aggregation by Growing Neural Gas for Reinforcement Learning in Continuous State Spaces. ICMLA (1) Michael Baumann, Hans Kleine Büning
2011	A	`conf`	Transformations into Normal Forms for Quantified Circuits. SAT Hans Kleine Büning, Xishun Zhao, Uwe Bubeck
2011	—	`conf`	Using behavior models for anomaly detection in hybrid systems. ICAT Asmir Vodencarevic, Hans Kleine Büning, Oliver Niggemann, Alexander Maier
2010	J	`jnl`	An upper bound for the circuit complexity of existentially quantified Boolean formulas. Theor. Comput. Sci. Hans Kleine Büning, Anja Remshagen
2010	—	`conf`	External Coordination Media in Capacity-Constrained Multiagent Systems. IAT Thomas Kemmerich, Hans Kleine Büning
2010	A	`conf`	Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN. SAT Uwe Bubeck, Hans Kleine Büning
2010	—	`conf`	Self-adaptation Strategies to Favor Cooperation. KES-AMSTA (1) Markus Eberling, Hans Kleine Büning
2010	—	`conf`	The Effects of Local Trust Cooperation in Multiagent Systems. KES-AMSTA (1) Thomas Schmidt, Markus Eberling, Hans Kleine Büning
2009	J	`jnl`	A new 3-CNF transformation by parallel-serial graphs. Inf. Process. Lett. Uwe Bubeck, Hans Kleine Büning
2009	—	`ch.`	Minimal Unsatisfiability and Autarkies. Handbook of Satisfiability Hans Kleine Büning, Oliver Kullmann
2009	A	`conf`	Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits. SAT Hans Kleine Büning, Xishun Zhao, Uwe Bubeck
2009	—	`ch.`	Theory of Quantified Boolean Formulas. Handbook of Satisfiability Hans Kleine Büning, Uwe Bubeck
2008	J	`jnl`	Computational complexity of quantified Boolean formulas with fixed maximal deficiency. Theor. Comput. Sci. Hans Kleine Büning, Xishun Zhao
2008	J	`jnl`	Models and quantifier elimination for quantified Horn formulas. Discret. Appl. Math. Uwe Bubeck, Hans Kleine Büning
2008	A	`ed.`	Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings SAT Hans Kleine Büning, Xishun Zhao
2007	J	`jnl`	An Extension of Deficiency and Minimal Unsatisfiability of Quantified Boolean Formulas. J. Satisf. Boolean Model. Comput. Hans Kleine Büning, Xishun Zhao
2007	J	`jnl`	Boolean Functions as Models for Quantified Boolean Formulas. J. Autom. Reason. Hans Kleine Büning, K. Subramani, Xishun Zhao
2007	A	`conf`	Bounded Universal Expansion for Preprocessing QBF. SAT Uwe Bubeck, Hans Kleine Büning
2007	J	`jnl`	The Complexity of Some Subclasses of Minimal Unsatis able Formulas. J. Satisf. Boolean Model. Comput. Hans Kleine Büning, Xishun Zhao
2007	—	`conf`	Virtual Markets: AIS-ADM Natalia Akchurina, Hans Kleine Büning
2006	A	`conf`	Dependency Quantified Horn Formulas: Models and Complexity. SAT Uwe Bubeck, Hans Kleine Büning
2006	J	`jnl`	Direct Model Checking Matrix Algorithm. J. Comput. Sci. Technol. Zhi-Hong Tao, Hans Kleine Büning, Lifu Wang
2006	A	`conf`	Minimal False Quantified Boolean Formulas. SAT Hans Kleine Büning, Xishun Zhao
2005	A	`conf`	A mutation operator for evolution strategies to handle constrained problems. GECCO Oliver Kramer, Chuan-Kang Ting, Hans Kleine Büning
2005	B	`conf`	A new mutation operator for evolution strategies for constrained problems. Congress on Evolutionary Computation Oliver Kramer, Chuan-Kang Ting, Hans Kleine Büning
2005	J	`jnl`	Extension and equivalence problems for clause minimal formulae. Ann. Math. Artif. Intell. Hans Kleine Büning, Xishun Zhao
2005	A	`conf`	Model-Equivalent Reductions. SAT Xishun Zhao, Hans Kleine Büning
2005	—	`conf`	Multi Target Partitioning of Sets Based on Local Information. WSTST Andreas Goebels, Hans Kleine Büning, Steffen Priesterjahn, Alexander Weimer
2005	A	`conf`	Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas. SAT Uwe Bubeck, Hans Kleine Büning, Xishun Zhao
2005	J	`jnl`	The complexity of homomorphisms and renamings for minimal unsatisfiable formulas. Ann. Math. Artif. Intell. Hans Kleine Büning, Daoyun Xu
2005	—	`conf`	Towards Online Partitioning of Agent Sets based on Local Information. Parallel and Distributed Computing and Networks Andreas Goebels, Hans Kleine Büning, Steffen Priesterjahn, Alexander Weimer
2004	A	`conf`	Equivalence Models for Quantified Boolean Formulas. SAT Hans Kleine Büning, Xishun Zhao
2004	—	`conf`	Equivalence Models for Quantified Boolean Formulas. SAT (Selected Papers Hans Kleine Büning, Xishun Zhao
2004	—	`conf`	On Models for Quantified Boolean Formulas. Logic versus Approximation Hans Kleine Büning, Xishun Zhao
2003	B	`conf`	A mating strategy for multi-parent genetic algorithms by integrating tabu search. IEEE Congress on Evolutionary Computation Chuan-Kang Ting, Hans Kleine Büning
2003	A	`conf`	On Boolean Models for Quantified Boolean Horn Formulas. SAT Hans Kleine Büning, K. Subramani, Xishun Zhao
2003	J	`jnl`	On the structure of some classes of minimal unsatisfiable formulas. Discret. Appl. Math. Hans Kleine Büning, Xishun Zhao
2003	A	`conf`	Read-Once Unit Resolution. SAT Hans Kleine Büning, Xishun Zhao
2002	J	`jnl`	Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency. Inf. Process. Lett. Hans Kleine Büning, Xishun Zhao
2002	J	`jnl`	The Complexity of Read-Once Resolution. Ann. Math. Artif. Intell. Hans Kleine Büning, Xishun Zhao
2001	J	`jnl`	Satisfiable Formulas Closed Under Replacement. Electron. Notes Discret. Math. Hans Kleine Büning, Xishun Zhao
2000	J	`jnl`	Complexity Results for Restricted Credulous Default Reasoning. AI Commun. Xishun Zhao, Decheng Ding, Hans Kleine Büning
2000	J	`jnl`	On subclasses of minimal unsatisfiable formulas. Discret. Appl. Math. Hans Kleine Büning
1999	—	`book`	Propositional logic - deduction and algorithms. Hans Kleine Büning, Theodor Lettmann
1999	J	`jnl`	Resolution Remains Hard Under Equivalence. Discret. Appl. Math. Hans Kleine Büning, Theodor Lettmann
1998	J	`jnl`	An Efficient Algorithm for the Minimal Unsatisfiability Problem for a Subclass of CNF. Ann. Math. Artif. Intell. Gennady Davydov, Inna Davydova, Hans Kleine Büning
1998	B	`conf`	An Upper Bound for Minimal Resolution Refutations. CSL Hans Kleine Büning
1997	J	`jnl`	SAT-Problems and Reductions with Respect to the Number of Variables. J. Log. Comput. Etienne Grandjean, Hans Kleine Büning
1996	B	`ed.`	Computer Science Logic, 9th International Workshop, CSL '95, Annual Conference of the EACSL, Paderborn, Germany, September 22-29, 1995, Selected Papers CSL Hans Kleine Büning
1996	B	`conf`	Learning a Representation for Optimizable Formulas. ALT Hans Kleine Büning, Theodor Lettmann
1996	J	`jnl`	On Resolution with Short Clauses. Ann. Math. Artif. Intell. Michael Buro, Hans Kleine Büning
1995	J	`jnl`	Entwurfsunterstützung in der Hydraulik mit dem System art deco. Künstliche Intell. Hans Kleine Büning, Ralf Lemmen, Michael Suermann, Marcus Hoffmann, Daniel Curatolo, Benno Stein
1995	J	`jnl`	Resolution for Quantified Boolean Formulas Inf. Comput. Hans Kleine Büning, Marek Karpinski, Andreas Flögel
1994	—	`book`	Aussagenlogik - Deduktion und Algorithmen. Hans Kleine Büning, Theodor Lettmann
1993	B	`ed.`	Computer Science Logic, 6th Workshop, CSL '92, San Miniato, Italy, September 28 - October 2, 1992, Selected Papers CSL Egon Börger, Gerhard Jäger, Hans Kleine Büning, Simone Martini, Michael M. Richter
1993	J	`jnl`	On generalized Horn formulas and k-resolution. Theor. Comput. Sci. Hans Kleine Büning
1993	J	`jnl`	On the Restricted Equivalence Subclasses of Propositional Logic. RAIRO Theor. Informatics Appl. Andreas Flögel, Hans Kleine Büning, Theodor Lettmann
1992	B	`ed.`	Computer Science Logic, 5th Workshop, CSL '91, Berne, Switzerland, October 7-11, 1991, Proceedings CSL Egon Börger, Gerhard Jäger, Hans Kleine Büning, Michael M. Richter
1991	B	`ed.`	Computer Science Logic, 4th Workshop, CSL '90, Heidelberg, Germany, October 1-5, 1990, Proceedings CSL Egon Börger, Hans Kleine Büning, Michael M. Richter, Wolfgang Schönfeld
1990	B	`ed.`	CSL '89, 3rd Workshop on Computer Science Logic, Kaiserslautern, Germany, October 2-6, 1989, Proceedings CSL Egon Börger, Hans Kleine Büning, Michael M. Richter
1990	J	`jnl`	Equivalence of Propositional Prolog Programs. J. Autom. Reason. Hans Kleine Büning, Ulrich Löwen, Stefan Schmitgen
1990	J	`jnl`	Existence of Simple Propositional Formulas. Inf. Process. Lett. Hans Kleine Büning
1990	B	`conf`	Subclasses of Quantified Boolean Formulas. CSL Andreas Flögel, Marek Karpinski, Hans Kleine Büning
1989	B	`ed.`	CSL '88, 2nd Workshop on Computer Science Logic, Duisburg, Germany, October 3-7, 1988, Proceedings CSL Egon Börger, Hans Kleine Büning, Michael M. Richter
1989	J	`jnl`	Inconsistency of Production Systems. Data Knowl. Eng. Hans Kleine Büning, Ulrich Löwen, Stefan Schmitgen
1989	J	`jnl`	Optimizing Propositional Calculus Formulas with Regard to Questions of Deducibility Inf. Comput. Hans Kleine Büning, Ulrich Löwen
1989	J	`jnl`	Projections of Vector Addition System Reachability Sets are Semilinear. Theor. Comput. Sci. Hans Kleine Büning, Theodor Lettmann, Ernst W. Mayr
1988	B	`ed.`	CSL '87, 1st Workshop on Computer Science Logic, Karlsruhe, Germany, October 12-16, 1987, Proceedings CSL Egon Börger, Hans Kleine Büning, Michael M. Richter
1988	J	`jnl`	First-Order Formulas in Conjunctive Quantificational Form. Math. Log. Q. Hans Kleine Büning, Theodor Lettmann
1988	B	`conf`	Loop Detection in Propositional Prolog Programs. CSL Hans Kleine Büning, Ulrich Löwen, Stefan Schmitgen
1988	J	`jnl`	Optimization Aspects for Propositional Binary Prolog Programs. J. Inf. Process. Cybern. Hans Kleine Büning, Ulrich Löwen
1988	—	`book`	Prolog - Grundlagen und Anwendungen, 2. Auflage. Hans Kleine Büning, Stefan Schmitgen
1987	B	`conf`	On the Computational Complexity of Quantified Horn Clauses. CSL Marek Karpinski, Hans Kleine Büning, Peter H. Schmitt
1987	—	`conf`	Perspektiven für die Logikprogrammierung. Wissensrepräsentation in Expertensystemen Hans Kleine Büning, Theodor Lettmann
1987	—	`conf`	Representation Independent Query and Update Operations on Propositional Definite Horn Formulas. Computation Theory and Logic Hans Kleine Büning, Theodor Lettmann
1986	A	`conf`	Classes of First Order Formulas Under Various Satisfiability Definitions. CADE Hans Kleine Büning, Theodor Lettmann
1983	J	`jnl`	A classification of an iterative hierarchy. Arch. Math. Log. Hans Kleine Büning
1983	—	`conf`	Complexity of loop-problems in normed networks. Logic and Machines Hans Kleine Büning
1983	J	`jnl`	Durch syntaktische Rekursion definierte Klassen. Math. Log. Q. Hans Kleine Büning
1983	J	`jnl`	The early bird problem is unsolvable in a one-dimensional cellular space with 4 states. Acta Cybern. Hans Kleine Büning
1982	J	`jnl`	Note on the Math. Log. Q. Hans Kleine Büning
1981	B	`conf`	Classes of Functions over Binary Trees. FCT Hans Kleine Büning
1981	J	`jnl`	Some undecidable theories with monadic predicates and without equality. Arch. Math. Log. Hans Kleine Büning
1980	J	`jnl`	Decision problems in generalized vector addition systems. Fundam. Informaticae Hans Kleine Büning
1980	J	`jnl`	The R. E. Complexity of Decision Problems for Commutative Semi-Thue Systems With Recursive Rule Set. Math. Log. Q. Egon Börger, Hans Kleine Büning
1980	J	`jnl`	The Reachability Problem for Petri Nets and Decision Problems for Skolem Arithmetic. Theor. Comput. Sci. Egon Börger, Hans Kleine Büning
1980	J	`jnl`	Universal Asynchronous Iterative Arrays of Mealy Automata. Acta Informatica Hans Kleine Büning, Lutz Priese
1979	B	`conf`	Generalized vector addition systems with finite exception sets. FCT Hans Kleine Büning
1977	J	`jnl`	Kleine universelle mehrdimensionale Turingmaschinen. J. Inf. Process. Cybern. Hans Kleine Büning, Thomas Ottmann