Hans Kleine Büning
According to our database1,
Hans Kleine Büning
authored at least 101 papers
between 1977 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepage:
-
at wwwcs.upb.de
On csauthors.net:
Bibliography
2018
Finding read-once resolution refutations in systems of 2CNF clauses.
Theor. Comput. Sci., 2018
2017
Foreword.
Theor. Comput. Sci., 2017
On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas.
Proceedings of the Theory and Applications of Models of Computation, 2017
The Complexity of Finding Read-Once NAE-Resolution Refutations.
Proceedings of the Logic and Its Applications - 7th Indian Conference, 2017
2015
Learning Boolean specifications.
Artif. Intell., 2015
Automated Online Service Composition.
Proceedings of the 2015 IEEE International Conference on Services Computing, 2015
2014
Horn formulas, directed hypergraphs, lattices and closure systems: related formalisms and applications (Dagstuhl Seminar 14201).
Dagstuhl Reports, 2014
Model-Based Anomaly Detection for Discrete Event Systems.
Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014
Automatic ATM Fraud Detection as a Sequence-based Anomaly Detection Problem.
Proceedings of the ICPRAM 2014, 2014
On the Usage of Behavior Models to Detect ATM Fraud.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014
2013
Reducing Nondeterminism in Automated Service Composition.
Proceedings of the 2013 IEEE 6th International Conference on Service-Oriented Computing and Applications, 2013
Nested Boolean Functions as Models for Quantified Boolean Formulas.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013
Semi-Automated Software Composition Through Generated Components.
Proceedings of the 15th International Conference on Information Integration and Web-based Applications & Services, 2013
2012
Encoding Nested Boolean Functions as Quantified Boolean Formulas.
JSAT, 2012
Adaptive function approximation in reinforcement learning with an interpolating growing neural gas.
Proceedings of the 12th International Conference on Hybrid Intelligent Systems, 2012
Learning Behavior Models for Hybrid Timed Systems.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012
2011
Transformations into Normal Forms for Quantified Circuits.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011
On the Power of Global Reward Signals in Reinforcement Learning.
Proceedings of the Multiagent System Technologies - 9th German Conference, 2011
State Aggregation by Growing Neural Gas for Reinforcement Learning in Continuous State Spaces.
Proceedings of the 10th International Conference on Machine Learning and Applications and Workshops, 2011
Using behavior models for anomaly detection in hybrid systems.
Proceedings of the XXIII International Symposium on Information, 2011
Region-based Heuristics for an Iterative Partitioning Problem in Multiagent Systems.
Proceedings of the ICAART 2011 - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence, Volume 2, 2011
Convergence Analysis of a Multiagent Cooperation Model.
Proceedings of the ICAART 2011 - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence, Volume 2, 2011
Coordination in Large Multiagent Reinforcement Learning Problems.
Proceedings of the 2011 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2011
Identifying behavior models for process plants.
Proceedings of the IEEE 16th Conference on Emerging Technologies & Factory Automation, 2011
A Convergent Multiagent Reinforcement Learning Approach for a Subclass of Cooperative Stochastic Games.
Proceedings of the Adaptive and Learning Agents - International Workshop, 2011
2010
An upper bound for the circuit complexity of existentially quantified Boolean formulas.
Theor. Comput. Sci., 2010
Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN.
Proceedings of the Theory and Applications of Satisfiability Testing, 2010
The Effects of Local Trust Cooperation in Multiagent Systems.
Proceedings of the Agent and Multi-Agent Systems: Technologies and Applications, 2010
Self-adaptation Strategies to Favor Cooperation.
Proceedings of the Agent and Multi-Agent Systems: Technologies and Applications, 2010
External Coordination Media in Capacity-Constrained Multiagent Systems.
Proceedings of the 2010 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2010
2009
Minimal Unsatisfiability and Autarkies.
Proceedings of the Handbook of Satisfiability, 2009
Theory of Quantified Boolean Formulas.
Proceedings of the Handbook of Satisfiability, 2009
A new 3-CNF transformation by parallel-serial graphs.
Inf. Process. Lett., 2009
Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits.
Proceedings of the Theory and Applications of Satisfiability Testing, 2009
2008
Computational complexity of quantified Boolean formulas with fixed maximal deficiency.
Theor. Comput. Sci., 2008
Models and quantifier elimination for quantified Horn formulas.
Discrete Applied Mathematics, 2008
2007
An Extension of Deficiency and Minimal Unsatisfiability of Quantified Boolean Formulas.
JSAT, 2007
The Complexity of Some Subclasses of Minimal Unsatis able Formulas.
JSAT, 2007
Boolean Functions as Models for Quantified Boolean Formulas.
J. Autom. Reasoning, 2007
Bounded Universal Expansion for Preprocessing QBF.
Proceedings of the Theory and Applications of Satisfiability Testing, 2007
Virtual Markets: Q -Learning Sellers with Simple State Representation.
Proceedings of the Autonomous Intelligent Systems: Multi-Agents and Data Mining, 2007
2006
Direct Model Checking Matrix Algorithm.
J. Comput. Sci. Technol., 2006
Minimal False Quantified Boolean Formulas.
Proceedings of the Theory and Applications of Satisfiability Testing, 2006
Dependency Quantified Horn Formulas: Models and Complexity.
Proceedings of the Theory and Applications of Satisfiability Testing, 2006
2005
Extension and equivalence problems for clause minimal formulae.
Ann. Math. Artif. Intell., 2005
The complexity of homomorphisms and renamings for minimal unsatisfiable formulas.
Ann. Math. Artif. Intell., 2005
Multi Target Partitioning of Sets Based on Local Information.
Proceedings of the Soft Computing as Transdisciplinary Science and Technology, 2005
Model-Equivalent Reductions.
Proceedings of the Theory and Applications of Satisfiability Testing, 2005
Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas.
Proceedings of the Theory and Applications of Satisfiability Testing, 2005
Towards Online Partitioning of Agent Sets based on Local Information.
Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, 2005
A mutation operator for evolution strategies to handle constrained problems.
Proceedings of the Genetic and Evolutionary Computation Conference, 2005
A new mutation operator for evolution strategies for constrained problems.
Proceedings of the IEEE Congress on Evolutionary Computation, 2005
2004
Equivalence Models for Quantified Boolean Formulas.
Proceedings of the Theory and Applications of Satisfiability Testing, 2004
Equivalence Models for Quantified Boolean Formulas.
Proceedings of the SAT 2004, 2004
On Models for Quantified Boolean Formulas.
Proceedings of the Logic versus Approximation, 2004
2003
On the structure of some classes of minimal unsatisfiable formulas.
Discrete Applied Mathematics, 2003
Read-Once Unit Resolution.
Proceedings of the Theory and Applications of Satisfiability Testing, 2003
On Boolean Models for Quantified Boolean Horn Formulas.
Proceedings of the Theory and Applications of Satisfiability Testing, 2003
2002
Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency.
Inf. Process. Lett., 2002
The Complexity of Read-Once Resolution.
Ann. Math. Artif. Intell., 2002
2001
Satisfiable Formulas Closed Under Replacement.
Electronic Notes in Discrete Mathematics, 2001
2000
On subclasses of minimal unsatisfiable formulas.
Discrete Applied Mathematics, 2000
Complexity Results for Restricted Credulous Default Reasoning.
AI Commun., 2000
1999
Resolution Remains Hard Under Equivalence.
Discrete Applied Mathematics, 1999
1998
An Efficient Algorithm for the Minimal Unsatisfiability Problem for a Subclass of CNF.
Ann. Math. Artif. Intell., 1998
An Upper Bound for Minimal Resolution Refutations.
Proceedings of the Computer Science Logic, 12th International Workshop, 1998
1997
SAT-Problems and Reductions with Respect to the Number of Variables.
J. Log. Comput., 1997
1996
On Resolution with Short Clauses.
Ann. Math. Artif. Intell., 1996
Learning a Representation for Optimizable Formulas.
Proceedings of the Algorithmic Learning Theory, 7th International Workshop, 1996
1995
Resolution for Quantified Boolean Formulas
Inf. Comput., February, 1995
Entwurfsunterstützung in der Hydraulik mit dem System art deco.
KI, 1995
1994
Aussagenlogik - Deduktion und Algorithmen.
Leitfäden und Monographien der Informatik, Teubner, ISBN: 978-3-519-02133-9, 1994
1993
On generalized Horn formulas and k-resolution.
Theor. Comput. Sci., 1993
On the Restricted Equivalence Subclasses of Propositional Logic.
ITA, 1993
1990
Equivalence of Propositional Prolog Programs.
J. Autom. Reasoning, 1990
Existence of Simple Propositional Formulas.
Inf. Process. Lett., 1990
Subclasses of Quantified Boolean Formulas.
Proceedings of the Computer Science Logic, 4th Workshop, 1990
1989
Optimizing Propositional Calculus Formulas with Regard to Questions of Deducibility
Inf. Comput., January, 1989
Projections of Vector Addition System Reachability Sets are Semilinear.
Theor. Comput. Sci., 1989
Inconsistency of Production Systems.
Data Knowl. Eng., 1989
1988
First-Order Formulas in Conjunctive Quantificational Form.
Math. Log. Q., 1988
Optimization Aspects for Propositional Binary Prolog Programs.
Elektronische Informationsverarbeitung und Kybernetik, 1988
Loop Detection in Propositional Prolog Programs.
Proceedings of the CSL '88, 1988
Prolog - Grundlagen und Anwendungen (2. Aufl.).
Leitfäden und Monographien der Informatik, Teubner, ISBN: 978-3-519-12484-9, 1988
1987
Perspektiven für die Logikprogrammierung.
Proceedings of the Wissensrepräsentation in Expertensystemen, 1987
On the Computational Complexity of Quantified Horn Clauses.
Proceedings of the CSL '87, 1987
Representation Independent Query and Update Operations on Propositional Definite Horn Formulas.
Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987
1986
Classes of First Order Formulas Under Various Satisfiability Definitions.
Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 27, 1986
1983
Durch syntaktische Rekursion definierte Klassen.
Math. Log. Q., 1983
A classification of an iterative hierarchy.
Arch. Math. Log., 1983
The early bird problem is unsolvable in a one-dimensional cellular space with 4 states.
Acta Cybern., 1983
Complexity of loop-problems in normed networks.
Proceedings of the Logic and Machines: Decision Problems and Complexity, 1983
1982
Note on the E.
Math. Log. Q., 1982
1981
Some undecidable theories with monadic predicates and without equality.
Arch. Math. Log., 1981
Classes of Functions over Binary Trees.
Proceedings of the Fundamentals of Computation Theory, 1981
1980
The Reachability Problem for Petri Nets and Decision Problems for Skolem Arithmetic.
Theor. Comput. Sci., 1980
The R. E. Complexity of Decision Problems for Commutative Semi-Thue Systems With Recursive Rule Set.
Math. Log. Q., 1980
Decision problems in generalized vector addition systems.
Fundam. Inform., 1980
Universal Asynchronous Iterative Arrays of Mealy Automata.
Acta Inf., 1980
1979
Generalized vector addition systems with finite exception sets.
FCT, 1979
1977
Kleine universelle mehrdimensionale Turingmaschinen.
Elektronische Informationsverarbeitung und Kybernetik, 1977