Volgen
Norbert Manthey
Norbert Manthey
TU Dresden
Geverifieerd e-mailadres voor tu-dresden.de
Titel
Geciteerd door
Geciteerd door
Jaar
Automated reencoding of boolean formulas
N Manthey, MJH Heule, A Biere
Haifa Verification Conference, 102-117, 2012
1012012
Coprocessor 2.0–A Flexible CNF Simplifier: (Tool Presentation)
N Manthey
Theory and Applications of Satisfiability Testing–SAT 2012: 15th …, 2012
872012
Solving periodic event scheduling problems with SAT
P Großmann, S Hölldobler, N Manthey, K Nachtigall, J Opitz, P Steinke
Advanced Research in Applied Artificial Intelligence: 25th International …, 2012
852012
SAT-based analysis and quantification of information flow in programs
V Klebanov, N Manthey, C Muise
International Conference on Quantitative Evaluation of Systems, 177-192, 2013
802013
Detecting cardinality constraints in CNF
A Biere, D Le Berre, E Lonca, N Manthey
International Conference on Theory and Applications of Satisfiability …, 2014
582014
Improved answer-set programming encodings for abstract argumentation
SA Gaggl, N Manthey, A Ronca, JP Wallner, S Woltran
Theory and Practice of Logic Programming 15 (4-5), 434-448, 2015
522015
A short overview on modern parallel SAT-solvers
S Hölldobler, N Manthey, J Stecklina, P Steinke
2011 International Conference on Advanced Computer Science and Information …, 2011
422011
BEACON: an efficient SAT-based tool for debugging ontologies
MF Arif, C Mencía, A Ignatiev, N Manthey, R Peñaloza, J Marques-Silva
International Conference on Theory and Applications of Satisfiability …, 2016
412016
A compact encoding of pseudo-Boolean constraints into SAT
S Hölldobler, N Manthey, P Steinke
Annual Conference on Artificial Intelligence, 107-118, 2012
412012
Improving resource-unaware SAT solvers
S Hölldobler, N Manthey, A Saptawijaya
Logic for Programming, Artificial Intelligence, and Reasoning: 17th …, 2010
412010
Designing scalable parallel SAT solvers
AEJ Hyvärinen, N Manthey
International Conference on Theory and Applications of Satisfiability …, 2012
302012
A more compact translation of pseudo-Boolean constraints into CNF such that generalized arc consistency is maintained
N Manthey, T Philipp, P Steinke
Joint German/Austrian Conference on Artificial Intelligence (Künstliche …, 2014
292014
Soundness of inprocessing in clause sharing SAT solvers
N Manthey, T Philipp, C Wernhard
International Conference on Theory and Applications of Satisfiability …, 2013
242013
Sharing information in parallel search with search space partitioning
D Lanti, N Manthey
Learning and Intelligent Optimization: 7th International Conference, LION 7 …, 2013
222013
Efficient axiom pinpointing in EL using SAT technology
N Manthey, R Penaloza, S Rudolph
CEUR WORKSHOP PROCEEDINGS 1577, 2016
212016
Boosting the Performance of SLS and CDCL Solvers by Preprocessor Tuning.
A Balint, N Manthey
POS@ SAT, 1-14, 2013
202013
Riss 4.27
N Manthey
Proceedings of SAT Competition 2014, 2014
192014
SparrowToRiss
A Balint, N Manthey
Proceedings of SAT Competition, 77, 2014
182014
Parallel SAT solving-using more cores
N Manthey
Pragmatics of SAT (POS’11), 2011
182011
Towards next generation sequential and parallel SAT solvers
N Manthey
KI-Künstliche Intelligenz 30 (3-4), 339-342, 2016
172016
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20