default search action
Hans Kleine Büning
Person information
- affiliation: University of Paderborn, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j48]Hans Kleine Büning:
Classes of propositional UMU formulas and their extensions to minimal unsatisfiable formulas. Theor. Comput. Sci. 998: 114538 (2024) - 2021
- [p4]Hans Kleine Büning, Oliver Kullmann:
Minimal Unsatisfiability and Autarkies. Handbook of Satisfiability 2021: 571-633 - [p3]Hans Kleine Büning, Uwe Bubeck:
Theory of Quantified Boolean Formulas. Handbook of Satisfiability 2021: 1131-1156 - 2020
- [j47]Hans Kleine Büning, Piotr Wojciechowski, K. Subramani:
NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability. Math. Struct. Comput. Sci. 30(7): 736-751 (2020)
2010 – 2019
- 2019
- [c55]Hans Kleine Büning, Piotr Wojciechowski, K. Subramani:
Read-Once Resolutions in Horn Formulas. FAW 2019: 100-110 - [c54]Hans Kleine Büning, Piotr Wojciechowski, R. Chandrasekaran, K. Subramani:
Restricted Cutting Plane Proofs in Horn Constraint Systems. FroCos 2019: 149-164 - [c53]Hans Kleine Büning, Piotr Wojciechowski, K. Subramani:
New Results on Cutting Plane Proofs for Horn Constraint Systems. FSTTCS 2019: 43:1-43:14 - 2018
- [j46]Hans Kleine Büning, Piotr Wojciechowski, K. Subramani:
Finding read-once resolution refutations in systems of 2CNF clauses. Theor. Comput. Sci. 729: 42-56 (2018) - 2017
- [j45]Kira V. Adaricheva, Giuseppe F. Italiano, Hans Kleine Büning, György Turán:
Foreword. Theor. Comput. Sci. 658: 263 (2017) - [c52]Hans Kleine Büning, Piotr Wojciechowski, K. Subramani:
The Complexity of Finding Read-Once NAE-Resolution Refutations. ICLA 2017: 64-76 - [c51]Hans Kleine Büning, Piotr Wojciechowski, K. Subramani:
On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas. TAMC 2017: 362-372 - 2016
- [i2]Hans Kleine Büning, Piotr Wojciechowski, K. Subramani:
On the computational complexity of read once resolution decidability in 2CNF formulas. CoRR abs/1610.04523 (2016) - 2015
- [j44]Uwe Bubeck, Hans Kleine Büning:
Learning Boolean specifications. Artif. Intell. 229: 246-257 (2015) - [c50]Felix Mohr, Alexander Jungmann, Hans Kleine Büning:
Automated Online Service Composition. SCC 2015: 57-64 - 2014
- [j43]Michael Baumann, Hans Kleine Büning:
Adaptive function approximation in reinforcement learning with an interpolating growing neural gas. Int. J. Hybrid Intell. Syst. 11(1): 55-69 (2014) - [c49]Timo Klerx, Maik Anderka, Hans Kleine Büning:
On the Usage of Behavior Models to Detect ATM Fraud. ECAI 2014: 1045-1046 - [c48]Maik Anderka, Timo Klerx, Steffen Priesterjahn, Hans Kleine Büning:
Automatic ATM Fraud Detection as a Sequence-based Anomaly Detection Problem. ICPRAM 2014: 759-764 - [c47]Timo Klerx, Maik Anderka, Hans Kleine Büning, Steffen Priesterjahn:
Model-Based Anomaly Detection for Discrete Event Systems. ICTAI 2014: 665-672 - [i1]Kira V. Adaricheva, Giuseppe F. Italiano, Hans Kleine Büning, György Turán:
Horn formulas, directed hypergraphs, lattices and closure systems: related formalisms and applications (Dagstuhl Seminar 14201). Dagstuhl Reports 4(5): 1-26 (2014) - 2013
- [c46]Felix Mohr, Hans Kleine Büning:
Semi-Automated Software Composition Through Generated Components. iiWAS 2013: 676 - [c45]Uwe Bubeck, Hans Kleine Büning:
Nested Boolean Functions as Models for Quantified Boolean Formulas. SAT 2013: 267-275 - [c44]Felix Mohr, Theodor Lettmann, Hans Kleine Büning:
Reducing Nondeterminism in Automated Service Composition. SOCA 2013: 154-161 - 2012
- [j42]Uwe Bubeck, Hans Kleine Büning:
Encoding Nested Boolean Functions as Quantified Boolean Formulas. J. Satisf. Boolean Model. Comput. 8(1/2): 101-116 (2012) - [c43]Oliver Niggemann, Benno Stein, Asmir Vodencarevic, Alexander Maier, Hans Kleine Büning:
Learning Behavior Models for Hybrid Timed Systems. AAAI 2012: 1083-1090 - [c42]Michael Baumann, Hans Kleine Büning:
Adaptive function approximation in reinforcement learning with an interpolating growing neural gas. HIS 2012: 512-517 - 2011
- [c41]Thomas Kemmerich, Hans Kleine Büning:
A Convergent Multiagent Reinforcement Learning Approach for a Subclass of Cooperative Stochastic Games. ALA 2011: 37-53 - [c40]Asmir Vodencarevic, Hans Kleine Büning, Oliver Niggemann, Alexander Maier:
Identifying behavior models for process plants. ETFA 2011: 1-8 - [c39]Thomas Kemmerich, Hans Kleine Büning:
Coordination in Large Multiagent Reinforcement Learning Problems. IAT 2011: 236-239 - [c38]Markus Eberling, Hans Kleine Büning:
Convergence Analysis of a Multiagent Cooperation Model. ICAART (2) 2011: 167-172 - [c37]Thomas Kemmerich, Hans Kleine Büning:
Region-based Heuristics for an Iterative Partitioning Problem in Multiagent Systems. ICAART (2) 2011: 200-205 - [c36]Asmir Vodencarevic, Hans Kleine Büning, Oliver Niggemann, Alexander Maier:
Using behavior models for anomaly detection in hybrid systems. ICAT 2011: 1-8 - [c35]Michael Baumann, Hans Kleine Büning:
State Aggregation by Growing Neural Gas for Reinforcement Learning in Continuous State Spaces. ICMLA (1) 2011: 430-435 - [c34]Thomas Kemmerich, Hans Kleine Büning:
On the Power of Global Reward Signals in Reinforcement Learning. MATES 2011: 53-64 - [c33]Hans Kleine Büning, Xishun Zhao, Uwe Bubeck:
Transformations into Normal Forms for Quantified Circuits. SAT 2011: 245-258 - 2010
- [j41]Hans Kleine Büning, Anja Remshagen:
An upper bound for the circuit complexity of existentially quantified Boolean formulas. Theor. Comput. Sci. 411(31-33): 2864-2870 (2010) - [c32]Thomas Kemmerich, Hans Kleine Büning:
External Coordination Media in Capacity-Constrained Multiagent Systems. IAT 2010: 109-116 - [c31]Markus Eberling, Hans Kleine Büning:
Self-adaptation Strategies to Favor Cooperation. KES-AMSTA (1) 2010: 223-232 - [c30]Thomas Schmidt, Markus Eberling, Hans Kleine Büning:
The Effects of Local Trust Cooperation in Multiagent Systems. KES-AMSTA (1) 2010: 233-242 - [c29]Uwe Bubeck, Hans Kleine Büning:
Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN. SAT 2010: 58-70
2000 – 2009
- 2009
- [j40]Uwe Bubeck, Hans Kleine Büning:
A new 3-CNF transformation by parallel-serial graphs. Inf. Process. Lett. 109(7): 376-379 (2009) - [c28]Hans Kleine Büning, Xishun Zhao, Uwe Bubeck:
Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits. SAT 2009: 391-397 - [p2]Hans Kleine Büning, Oliver Kullmann:
Minimal Unsatisfiability and Autarkies. Handbook of Satisfiability 2009: 339-401 - [p1]Hans Kleine Büning, Uwe Bubeck:
Theory of Quantified Boolean Formulas. Handbook of Satisfiability 2009: 735-760 - 2008
- [j39]Uwe Bubeck, Hans Kleine Büning:
Models and quantifier elimination for quantified Horn formulas. Discret. Appl. Math. 156(10): 1606-1622 (2008) - [j38]Hans Kleine Büning, Xishun Zhao:
Computational complexity of quantified Boolean formulas with fixed maximal deficiency. Theor. Comput. Sci. 407(1-3): 448-457 (2008) - [e8]Hans Kleine Büning, Xishun Zhao:
Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings. Lecture Notes in Computer Science 4996, Springer 2008, ISBN 978-3-540-79718-0 [contents] - 2007
- [j37]Hans Kleine Büning, K. Subramani, Xishun Zhao:
Boolean Functions as Models for Quantified Boolean Formulas. J. Autom. Reason. 39(1): 49-75 (2007) - [j36]Hans Kleine Büning, Xishun Zhao:
The Complexity of Some Subclasses of Minimal Unsatis able Formulas. J. Satisf. Boolean Model. Comput. 3(1-2): 1-17 (2007) - [j35]Hans Kleine Büning, Xishun Zhao:
An Extension of Deficiency and Minimal Unsatisfiability of Quantified Boolean Formulas. J. Satisf. Boolean Model. Comput. 3(3-4): 115-123 (2007) - [c27]Natalia Akchurina, Hans Kleine Büning:
Virtual Markets: Q -Learning Sellers with Simple State Representation. AIS-ADM 2007: 192-205 - [c26]Uwe Bubeck, Hans Kleine Büning:
Bounded Universal Expansion for Preprocessing QBF. SAT 2007: 244-257 - 2006
- [j34]Zhi-Hong Tao, Hans Kleine Büning, Lifu Wang:
Direct Model Checking Matrix Algorithm. J. Comput. Sci. Technol. 21(6): 944-949 (2006) - [c25]Uwe Bubeck, Hans Kleine Büning:
Dependency Quantified Horn Formulas: Models and Complexity. SAT 2006: 198-211 - [c24]Hans Kleine Büning, Xishun Zhao:
Minimal False Quantified Boolean Formulas. SAT 2006: 339-352 - 2005
- [j33]Hans Kleine Büning, Daoyun Xu:
The complexity of homomorphisms and renamings for minimal unsatisfiable formulas. Ann. Math. Artif. Intell. 43(1): 113-127 (2005) - [j32]Hans Kleine Büning, Xishun Zhao:
Extension and equivalence problems for clause minimal formulae. Ann. Math. Artif. Intell. 43(1): 295-306 (2005) - [c23]Oliver Kramer, Chuan-Kang Ting, Hans Kleine Büning:
A new mutation operator for evolution strategies for constrained problems. Congress on Evolutionary Computation 2005: 2600-2606 - [c22]Oliver Kramer, Chuan-Kang Ting, Hans Kleine Büning:
A mutation operator for evolution strategies to handle constrained problems. GECCO 2005: 917-918 - [c21]Andreas Goebels, Hans Kleine Büning, Steffen Priesterjahn, Alexander Weimer:
Towards Online Partitioning of Agent Sets based on Local Information. Parallel and Distributed Computing and Networks 2005: 674-679 - [c20]Xishun Zhao, Hans Kleine Büning:
Model-Equivalent Reductions. SAT 2005: 355-370 - [c19]Uwe Bubeck, Hans Kleine Büning, Xishun Zhao:
Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas. SAT 2005: 386-392 - [c18]Andreas Goebels, Hans Kleine Büning, Steffen Priesterjahn, Alexander Weimer:
Multi Target Partitioning of Sets Based on Local Information. WSTST 2005: 1309-1318 - 2004
- [c17]Hans Kleine Büning, Xishun Zhao:
On Models for Quantified Boolean Formulas. Logic versus Approximation 2004: 18-32 - [c16]Hans Kleine Büning, Xishun Zhao:
Equivalence Models for Quantified Boolean Formulas. SAT 2004 - [c15]Hans Kleine Büning, Xishun Zhao:
Equivalence Models for Quantified Boolean Formulas. SAT (Selected Papers 2004: 224-234 - 2003
- [j31]Hans Kleine Büning, Xishun Zhao:
On the structure of some classes of minimal unsatisfiable formulas. Discret. Appl. Math. 130(2): 185-207 (2003) - [c14]Chuan-Kang Ting, Hans Kleine Büning:
A mating strategy for multi-parent genetic algorithms by integrating tabu search. IEEE Congress on Evolutionary Computation 2003: 1259-1266 - [c13]Hans Kleine Büning, K. Subramani, Xishun Zhao:
On Boolean Models for Quantified Boolean Horn Formulas. SAT 2003: 93-104 - [c12]Hans Kleine Büning, Xishun Zhao:
Read-Once Unit Resolution. SAT 2003: 356-369 - 2002
- [j30]Hans Kleine Büning, Xishun Zhao:
The Complexity of Read-Once Resolution. Ann. Math. Artif. Intell. 36(4): 419-435 (2002) - [j29]Hans Kleine Büning, Xishun Zhao:
Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency. Inf. Process. Lett. 84(3): 147-151 (2002) - 2001
- [j28]Hans Kleine Büning, Xishun Zhao:
Satisfiable Formulas Closed Under Replacement. Electron. Notes Discret. Math. 9: 48-58 (2001) - 2000
- [j27]Xishun Zhao, Decheng Ding, Hans Kleine Büning:
Complexity Results for Restricted Credulous Default Reasoning. AI Commun. 13(4): 249-258 (2000) - [j26]Hans Kleine Büning:
On subclasses of minimal unsatisfiable formulas. Discret. Appl. Math. 107(1-3): 83-98 (2000)
1990 – 1999
- 1999
- [b3]Hans Kleine Büning, Theodor Lettmann:
Propositional logic - deduction and algorithms. Cambridge tracts in theoretical computer science 48, Cambridge University Press 1999, ISBN 978-0-521-63017-7, pp. I-X, 1-409 - [j25]Hans Kleine Büning, Theodor Lettmann:
Resolution Remains Hard Under Equivalence. Discret. Appl. Math. 96-97: 139-148 (1999) - 1998
- [j24]Gennady Davydov, Inna Davydova, Hans Kleine Büning:
An Efficient Algorithm for the Minimal Unsatisfiability Problem for a Subclass of CNF. Ann. Math. Artif. Intell. 23(3-4): 229-245 (1998) - [c11]Hans Kleine Büning:
An Upper Bound for Minimal Resolution Refutations. CSL 1998: 171-178 - 1997
- [j23]Etienne Grandjean, Hans Kleine Büning:
SAT-Problems and Reductions with Respect to the Number of Variables. J. Log. Comput. 7(4): 457-471 (1997) - 1996
- [j22]Michael Buro, Hans Kleine Büning:
On Resolution with Short Clauses. Ann. Math. Artif. Intell. 18(2-4): 243-260 (1996) - [c10]Hans Kleine Büning, Theodor Lettmann:
Learning a Representation for Optimizable Formulas. ALT 1996: 51-58 - [e7]Hans Kleine Büning:
Computer Science Logic, 9th International Workshop, CSL '95, Annual Conference of the EACSL, Paderborn, Germany, September 22-29, 1995, Selected Papers. Lecture Notes in Computer Science 1092, Springer 1996, ISBN 3-540-61377-3 [contents] - 1995
- [j21]Hans Kleine Büning, Marek Karpinski, Andreas Flögel:
Resolution for Quantified Boolean Formulas. Inf. Comput. 117(1): 12-18 (1995) - [j20]Hans Kleine Büning, Ralf Lemmen, Michael Suermann, Marcus Hoffmann, Daniel Curatolo, Benno Stein:
Entwurfsunterstützung in der Hydraulik mit dem System art deco. Künstliche Intell. 9(5): 49-55 (1995) - 1994
- [b2]Hans Kleine Büning, Theodor Lettmann:
Aussagenlogik - Deduktion und Algorithmen. Leitfäden und Monographien der Informatik, Teubner 1994, ISBN 978-3-519-02133-9, pp. I-X, 1-438 - 1993
- [j19]Andreas Flögel, Hans Kleine Büning, Theodor Lettmann:
On the Restricted Equivalence Subclasses of Propositional Logic. RAIRO Theor. Informatics Appl. 27(4): 327-340 (1993) - [j18]Hans Kleine Büning:
On generalized Horn formulas and k-resolution. Theor. Comput. Sci. 116(2): 405-413 (1993) - [e6]Egon Börger, Gerhard Jäger, Hans Kleine Büning, Simone Martini, Michael M. Richter:
Computer Science Logic, 6th Workshop, CSL '92, San Miniato, Italy, September 28 - October 2, 1992, Selected Papers. Lecture Notes in Computer Science 702, Springer 1993, ISBN 3-540-56992-8 [contents] - 1992
- [e5]Egon Börger, Gerhard Jäger, Hans Kleine Büning, Michael M. Richter:
Computer Science Logic, 5th Workshop, CSL '91, Berne, Switzerland, October 7-11, 1991, Proceedings. Lecture Notes in Computer Science 626, Springer 1992, ISBN 3-540-55789-X [contents] - 1991
- [e4]Egon Börger, Hans Kleine Büning, Michael M. Richter, Wolfgang Schönfeld:
Computer Science Logic, 4th Workshop, CSL '90, Heidelberg, Germany, October 1-5, 1990, Proceedings. Lecture Notes in Computer Science 533, Springer 1991, ISBN 3-540-54487-9 [contents] - 1990
- [j17]Hans Kleine Büning:
Existence of Simple Propositional Formulas. Inf. Process. Lett. 36(4): 177-182 (1990) - [j16]Hans Kleine Büning, Ulrich Löwen, Stefan Schmitgen:
Equivalence of Propositional Prolog Programs. J. Autom. Reason. 6(3): 319-335 (1990) - [c9]Andreas Flögel, Marek Karpinski, Hans Kleine Büning:
Subclasses of Quantified Boolean Formulas. CSL 1990: 145-155 - [e3]Egon Börger, Hans Kleine Büning, Michael M. Richter:
CSL '89, 3rd Workshop on Computer Science Logic, Kaiserslautern, Germany, October 2-6, 1989, Proceedings. Lecture Notes in Computer Science 440, Springer 1990, ISBN 3-540-52753-2 [contents]
1980 – 1989
- 1989
- [j15]Hans Kleine Büning, Ulrich Löwen, Stefan Schmitgen:
Inconsistency of Production Systems. Data Knowl. Eng. 3(4): 245-260 (1989) - [j14]Hans Kleine Büning, Ulrich Löwen:
Optimizing Propositional Calculus Formulas with Regard to Questions of Deducibility. Inf. Comput. 80(1): 18-43 (1989) - [j13]Hans Kleine Büning, Theodor Lettmann, Ernst W. Mayr:
Projections of Vector Addition System Reachability Sets are Semilinear. Theor. Comput. Sci. 64(3): 343-350 (1989) - [e2]Egon Börger, Hans Kleine Büning, Michael M. Richter:
CSL '88, 2nd Workshop on Computer Science Logic, Duisburg, Germany, October 3-7, 1988, Proceedings. Lecture Notes in Computer Science 385, Springer 1989, ISBN 3-540-51659-X [contents] - 1988
- [b1]Hans Kleine Büning, Stefan Schmitgen:
Prolog - Grundlagen und Anwendungen, 2. Auflage. Leitfäden und Monographien der Informatik, Teubner 1988, ISBN 978-3-519-12484-9, pp. 1-311 - [j12]Hans Kleine Büning, Ulrich Löwen:
Optimization Aspects for Propositional Binary Prolog Programs. J. Inf. Process. Cybern. 24(11/12): 585-599 (1988) - [j11]Hans Kleine Büning, Theodor Lettmann:
First-Order Formulas in Conjunctive Quantificational Form. Math. Log. Q. 34(1): 53-64 (1988) - [c8]Hans Kleine Büning, Ulrich Löwen, Stefan Schmitgen:
Loop Detection in Propositional Prolog Programs. CSL 1988: 148-165 - [e1]Egon Börger, Hans Kleine Büning, Michael M. Richter:
CSL '87, 1st Workshop on Computer Science Logic, Karlsruhe, Germany, October 12-16, 1987, Proceedings. Lecture Notes in Computer Science 329, Springer 1988, ISBN 3-540-50241-6 [contents] - 1987
- [c7]Hans Kleine Büning, Theodor Lettmann:
Representation Independent Query and Update Operations on Propositional Definite Horn Formulas. Computation Theory and Logic 1987: 208-223 - [c6]Marek Karpinski, Hans Kleine Büning, Peter H. Schmitt:
On the Computational Complexity of Quantified Horn Clauses. CSL 1987: 129-137 - [c5]Hans Kleine Büning, Theodor Lettmann:
Perspektiven für die Logikprogrammierung. Wissensrepräsentation in Expertensystemen 1987: 56-78 - 1986
- [c4]Hans Kleine Büning, Theodor Lettmann:
Classes of First Order Formulas Under Various Satisfiability Definitions. CADE 1986: 553-563 - 1983
- [j10]Hans Kleine Büning:
The early bird problem is unsolvable in a one-dimensional cellular space with 4 states. Acta Cybern. 6(1): 23-31 (1983) - [j9]Hans Kleine Büning:
A classification of an iterative hierarchy. Arch. Math. Log. 23(1): 175-186 (1983) - [j8]Hans Kleine Büning:
Durch syntaktische Rekursion definierte Klassen. Math. Log. Q. 29(3): 169-175 (1983) - [c3]Hans Kleine Büning:
Complexity of loop-problems in normed networks. Logic and Machines 1983: 254-269 - 1982
- [j7]Hans Kleine Büning:
Note on the E. Math. Log. Q. 28(19): 277-284 (1982) - 1981
- [j6]Hans Kleine Büning:
Some undecidable theories with monadic predicates and without equality. Arch. Math. Log. 21(1): 137-148 (1981) - [c2]Hans Kleine Büning:
Classes of Functions over Binary Trees. FCT 1981: 199-204 - 1980
- [j5]Hans Kleine Büning, Lutz Priese:
Universal Asynchronous Iterative Arrays of Mealy Automata. Acta Informatica 13: 269-285 (1980) - [j4]Hans Kleine Büning:
Decision problems in generalized vector addition systems. Fundam. Informaticae 3(4): 497- (1980) - [j3]Egon Börger, Hans Kleine Büning:
The R. E. Complexity of Decision Problems for Commutative Semi-Thue Systems With Recursive Rule Set. Math. Log. Q. 26(28-30): 459-469 (1980) - [j2]Egon Börger, Hans Kleine Büning:
The Reachability Problem for Petri Nets and Decision Problems for Skolem Arithmetic. Theor. Comput. Sci. 11: 123-143 (1980)
1970 – 1979
- 1979
- [c1]Hans Kleine Büning:
Generalized vector addition systems with finite exception sets. FCT 1979: 237-242 - 1977
- [j1]Hans Kleine Büning, Thomas Ottmann:
Kleine universelle mehrdimensionale Turingmaschinen. J. Inf. Process. Cybern. 13(4/5): 179-201 (1977)