Norbert Manthey

According to our database, Norbert Manthey authored at least 35 papers between 2010 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2021

The MergeSat Solver.

Norbert Manthey

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

2020

SATPin: Axiom Pinpointing for Lightweight Description Logics Through Incremental SAT.

Norbert Manthey, Rafael Peñaloza, Sebastian Rudolph

Künstliche Intell., 2020

Using model checking tools to triage the severity of security bugs in the Xen hypervisor.

Byron Cook, Björn Döbel, Daniel Kroening, Norbert Manthey, Martin Pohlack, Elizabeth Polgreen, Michael Tautschnig, Pawel Wieczorkiewicz

Proceedings of the 2020 Formal Methods in Computer Aided Design, 2020

Towards Faster Reasoners by Using Transparent Huge Pages.

Johannes Klaus Fichte, Norbert Manthey, Julian Stecklina, André Schidler

Proceedings of the Principles and Practice of Constraint Programming, 2020

2018

Checking Unsatisfiability Proofs in Parallel.

Norbert Manthey, Tobias Philipp

Proceedings of Pragmatics of SAT 2015, 2018

2016

Towards Next Generation Sequential and Parallel SAT Solvers.

Norbert Manthey

Künstliche Intell., 2016

SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers.

Norbert Manthey, Marius Lindauer

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

BEACON: An Efficient SAT-Based Tool for Debugging <i>EL</i>^+ Ontologies.

M. Fareed Arif, Carlos Mencía, Alexey Ignatiev, Norbert Manthey, Rafael Peñaloza, João Marques-Silva

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

Efficient Axiom Pinpointing in EL using SAT Technology.

Norbert Manthey, Rafael Peñaloza, Sebastian Rudolph

Proceedings of the 29th International Workshop on Description Logics, 2016

2015

Towards Next Generation Sequential and Parallel SAT Solvers.

Norbert Manthey

PhD thesis, 2015

Improved answer-set programming encodings for abstract argumentation.

Sarah Alice Gaggl, Norbert Manthey, Alessandro Ronca, Johannes Peter Wallner, Stefan Woltran

Theory Pract. Log. Program., 2015

Recognition of Nested Gates in CNF Formulas.

Markus Iser, Norbert Manthey, Carsten Sinz

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

2014

Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers.

Steffen Hölldobler, Norbert Manthey, Tobias Philipp, Peter Steinke

Proceedings of the Young Scientists' International Workshop on Trends in Information Processing (YSIP) Co-located with the Sixth International Conference on Infocommunicational Technologies in Science, 2014

Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers.

Marijn Heule, Norbert Manthey, Tobias Philipp

Proceedings of the POS-14. Fifth Pragmatics of SAT workshop, 2014

Detecting Cardinality Constraints in CNF.

Armin Biere, Daniel Le Berre, Emmanuel Lonca, Norbert Manthey

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

New CNF Features and Formula Classification.

Enrique Matos Alfonso, Norbert Manthey

Proceedings of the POS-14. Fifth Pragmatics of SAT workshop, 2014

A More Compact Translation of Pseudo-Boolean Constraints into CNF Such That Generalized Arc Consistency Is Maintained.

Norbert Manthey, Tobias Philipp, Peter Steinke

Proceedings of the KI 2014: Advances in Artificial Intelligence, 2014

Formula Simplifications as DRAT Derivations.

Norbert Manthey, Tobias Philipp

Proceedings of the KI 2014: Advances in Artificial Intelligence, 2014

CDCL Solver Additions: Local Look-Ahead, All-Unit-UIP Learning and On-the-Fly Probing.

Norbert Manthey

Proceedings of the KI 2014: Advances in Artificial Intelligence, 2014

Modernes sequentielles und paralleles SAT Solving.

Norbert Manthey

Proceedings of the Ausgezeichnete Informatikdissertationen 2014, 2014

2013

Soundness of Inprocessing in Clause Sharing SAT Solvers.

Norbert Manthey, Tobias Philipp, Christoph Wernhard

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Modern Cooperative Parallel SAT Solving.

Norbert Manthey, Davide Lanti, Ahmed Irfan

Proceedings of the POS-13. Fourth Pragmatics of SAT workshop, 2013

Parallel MUS Extraction.

Anton Belov, Norbert Manthey, João Marques-Silva

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Boosting the Performance of SLS and CDCL Solvers by Preprocessor Tuning.

Adrian Balint, Norbert Manthey

Proceedings of the POS-13. Fourth Pragmatics of SAT workshop, 2013

SAT-Based Analysis and Quantification of Information Flow in Programs.

Vladimir Klebanov, Norbert Manthey, Christian J. Muise

Proceedings of the Quantitative Evaluation of Systems - 10th International Conference, 2013

Sharing Information in Parallel Search with Search Space Partitioning.

Davide Lanti, Norbert Manthey

Proceedings of the Learning and Intelligent Optimization - 7th International Conference, 2013

Parallel Variable Elimination on CNF Formulas.

Kilian Gebhardt, Norbert Manthey

Proceedings of the KI 2013: Advances in Artificial Intelligence, 2013

2012

Coprocessor 2.0 - A Flexible CNF Simplifier - (Tool Presentation).

Norbert Manthey

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Designing Scalable Parallel SAT Solvers.

Antti Eero Johannes Hyvärinen, Norbert Manthey

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

A Compact Encoding of Pseudo-Boolean Constraints into SAT.

Steffen Hölldobler, Norbert Manthey, Peter Steinke

Proceedings of the KI 2012: Advances in Artificial Intelligence, 2012

Solving Periodic Event Scheduling Problems with SAT.

Peter Großmann, Steffen Hölldobler, Norbert Manthey, Karl Nachtigall, Jens Opitz, Peter Steinke

Proceedings of the Advanced Research in Applied Artificial Intelligence, 2012

Automated Reencoding of Boolean Formulas.

Norbert Manthey, Marijn Heule, Armin Biere

Proceedings of the Hardware and Software: Verification and Testing, 2012

2011

Coprocessor - a Standalone SAT Preprocessor.

Norbert Manthey

Proceedings of the Applications of Declarative Programming and Knowledge Management, 2011

2010

Towards Improving the Resource Usage of SAT-solvers.

Norbert Manthey, Ari Saptawijaya

Proceedings of the POS-10. Pragmatics of SAT, Edinburgh, UK, July 10, 2010, 2010

Improving Resource-Unaware SAT Solvers.

Steffen Hölldobler, Norbert Manthey, Ari Saptawijaya

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010