E-LIB Suche - Ergebnisse für: Kleine Büning, Hans

1

Classes of propositional UMU formulas and their extensions ..:

Kleine Büning, Hans
Theoretical Computer Science. 998 (2024) - p. 114538 , 2024

2

NAE-resolution: A new resolution refutation technique to pr..:

Kleine Büning, Hans ; Wojciechowski, P. ; Subramani, K.
Mathematical Structures in Computer Science. 30 (2020) 7 - p. 736-751 , 2020

Link: https://doi.org/10.1017/..

3

Read-Once Resolutions in Horn Formulas:

, In: Frontiers in Algorithmics; Lecture Notes in Computer Science,

Kleine Büning, Hans ; Wojciechowski, P. ; Subramani, K. - p. 100-110 , 2019

Link: https://doi.org/10.1007/..

4

Restricted Cutting Plane Proofs in Horn Constraint Systems:

, In: Frontiers of Combining Systems; Lecture Notes in Computer Science,

Kleine Büning, Hans ; Wojciechowski, Piotr ; Chandrasekaran, R.. - p. 149-164 , 2019

Link: https://doi.org/10.1007/..

5

Learning and coordination in sequential multiagent problems:

Kemmerich, Thomas , 2012

Link: http://nbn-resolving.de/..

6

Encoding Nested Boolean Functions as Quantified Boolean For..:

Bubeck, Uwe ; Kleine Büning, Hans
Journal on Satisfiability, Boolean Modeling and Computation. 8 (2012) 1-2 - p. 101-116 , 2012

Link: https://doi.org/10.3233/..

7

A new 3-CNF transformation by parallel-serial graphs:

Bubeck, Uwe ; Kleine Büning, Hans
Information Processing Letters. 109 (2009) 7 - p. 376-379 , 2009

Link: https://doi.org/10.1016/..

8

Theory and applications of satisfiability testing - SAT 200

11th international conference, SAT 2008, Guangzhou, China, ... Lecture notes in computer science ; 4996

Kleine Büning, Hans ; Zhao, Xishun , 2008

Link: http://dx.doi.org/10.100..

9

Computational complexity of quantified Boolean formulas wit..:

Kleine Büning, Hans ; Zhao, Xishun
Theoretical Computer Science. 407 (2008) 1-3 - p. 448-457 , 2008

Link: https://doi.org/10.1016/..

10

Models and quantifier elimination for quantified Horn formu..:

Bubeck, Uwe ; Kleine Büning, Hans
Discrete Applied Mathematics. 156 (2008) 10 - p. 1606-1622 , 2008

Link: https://doi.org/10.1016/..

11

The Complexity of Some Subclasses of Minimal Unsatisfiable ..:

Kleine Büning, Hans ; Zhao, Xishun
Journal on Satisfiability, Boolean Modeling and Computation. 3 (2007) 1-2 - p. 1-17 , 2007

Link: https://doi.org/10.3233/..

12

Boolean Functions as Models for Quantified Boolean Formulas:

Kleine Büning, Hans ; Subramani, K. ; Zhao, Xishun
Journal of Automated Reasoning. 39 (2007) 1 - p. 49-75 , 2007

Link: https://doi.org/10.1007/..

13

An Extension of Deficiency and Minimal Unsatisfiability of ..:

Kleine Büning, Hans ; Zhao, Xishun
Journal on Satisfiability, Boolean Modeling and Computation. 3 (2007) 3-4 - p. 115-123 , 2007

Link: https://doi.org/10.3233/..

14

Extension and equivalence problems for clause minimal formu..:

Kleine Büning, Hans ; Zhao, Xishun
Annals of Mathematics and Artificial Intelligence. 43 (2004) 1-4 - p. 295-306 , 2004

Link: https://doi.org/10.1007/..

15

On the structure of some classes of minimal unsatisfiable f..:

Kleine Büning, Hans ; Zhao, Xishun
Discrete Applied Mathematics. 130 (2003) 2 - p. 185-207 , 2003

Link: https://doi.org/10.1016/..