dblp.uni-trier.dewww.uni-trier.de

Hans Kleine Büning Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
70EEHans Kleine Büning, Xishun Zhao, Uwe Bubeck: Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits. SAT 2009: 391-397
69EEHans Kleine Büning, Oliver Kullmann: Minimal Unsatisfiability and Autarkies. Handbook of Satisfiability 2009: 339-401
68EEHans Kleine Büning, Uwe Bubeck: Theory of Quantified Boolean Formulas. Handbook of Satisfiability 2009: 735-760
67EEUwe Bubeck, Hans Kleine Büning: A new 3-CNF transformation by parallel-serial graphs. Inf. Process. Lett. 109(7): 376-379 (2009)
2008
66 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 Springer 2008
65EEUwe Bubeck, Hans Kleine Büning: Models and quantifier elimination for quantified Horn formulas. Discrete Applied Mathematics 156(10): 1606-1622 (2008)
64EEHans Kleine Büning, Xishun Zhao: Computational complexity of quantified Boolean formulas with fixed maximal deficiency. Theor. Comput. Sci. 407(1-3): 448-457 (2008)
2007
63EENatalia Akchurina, Hans Kleine Büning: Virtual Markets: Q -Learning Sellers with Simple State Representation. AIS-ADM 2007: 192-205
62EEUwe Bubeck, Hans Kleine Büning: Bounded Universal Expansion for Preprocessing QBF. SAT 2007: 244-257
61EEHans Kleine Büning, K. Subramani, Xishun Zhao: Boolean Functions as Models for Quantified Boolean Formulas. J. Autom. Reasoning 39(1): 49-75 (2007)
60EEHans Kleine Büning, Xishun Zhao: The Complexity of Some Subclasses of Minimal Unsatis able Formulas. JSAT 3(1-2): 1-17 (2007)
59EEHans Kleine Büning, Xishun Zhao: An Extension of Deficiency and Minimal Unsatisfiability of Quantified Boolean Formulas. JSAT 3(3-4): 115-123 (2007)
2006
58EEUwe Bubeck, Hans Kleine Büning: Dependency Quantified Horn Formulas: Models and Complexity. SAT 2006: 198-211
57EEHans Kleine Büning, Xishun Zhao: Minimal False Quantified Boolean Formulas. SAT 2006: 339-352
56EEZhi-Hong Tao, Hans Kleine Büning, Li-Fu Wang: Direct Model Checking Matrix Algorithm. J. Comput. Sci. Technol. 21(6): 944-949 (2006)
2005
55EEOliver 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
54EEOliver Kramer, Chuan-Kang Ting, Hans Kleine Büning: A mutation operator for evolution strategies to handle constrained problems. GECCO 2005: 917-918
53 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
52EEXishun Zhao, Hans Kleine Büning: Model-Equivalent Reductions. SAT 2005: 355-370
51EEUwe Bubeck, Hans Kleine Büning, Xishun Zhao: Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas. SAT 2005: 386-392
50EEAndreas Goebels, Hans Kleine Büning, Steffen Priesterjahn, Alexander Weimer: Multi Target Partitioning of Sets Based on Local Information. WSTST 2005: 1309-1318
49EEHans Kleine Büning, Daoyun Xu: The complexity of homomorphisms and renamings for minimal unsatisfiable formulas. Ann. Math. Artif. Intell. 43(1): 113-127 (2005)
48EEHans Kleine Büning, Xishun Zhao: Extension and equivalence problems for clause minimal formulae. Ann. Math. Artif. Intell. 43(1): 295-306 (2005)
2004
47EEHans Kleine Büning, Xishun Zhao: On Models for Quantified Boolean Formulas. Logic versus Approximation 2004: 18-32
46EEHans Kleine Büning, Xishun Zhao: Equivalence Models for Quantified Boolean Formulas. SAT 2004
45EEHans Kleine Büning, Xishun Zhao: Equivalence Models for Quantified Boolean Formulas. SAT (Selected Papers 2004: 224-234
2003
44EEHans Kleine Büning, Xishun Zhao: Read-Once Unit Resolution. SAT 2003: 356-369
43EEHans Kleine Büning, K. Subramani, Xishun Zhao: On Boolean Models for Quantified Boolean Horn Formulas. SAT 2003: 93-104
42EEHans Kleine Büning, Xishun Zhao: On the structure of some classes of minimal unsatisfiable formulas. Discrete Applied Mathematics 130(2): 185-207 (2003)
2002
41 Hans Kleine Büning, Xishun Zhao: The Complexity of Read-Once Resolution. Ann. Math. Artif. Intell. 36(4): 419-435 (2002)
40EEHans 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
39EEHans Kleine Büning, Xishun Zhao: Satisfiable Formulas Closed Under Replacement. Electronic Notes in Discrete Mathematics 9: 48-58 (2001)
2000
38 Xishun Zhao, Decheng Ding, Hans Kleine Büning: Complexity Results for Restricted Credulous Default Reasoning. AI Commun. 13(4): 249-258 (2000)
37 Hans Kleine Büning: On subclasses of minimal unsatisfiable formulas. Discrete Applied Mathematics 107(1-3): 83-98 (2000)
1999
36EEHans Kleine Büning, Theodor Lettmann: Resolution Remains Hard Under Equivalence. Discrete Applied Mathematics 96-97: 139-148 (1999)
1998
35EEHans Kleine Büning: An Upper Bound for Minimal Resolution Refutations. CSL 1998: 171-178
34 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)
1997
33 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
32 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 Springer 1996
31 Hans Kleine Büning, Theodor Lettmann: Learning a Representation for Optimizable Formulas. ALT 1996: 51-58
30 Michael Buro, Hans Kleine Büning: On Resolution with Short Clauses. Ann. Math. Artif. Intell. 18(2-4): 243-260 (1996)
1995
29 Hans Kleine Büning, Marek Karpinski, Andreas Flögel: Resolution for Quantified Boolean Formulas Inf. Comput. 117(1): 12-18 (1995)
28 Hans Kleine Büning, Ralf Lemmen, Michael Suermann, Marcus Hoffmann, Daniel Curatolo, Benno Stein: Entwurfsunterstützung in der Hydraulik mit dem System art deco. KI 9(5): 49-55 (1995)
1993
27 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 Springer 1993
26 Andreas Flögel, Hans Kleine Büning, Theodor Lettmann: On the Restricted Equivalence Subclasses of Propositional Logic. ITA 27(4): 327-340 (1993)
1992
25 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 Springer 1992
1991
24 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 Springer 1991
1990
23 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 Springer 1990
22EEAndreas Flögel, Marek Karpinski, Hans Kleine Büning: Subclasses of Quantified Boolean Formulas. CSL 1990: 145-155
21 Hans Kleine Büning: Existence of Simple Propositional Formulas. Inf. Process. Lett. 36(4): 177-182 (1990)
20 Hans Kleine Büning, Ulrich Löwen, Stefan Schmitgen: Equivalence of Propositional Prolog Programs. J. Autom. Reasoning 6(3): 319-335 (1990)
1989
19 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 Springer 1989
18 Hans Kleine Büning, Ulrich Löwen, Stefan Schmitgen: Inconsistency of Production Systems. Data Knowl. Eng. 3(4): 245-260 (1989)
17 Hans Kleine Büning, Ulrich Löwen: Optimizing Propositional Calculus Formulas with Regard to Questions of Deducibility Inf. Comput. 80(1): 18-43 (1989)
16 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)
1988
15 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 Springer 1988
14EEHans Kleine Büning, Ulrich Löwen, Stefan Schmitgen: Loop Detection in Propositional Prolog Programs. CSL 1988: 148-165
13 Hans Kleine Büning, Ulrich Löwen: Optimization Aspects for Propositional Binary Prolog Programs. Elektronische Informationsverarbeitung und Kybernetik 24(11/12): 585-599 (1988)
1987
12EEMarek Karpinski, Hans Kleine Büning, Peter H. Schmitt: On the Computational Complexity of Quantified Horn Clauses. CSL 1987: 129-137
11 Hans Kleine Büning, Theodor Lettmann: Representation Independent Query and Update Operations on Propositional Definite Horn Formulas. Computation Theory and Logic 1987: 208-223
10 Hans Kleine Büning, Theodor Lettmann: Perspektiven für die Logikprogrammierung. Wissensrepräsentation in Expertensystemen 1987: 56-78
1986
9EEHans Kleine Büning, Theodor Lettmann: Classes of First Order Formulas Under Various Satisfiability Definitions. CADE 1986: 553-563
1983
8 Hans Kleine Büning: Complexity of loop-problems in normed networks. Logic and Machines 1983: 254-269
7 Hans Kleine Büning: The early bird problem is unsolvable in one-dimensional cellular space with 4 states. Acta Cybern. 6: 23-31 (1983)
1981
6 Hans Kleine Büning: Classes of Functions over Binary Trees. FCT 1981: 199-204
1980
5 Hans Kleine Büning, Lutz Priese: Universal Asynchronous Iterative Arrays of Mealy Automata. Acta Inf. 13: 269-285 (1980)
4 Hans Kleine Büning: Decision problems in generalized vector addition systems. Fundam. Inform. 3(4): 497- (1980)
3 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)
1979
2 Hans Kleine Büning: Generalized vector addition systems with finite exception sets. FCT 1979: 237-242
1977
1 Hans Kleine Büning, Thomas Ottmann: Kleine universelle mehrdimensionale Turingmaschinen. Elektronische Informationsverarbeitung und Kybernetik 13(4/5): 179-201 (1977)

