default search action
Norbert Manthey
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c31]Norbert Manthey:
The MergeSat Solver. SAT 2021: 387-398 - 2020
- [j4]Norbert Manthey, Rafael Peñaloza
, Sebastian Rudolph
SATPin: Axiom Pinpointing for Lightweight Description Logics Through Incremental SAT. Künstliche Intell. 34(3): 389-394 (2020) - [c30]Johannes Klaus Fichte
Towards Faster Reasoners by Using Transparent Huge Pages. CP 2020: 304-322 - [c29]Byron Cook, Björn Döbel, Daniel Kroening, Norbert Manthey, Martin Pohlack, Elizabeth Polgreen, Michael Tautschnig, Pawel Wieczorkiewicz:
Using model checking tools to triage the severity of security bugs in the Xen hypervisor. FMCAD 2020: 185-193 - [i3]Johannes Klaus Fichte, Norbert Manthey, Julian Stecklina, André Schidler
Towards Faster Reasoners By Using Transparent Huge Pages. CoRR abs/2004.14378 (2020)
2010 – 2019
- 2018
- [c28]Norbert Manthey, Tobias Philipp:
Checking Unsatisfiability Proofs in Parallel. POS@SAT 2018: 34-49 - 2016
- [j3]Norbert Manthey:
Towards Next Generation Sequential and Parallel SAT Solvers. Künstliche Intell. 30(3-4): 339-342 (2016) - [c27]Norbert Manthey, Rafael Peñaloza, Sebastian Rudolph:
Efficient Axiom Pinpointing in EL using SAT Technology. Description Logics 2016 - [c26]M. Fareed Arif, Carlos Mencía
BEACON: An Efficient SAT-Based Tool for Debugging EL^+ Ontologies. SAT 2016: 521-530 - [c25]Norbert Manthey, Marius Lindauer:
SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers. SAT 2016: 554-561 - 2015
- [b1]Norbert Manthey:
Towards Next Generation Sequential and Parallel SAT Solvers. Dresden University of Technology, 2015 - [j2]Norbert Manthey:
Towards next generation sequential and parallel SAT solvers. Constraints An Int. J. 20(4): 504-505 (2015) - [j1]Sarah Alice Gaggl, Norbert Manthey, Alessandro Ronca
Improved answer-set programming encodings for abstract argumentation. Theory Pract. Log. Program. 15(4-5): 434-448 (2015) - [c24]Markus Iser, Norbert Manthey, Carsten Sinz:
Recognition of Nested Gates in CNF Formulas. SAT 2015: 255-271 - [i2]Sarah Alice Gaggl, Norbert Manthey, Alessandro Ronca, Johannes Peter Wallner, Stefan Woltran:
Improved Answer-Set Programming Encodings for Abstract Argumentation. CoRR abs/1507.06689 (2015) - 2014
- [c23]Norbert Manthey:
CDCL Solver Additions: Local Look-Ahead, All-Unit-UIP Learning and On-the-Fly Probing. KI 2014: 98-110 - [c22]Norbert Manthey, Tobias Philipp:
Formula Simplifications as DRAT Derivations. KI 2014: 111-122 - [c21]Norbert Manthey, Tobias Philipp, Peter Steinke:
A More Compact Translation of Pseudo-Boolean Constraints into CNF Such That Generalized Arc Consistency Is Maintained. KI 2014: 123-134 - [c20]Marijn Heule, Norbert Manthey, Tobias Philipp:
Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers. POS@SAT 2014: 12-25 - [c19]Enrique Matos Alfonso, Norbert Manthey:
New CNF Features and Formula Classification. POS@SAT 2014: 57-71 - [c18]Steffen Hölldobler, Norbert Manthey, Tobias Philipp, Peter Steinke:
Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers. POS@SAT 2014: 89-102 - [c17]Armin Biere
Detecting Cardinality Constraints in CNF. SAT 2014: 285-301 - [c16]Steffen Hölldobler, Norbert Manthey, Tobias Philipp, Peter Steinke:
Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers. YSIP 2014: 25-34 - [p1]Norbert Manthey:
Modernes sequentielles und paralleles SAT Solving. Ausgezeichnete Informatikdissertationen 2014: 181-190 - 2013
- [c15]Kilian Gebhardt, Norbert Manthey:
Parallel Variable Elimination on CNF Formulas. KI 2013: 61-73 - [c14]Davide Lanti
Sharing Information in Parallel Search with Search Space Partitioning. LION 2013: 52-58 - [c13]Vladimir Klebanov, Norbert Manthey, Christian J. Muise:
SAT-Based Analysis and Quantification of Information Flow in Programs. QEST 2013: 177-192 - [c12]Adrian Balint, Norbert Manthey:
Boosting the Performance of SLS and CDCL Solvers by Preprocessor Tuning. POS@SAT 2013: 1-14 - [c11]Norbert Manthey, Tobias Philipp, Christoph Wernhard:
Soundness of Inprocessing in Clause Sharing SAT Solvers. SAT 2013: 22-39 - [c10]Norbert Manthey, Davide Lanti, Ahmed Irfan
Modern Cooperative Parallel SAT Solving. POS@SAT 2013: 41-54 - [c9]Anton Belov, Norbert Manthey, João Marques-Silva
Parallel MUS Extraction. SAT 2013: 133-149 - 2012
- [c8]Norbert Manthey, Marijn Heule
Automated Reencoding of Boolean Formulas. Haifa Verification Conference 2012: 102-117 - [c7]Peter Großmann, Steffen Hölldobler, Norbert Manthey, Karl Nachtigall, Jens Opitz, Peter Steinke:
Solving Periodic Event Scheduling Problems with SAT. IEA/AIE 2012: 166-175 - [c6]Steffen Hölldobler, Norbert Manthey, Peter Steinke:
A Compact Encoding of Pseudo-Boolean Constraints into SAT. KI 2012: 107-118 - [c5]Antti Eero Johannes Hyvärinen, Norbert Manthey:
Designing Scalable Parallel SAT Solvers. SAT 2012: 214-227 - [c4]Norbert Manthey:
Coprocessor 2.0 - A Flexible CNF Simplifier - (Tool Presentation). SAT 2012: 436-441 - 2011
- [c3]Norbert Manthey:
Coprocessor - a Standalone SAT Preprocessor. INAP/WLP 2011: 297-304 - [i1]Norbert Manthey:
Coprocessor - a Standalone SAT Preprocessor. CoRR abs/1108.6208 (2011) - 2010
- [c2]Steffen Hölldobler, Norbert Manthey, Ari Saptawijaya:
Improving Resource-Unaware SAT Solvers. LPAR (Yogyakarta) 2010: 519-534 - [c1]Norbert Manthey, Ari Saptawijaya:
Towards Improving the Resource Usage of SAT-solvers. POS@SAT 2010: 28-40
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: