Valentin Mayer-Eichberger
Valentin Mayer-Eichberger
Technische Universität Berlin
Verified email at
Cited by
Cited by
A new look at BDDs for pseudo-Boolean constraints
I Abío, R Nieuwenhuis, A Oliveras, E Rodríguez-Carbonell, ...
Journal of Artificial Intelligence Research 45, 443-480, 2012
On CNF encodings of decision diagrams
I Abío, G Gange, V Mayer-Eichberger, PJ Stuckey
International Conference on AI and OR Techniques in Constraint Programming …, 2016
Encoding linear constraints with implication chains to CNF
I Abío, V Mayer-Eichberger, PJ Stuckey
International Conference on Principles and Practice of Constraint …, 2015
Extracting propositional rules from feed-forward neural networks-a new decompositional approach
S Bader, S Hölldobler, V Mayer-Eichberger
NeSy, 2007
SAT and hybrid models of the car sequencing problem
C Artigues, E Hebrard, V Mayer-Eichberger, M Siala, T Walsh
International Conference on Integration of Constraint Programming …, 2014
Towards solving a system of pseudo boolean constraints with binary decision diagrams
V Mayer-Eichberger
Master's thesis, New University of Lisbon, 2008
Positional Games and QBF: The Corrective Encoding
V Mayer-Eichberger, A Saffidine
International Conference on Theory and Applications of Satisfiability …, 2020
There’s more than one way to solve a long-haul transportation problem
P Kilby, I Abio, D Guimarans, D Harabor, P Haslum, V Mayer-Eichberger, ...
Vehicle Routing and Logistics (VeRoLog).(Abstract.), 2015
SAT Encodings for the Car Sequencing Problem.
V Mayer-Eichberger, T Walsh
POS@ SAT, 15-27, 2013
Modelling Satisfiability Problems: Theory and Practice.
V Mayer-Eichberger
IJCAI, 4012-4013, 2016
Just-in-time hierarchical constraint decomposition
V Mayer-Eichberger
Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015
A Hard Satisfiable Problem with 160 Variables
V Mayer-Eichberger
Proceedings of SAT Competition 2013: Solver and Benchmark Descriptions, 113, 2013
SAT Benchmark for the Car Sequencing Problem
V Mayer-Eichberger
Proceedings of SAT Competition 2013: Solver and Benchmark Descriptions, 114, 2013
Extracting Propositional Logic Programs From Neural Networks: A Decompositional Approach
V Mayer-Eichberger, MSS Bader
CP Doctoral Program 2013
A Balafrej, S Brockbank, C Cornelio, C Dejemeppe, E Delisle, A Derrien, ...
The system can't perform the operation now. Try again later.
Articles 1–15