Coauthor Index

1Natalia Akchurina [63]
2Egon Börger [3] [15] [19] [23] [24] [25] [27]
3Uwe Bubeck [51] [58] [62] [65] [67] [68] [70]
4Michael Buro [30]
5Daniel Curatolo [28]
6Gennady Davydov [34]
7Inna Davydova [34]
8Decheng Ding [38]
9Andreas Flögel [22] [26] [29]
10Andreas Goebels [50] [53]
11Etienne Grandjean [33]
12Marcus Hoffmann [28]
13Gerhard Jäger [25] [27]
14Marek Karpinski [12] [22] [29]
15Oliver Kramer [54] [55]
16Oliver Kullmann [69]
17Ralf Lemmen [28]
18Theodor Lettmann [9] [10] [11] [16] [26] [31] [36]
19Ulrich Löwen [13] [14] [17] [18] [20]
20Simone Martini [27]
21Ernst W. Mayr [16]
22Thomas Ottmann [1]
23Lutz Priese [5]
24Steffen Priesterjahn [50] [53]
25Michael M. Richter [15] [19] [23] [24] [25] [27]
26Stefan Schmitgen [14] [18] [20]
27Peter H. Schmitt [12]
28Wolfgang Schönfeld [24]
29Benno Stein [28]
30K. Subramani [43] [61]
31Michael Suermann [28]
32Zhi-Hong Tao [56]
33Chuan-Kang Ting [54] [55]
34Li-Fu Wang [56]
35Alexander Weimer [50] [53]
36Daoyun Xu [49]
37Xishun Zhao [38] [39] [40] [41] [42] [43] [44] [45] [46] [47] [48] [51] [52] [57] [59] [60] [61] [64] [66] [70]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)