The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hans Kleine Büning: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hans Kleine Büning, Ulrich Löwen, Stefan Schmitgen
    Inconsistency of Production Systems. [Citation Graph (1, 0)][DBLP]
    Data Knowl. Eng., 1989, v:3, n:4, pp:245-260 [Journal]
  2. Hans Kleine Büning, Theodor Lettmann
    Learning a Representation for Optimizable Formulas. [Citation Graph (0, 0)][DBLP]
    ALT, 1996, pp:51-58 [Conf]
  3. Hans Kleine Büning, Theodor Lettmann
    Representation Independent Query and Update Operations on Propositional Definite Horn Formulas. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:208-223 [Conf]
  4. Hans Kleine Büning, Xishun Zhao
    On Models for Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    Logic versus Approximation, 2004, pp:18-32 [Conf]
  5. Hans Kleine Büning, Theodor Lettmann
    Classes of First Order Formulas Under Various Satisfiability Definitions. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:553-563 [Conf]
  6. Hans Kleine Büning
    An Upper Bound for Minimal Resolution Refutations. [Citation Graph (0, 0)][DBLP]
    CSL, 1998, pp:171-178 [Conf]
  7. Hans Kleine Büning, Ulrich Löwen, Stefan Schmitgen
    Loop Detection in Propositional Prolog Programs. [Citation Graph (0, 0)][DBLP]
    CSL, 1988, pp:148-165 [Conf]
  8. Andreas Flögel, Marek Karpinski, Hans Kleine Büning
    Subclasses of Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    CSL, 1990, pp:145-155 [Conf]
  9. Marek Karpinski, Hans Kleine Büning, Peter H. Schmitt
    On the Computational Complexity of Quantified Horn Clauses. [Citation Graph (0, 0)][DBLP]
    CSL, 1987, pp:129-137 [Conf]
  10. Hans Kleine Büning
    Generalized vector addition systems with finite exception sets. [Citation Graph (0, 0)][DBLP]
    FCT, 1979, pp:237-242 [Conf]
  11. Hans Kleine Büning
    Classes of Functions over Binary Trees. [Citation Graph (0, 0)][DBLP]
    FCT, 1981, pp:199-204 [Conf]
  12. Oliver Kramer, Chuan-Kang Ting, Hans Kleine Büning
    A mutation operator for evolution strategies to handle constrained problems. [Citation Graph (0, 0)][DBLP]
    GECCO, 2005, pp:917-918 [Conf]
  13. Hans Kleine Büning, Theodor Lettmann
    Perspektiven für die Logikprogrammierung. [Citation Graph (0, 0)][DBLP]
    Wissensrepräsentation in Expertensystemen, 1987, pp:56-78 [Conf]
  14. Hans Kleine Büning
    Complexity of loop-problems in normed networks. [Citation Graph (0, 0)][DBLP]
    Logic and Machines, 1983, pp:254-269 [Conf]
  15. Andreas Goebels, Hans Kleine Büning, Steffen Priesterjahn, Alexander Weimer
    Towards Online Partitioning of Agent Sets based on Local Information. [Citation Graph (0, 0)][DBLP]
    Parallel and Distributed Computing and Networks, 2005, pp:674-679 [Conf]
  16. Uwe Bubeck, Hans Kleine Büning
    Dependency Quantified Horn Formulas: Models and Complexity. [Citation Graph (0, 0)][DBLP]
    SAT, 2006, pp:198-211 [Conf]
  17. Uwe Bubeck, Hans Kleine Büning, Xishun Zhao
    Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas. [Citation Graph (0, 0)][DBLP]
    SAT, 2005, pp:386-392 [Conf]
  18. Hans Kleine Büning, K. Subramani, Xishun Zhao
    On Boolean Models for Quantified Boolean Horn Formulas. [Citation Graph (0, 0)][DBLP]
    SAT, 2003, pp:93-104 [Conf]
  19. Hans Kleine Büning, Xishun Zhao
    Read-Once Unit Resolution. [Citation Graph (0, 0)][DBLP]
    SAT, 2003, pp:356-369 [Conf]
  20. Hans Kleine Büning, Xishun Zhao
    Equivalence Models for Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  21. Hans Kleine Büning, Xishun Zhao
    Equivalence Models for Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    SAT (Selected Papers, 2004, pp:224-234 [Conf]
  22. Hans Kleine Büning, Xishun Zhao
    Minimal False Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    SAT, 2006, pp:339-352 [Conf]
  23. Xishun Zhao, Hans Kleine Büning
    Model-Equivalent Reductions. [Citation Graph (0, 0)][DBLP]
    SAT, 2005, pp:355-370 [Conf]
  24. Hans Kleine Büning, Lutz Priese
    Universal Asynchronous Iterative Arrays of Mealy Automata. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1980, v:13, n:, pp:269-285 [Journal]
  25. Hans Kleine Büning
    The early bird problem is unsolvable in one-dimensional cellular space with 4 states. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1983, v:6, n:, pp:23-31 [Journal]
  26. Xishun Zhao, Decheng Ding, Hans Kleine Büning
    Complexity Results for Restricted Credulous Default Reasoning. [Citation Graph (0, 0)][DBLP]
    AI Commun., 2000, v:13, n:4, pp:249-258 [Journal]
  27. Hans Kleine Büning, Daoyun Xu
    The complexity of homomorphisms and renamings for minimal unsatisfiable formulas. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:113-127 [Journal]
  28. Hans Kleine Büning, Xishun Zhao
    The Complexity of Read-Once Resolution. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2002, v:36, n:4, pp:419-435 [Journal]
  29. Hans Kleine Büning, Xishun Zhao
    Extension and equivalence problems for clause minimal formulae. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:295-306 [Journal]
  30. Michael Buro, Hans Kleine Büning
    On Resolution with Short Clauses. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1996, v:18, n:2-4, pp:243-260 [Journal]
  31. Gennady Davydov, Inna Davydova, Hans Kleine Büning
    An Efficient Algorithm for the Minimal Unsatisfiability Problem for a Subclass of CNF. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1998, v:23, n:3-4, pp:229-245 [Journal]
  32. Hans Kleine Büning
    On subclasses of minimal unsatisfiable formulas. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:107, n:1-3, pp:83-98 [Journal]
  33. Hans Kleine Büning, Theodor Lettmann
    Resolution Remains Hard Under Equivalence. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:96, n:, pp:139-148 [Journal]
  34. Hans Kleine Büning, Xishun Zhao
    On the structure of some classes of minimal unsatisfiable formulas. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:130, n:2, pp:185-207 [Journal]
  35. Hans Kleine Büning, Ulrich Löwen
    Optimization Aspects for Propositional Binary Prolog Programs. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1988, v:24, n:11/12, pp:585-599 [Journal]
  36. Hans Kleine Büning, Thomas Ottmann
    Kleine universelle mehrdimensionale Turingmaschinen. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1977, v:13, n:4/5, pp:179-201 [Journal]
  37. Hans Kleine Büning
    Decision problems in generalized vector addition systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1980, v:3, n:4, pp:497-0 [Journal]
  38. Hans Kleine Büning, Marek Karpinski, Andreas Flögel
    Resolution for Quantified Boolean Formulas [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:117, n:1, pp:12-18 [Journal]
  39. Hans Kleine Büning, Ulrich Löwen
    Optimizing Propositional Calculus Formulas with Regard to Questions of Deducibility [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:80, n:1, pp:18-43 [Journal]
  40. Hans Kleine Büning
    Existence of Simple Propositional Formulas. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:36, n:4, pp:177-182 [Journal]
  41. Hans Kleine Büning, Xishun Zhao
    Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:3, pp:147-151 [Journal]
  42. Andreas Flögel, Hans Kleine Büning, Theodor Lettmann
    On the Restricted Equivalence Subclasses of Propositional Logic. [Citation Graph (0, 0)][DBLP]
    ITA, 1993, v:27, n:4, pp:327-340 [Journal]
  43. Hans Kleine Büning, Ulrich Löwen, Stefan Schmitgen
    Equivalence of Propositional Prolog Programs. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1990, v:6, n:3, pp:319-335 [Journal]
  44. Zhi-Hong Tao, Hans Kleine Büning, Li-Fu Wang
    Direct Model Checking Matrix Algorithm. [Citation Graph (0, 0)][DBLP]
    J. Comput. Sci. Technol., 2006, v:21, n:6, pp:944-949 [Journal]
  45. Hans Kleine Büning, Ralf Lemmen, Michael Suermann, Marcus Hoffmann, Daniel Curatolo, Benno Stein
    Entwurfsunterstützung in der Hydraulik mit dem System art deco. [Citation Graph (0, 0)][DBLP]
    KI, 1995, v:9, n:5, pp:49-55 [Journal]
  46. Etienne Grandjean, Hans Kleine Büning
    SAT-Problems and Reductions with Respect to the Number of Variables. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1997, v:7, n:4, pp:457-471 [Journal]
  47. Egon Börger, Hans Kleine Büning
    The Reachability Problem for Petri Nets and Decision Problems for Skolem Arithmetic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:123-143 [Journal]
  48. Hans Kleine Büning, Theodor Lettmann, Ernst W. Mayr
    Projections of Vector Addition System Reachability Sets are Semilinear. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:64, n:3, pp:343-350 [Journal]
  49. Natalia Akchurina, Hans Kleine Büning
    Virtual Markets: Q -Learning Sellers with Simple State Representation. [Citation Graph (0, 0)][DBLP]
    AIS-ADM, 2007, pp:192-205 [Conf]
  50. Uwe Bubeck, Hans Kleine Büning
    Bounded Universal Expansion for Preprocessing QBF. [Citation Graph (0, 0)][DBLP]
    SAT, 2007, pp:244-257 [Conf]
  51. Oliver Kramer, Chuan-Kang Ting, Hans Kleine Büning
    A new mutation operator for evolution strategies for constrained problems. [Citation Graph (0, 0)][DBLP]
    Congress on Evolutionary Computation, 2005, pp:2600-2606 [Conf]
  52. Hans Kleine Büning, K. Subramani, Xishun Zhao
    Boolean Functions as Models for Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2007, v:39, n:1, pp:49-75 [Journal]

  53. Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits. [Citation Graph (, )][DBLP]


  54. Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN. [Citation Graph (, )][DBLP]


  55. The Effects of Local Trust Cooperation in Multiagent Systems. [Citation Graph (, )][DBLP]


  56. Self-adaptation Strategies to Favor Cooperation. [Citation Graph (, )][DBLP]


  57. Multi Target Partitioning of Sets Based on Local Information. [Citation Graph (, )][DBLP]


  58. Models and quantifier elimination for quantified Horn formulas. [Citation Graph (, )][DBLP]


Search in 0.419secs, Finished in 0.423secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002