The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "SAT"( http://dblp.L3S.de/Venues/SAT )

URL (DBLP): http://dblp.uni-trier.de/db/conf/sat

Publication years (Num. hits)
2003 (38) 2004 (50) 2005 (43) 2006 (40) 2007 (37) 2008 (28) 2009 (48) 2010 (38) 2011 (38) 2012 (55) 2013 (35) 2014 (34) 2015 (31) 2016 (37) 2017 (31) 2018 (28)
Publication types (Num. hits)
inproceedings(595) proceedings(16)
Venues (Conferences, Journals, ...)
SAT(611)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 45 occurrences of 37 keywords

Results
Found 611 publication records. Showing 611 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Svyatoslav Korneev, Nina Narodytska, Luca Pulina, Armando Tacchella, Nikolaj Bjørner, Mooly Sagiv Constrained Image Generation Using Binarized Neural Networks with Decision Procedures. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Rüdiger Ehlers, Francisco Palau Romero Approximately Propagation Complete and Conflict Propagating Constraint Encodings. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran Exploiting Treewidth for Projected Model Counting and Its Limits. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Marc Vinyals, Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jia Hui Liang, Chanseok Oh, Minu Mathew, Ciza Thomas, Chunxiao Li, Vijay Ganesh Machine Learning-Based Restart Policy for CDCL SAT Solvers. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Shubhani Gupta, Aseem Saxena, Anmol Mahajan, Sorav Bansal Effective Use of SMT Solvers for Program Equivalence Checking Through Invariant-Sketching and Query-Decomposition. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alexander Nadel Solving MaxSAT with Bit-Vector Optimization. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sima Jamali, David Mitchell Centrality-Based Improvements to CDCL Heuristics. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Hoda Abbasizanjani, Oliver Kullmann Minimal Unsatisfiability and Minimal Strongly Connected Digraphs. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Martin Suda 0001, Bernhard Gleiss Local Soundness for QBF Calculi. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michael Lampis, Stefan Mengel, Valia Mitsou QBF as an Alternative to Courcelle's Theorem. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alessandro Cimatti, Alberto Griggio, Ahmed Irfan, Marco Roveri, Roberto Sebastiani Experimenting on Solving Nonlinear Integer Arithmetic with Incremental Linearization. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Manuel Kauers, Martina Seidl Symmetries of Quantified Boolean Formulas. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jan Elffers, Jesús Giráldez-Cru, Jakob Nordström, Marc Vinyals Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sean A. Weaver, Hannah J. Roberts, Michael J. Smith 0012 XOR-Satisfiability Set Membership Filters. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Christoph M. Wintersteiger (eds.) Theory and Applications of Satisfiability Testing - SAT 2018 - 21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alexander Nadel, Vadim Ryvchin Chronological Backtracking. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Ralf Rothenberger Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Nicola Galesi, Navid Talebanfard, Jacobo Torán Cops-Robber Games and the Resolution of Tseitin Formulas. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Zayd S. Hammoudeh, Panos Theodoropoulos Fast Sampling of Perfectly Uniform Satisfying Assignments. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Stepan Kochemazov, Oleg Zaikin 0002 ALIAS: A Modular Tool for Finding Backdoors for SAT. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ryan Berryhill, Alexander Ivrii, Andreas G. Veneris Finding All Minimal Safe Inductive Sets. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tomás Peitl, Friedrich Slivovsky, Stefan Szeider Polynomial-Time Validation of QCDCL Certificates. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tobias Paxian, Sven Reimer, Bernd Becker 0001 Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSAT. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mikolás Janota Circuit-Based Search Space Pruning in QBF. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Zayd Hammoudeh, Panos Theodoropoulos Fast and Flexible Probabilistic Model Counting. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alexey Ignatiev, António Morgado, João Marques-Silva PySAT: A Python Toolkit for Prototyping with SAT Oracles. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Christoph Scholl, Ralf Wimmer Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications - Extended Abstract. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Joshua Blinkhorn, Olaf Beyersdorff Shortening QBF Proofs with Dependency Schemes. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Miguel Terra-Neves, Inês Lynce, Vasco M. Manquinho Introducing Pareto Minimal Correction Subsets. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Massimo Lauria, Jan Elffers, Jakob Nordström, Marc Vinyals CNFgen: A Generator of Crafted Benchmarks. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Hidetomo Nabeshima, Katsumi Inoue Coverage-Based Clause Reduction Heuristics for CDCL Solvers. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Alexey Ignatiev, António Morgado, João Marques-Silva On Tackling the Limits of Resolution in SAT Solving. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Johannes Klaus Fichte, Neha Lodha, Stefan Szeider SAT-Based Local Improvement for Finding Tree Decompositions of Small Width. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Neha Lodha, Sebastian Ordyniak, Stefan Szeider SAT-Encodings for Special Treewidth and Pathwidth. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Benjamin Kiesl, Marijn J. H. Heule, Martina Seidl A Little Blocked Literal Goes a Long Way. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Jo Devriendt, Bart Bogaerts 0001, Maurice Bruynooghe Symmetric Explanation Learning: Effective Dynamic Symmetry Handling for SAT. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Saeed Nejati, Zack Newsham, Joseph Scott, Jia Hui Liang, Catherine H. Gebotys, Pascal Poupart, Vijay Ganesh A Propagation Rate Based Splitting Heuristic for Divide-and-Conquer Solvers. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Alessandro Previti, Carlos Mencía, Matti Järvisalo, João Marques-Silva Improving MCS Enumeration via Caching. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Gilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sébastien Tabary A Distributed Version of Syrup. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Robert Ganian, M. S. Ramanujan, Stefan Szeider Backdoor Treewidth for SAT. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Jia Hui Liang, Hari Govind V. K., Pascal Poupart, Krzysztof Czarnecki, Vijay Ganesh An Empirical Study of Branching Heuristics Through the Lens of Global Learning Rate. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dmitry Itsykson, Alexander Knop Hard Satisfiable Formulas for Splittings by Linear Combinations. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Ralf Wimmer, Andreas Karrenbauer, Ruben Becker, Christoph Scholl, Bernd Becker 0001 From DQBF to QBF by Dependency Elimination. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Tommi A. Junttila, Matti Karppa, Petteri Kaski, Jukka Kohonen An Adaptive Prefix-Assignment Technique for Symmetry Reduction. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Tuukka Korhonen, Jeremias Berg, Paul Saikko, Matti Järvisalo MaxPre: An Extended MaxSAT Preprocessor. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Petr Kucera, Petr Savický, Vojtech Vorel A Lower Bound on CNF Encodings of the At-Most-One Constraint. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Ludovic Le Frioux, Souheib Baarir, Julien Sopena, Fabrice Kordon PaInleSS: A Framework for Parallel SAT Solving. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Stefan Szeider New Width Parameters for Model Counting. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Panos Theodoropoulos Probabilistic Model Counting with Short XORs. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Tomás Peitl, Friedrich Slivovsky, Stefan Szeider Dependency Learning for QBF. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Eldan Cohen, Guoyu Huang, J. Christopher Beck (I Can Get) Satisfaction: Preference-Based Scheduling for Concert-Goers at Multi-venue Music Festivals. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Bishoksan Kafle, Graeme Gange, Peter Schachte, Harald Søndergaard, Peter J. Stuckey A Benders Decomposition Approach to Deciding Modular Linear Integer Arithmetic. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Martin Jonás, Jan Strejcek On Simplification of Formulas with Unconstrained Variables and Quantifiers. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Antti E. J. Hyvärinen, Sepideh Asadi, Karine Even-Mendoza, Grigory Fedyukovich, Hana Chockler, Natasha Sharygina Theory Refinement for Program Verification. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Toby Walsh (eds.) Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Guillaume Baud-Berthier, Jesús Giráldez-Cru, Laurent Simon On the Community Structure of Bounded Model Checking SAT Problems. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Markus N. Rabe A Resolution-Style Proof System for DQBF. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Peter Lammich The GRAT Tool Chain - Efficient (UN)SAT Certificate Checking with Formal Correctness Guarantees. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Norbert Manthey, Marius Lindauer SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Uwe Egly On Stronger Calculi for QBFs. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Florian Lonsing, Uwe Egly, Martina Seidl Q-Resolution with Generalized Axioms. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Zurab Khasidashvili, Konstantin Korovin Predicate Elimination for Preprocessing in First-Order Theorem Proving. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Stefan Mengel Parameterized Compilation Lower Bounds for Restricted CNF-Formulas. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Mathias Soeken, Alan Mishchenko, Ana Petkovska, Baruch Sterin, Paolo Ienne, Robert K. Brayton, Giovanni De Micheli Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Daniel Berend, Yochai Twitto The Normalized Autocorrelation Length of Random Max r -Sat Converges in Probability to (1-1/2^r)/r. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Aleksandar Zeljic, Christoph M. Wintersteiger, Philipp Rümmer Deciding Bit-Vector Formulas with mcSAT. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Giles Reger, Martin Suda 0001, Andrei Voronkov Finding Finite Models in Multi-sorted First-Order Logic. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Patrick Scharpfenecker, Jacobo Torán Solution-Graphs of Boolean Formulas and Isomorphism. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Jan Elffers, Jan Johannsen, Massimo Lauria, Thomas Magnard, Jakob Nordström, Marc Vinyals Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Jia Hui Liang, Vijay Ganesh, Pascal Poupart, Krzysztof Czarnecki Learning Rate Based Branching Heuristic for SAT Solvers. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Marijn J. H. Heule, Oliver Kullmann, Victor W. Marek Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Markus N. Rabe, Sanjit A. Seshia Incremental Determinization. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Carlos Mencía, Alexey Ignatiev, Alessandro Previti, João Marques-Silva MCS Extraction with Sublinear Oracle Queries. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Leander Tentrup Non-prenex QBF Solving Using Abstraction. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Johannes Klaus Fichte, Arne Meier, Irina Schindler Strong Backdoors for Default Logic. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Tomás Balyo, Florian Lonsing HordeQBF: A Modular and Massively Parallel QBF Solver. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Valeriy Balabanov, Jie-Hong Roland Jiang, Christoph Scholl, Alan Mishchenko, Robert K. Brayton 2QBF: Challenges and Solutions. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Jo Devriendt, Bart Bogaerts 0001, Maurice Bruynooghe, Marc Denecker Improved Static Symmetry Breaking for SAT. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Tomás Peitl, Friedrich Slivovsky, Stefan Szeider Long Distance Q-Resolution with Dependency Schemes. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Gilles Audemard, Laurent Simon Extreme Cases in SAT Problems. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Mateus de Oliveira Oliveira Satisfiability via Smooth Pictures. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Daniel Le Berre (eds.) Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Mikolás Janota On Q-Resolution and CDCL QBF Solving. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Vsevolod Oparin Tight Upper Bound on Splitting by Linear Combinations for Pigeonhole Principle. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1M. Fareed Arif, Carlos Mencía, Alexey Ignatiev, Norbert Manthey, Rafael Peñaloza, João Marques-Silva BEACON: An Efficient SAT-Based Tool for Debugging EL^+ Ontologies. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1C. K. Cuong, M. J. H. Heule Computing Maximum Unavoidable Subgraphs Using SAT Solvers. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Lorenzo Candeago, Daniel Larraz, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio Speeding up the Constraint-Based Method in Difference Logic. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Leroy Chew, Renate A. Schmidt, Martin Suda 0001 Lifting QBF Resolution Calculi to DQBF. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Antti E. J. Hyvärinen, Matteo Marescotti, Leonardo Alt, Natasha Sharygina OpenSMT2: An SMT Solver for Multi-core and Cloud Computing. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ralf Wimmer, Christoph Scholl, Karina Wimmer, Bernd Becker 0001 Dependency Schemes for DQBF. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Nathan Mull, Daniel J. Fremont, Sanjit A. Seshia On the Hardness of SAT with Community Structure. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Paul Saikko, Jeremias Berg, Matti Järvisalo LMHS: A SAT-IP Hybrid MaxSAT Solver. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Neha Lodha, Sebastian Ordyniak, Stefan Szeider A SAT Approach to Branchwidth. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Jeevana Priya Inala, Rohit Singh 0002, Armando Solar-Lezama Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Martin Jonás, Jan Strejcek Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Christian Zielke, Michael Kaufmann 0001 A New Approach to Partial MUS Enumeration. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Antti E. J. Hyvärinen, Matteo Marescotti, Natasha Sharygina Search-Space Partitioning for Parallelizing SMT Solvers. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Jonathan Kalechstain, Vadim Ryvchin, Nachum Dershowitz Hints Revealed. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Tomás Balyo, Peter Sanders 0001, Carsten Sinz HordeSat: A Massively Parallel Portfolio SAT Solver. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 611 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license