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) 2019 (29) 2020 (37) 2021 (38) 2022 (33) 2023 (32)
Publication types (Num. hits)
inproceedings(759) proceedings(21)
Venues (Conferences, Journals, ...)
SAT(780)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 45 occurrences of 37 keywords

Results
Found 780 publication records. Showing 780 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
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
1Markus N. Rabe A Resolution-Style Proof System for DQBF. 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
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
1Dimitris Achlioptas, Panos Theodoropoulos Probabilistic Model Counting with Short XORs. 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 0001 Improving MCS Enumeration via Caching. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Alexey Ignatiev, António Morgado 0001, João Marques-Silva 0001 On Tackling the Limits of Resolution in 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
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
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
1Jia Hui Liang, Hari Govind V. K., Pascal Poupart, Krzysztof Czarnecki 0001, 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
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
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
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
1Ralf Wimmer 0001, Andreas Karrenbauer, Ruben Becker, Christoph Scholl 0001, Bernd Becker 0001 From DQBF to QBF by Dependency Elimination. Search on Bibsonomy SAT The full citation details ... 2017 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
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
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
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
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
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
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
1Tomás Peitl, Friedrich Slivovsky, Stefan Szeider Dependency Learning for QBF. 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
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
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
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
1Robert Ganian, M. S. Ramanujan 0001, Stefan Szeider Backdoor Treewidth for SAT. Search on Bibsonomy SAT The full citation details ... 2017 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
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
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
1Carlos Mencía, Alexey Ignatiev, Alessandro Previti, João Marques-Silva 0001 MCS Extraction with Sublinear Oracle Queries. 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
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
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
1Valeriy Balabanov, Jie-Hong Roland Jiang, Christoph Scholl 0001, Alan Mishchenko, Robert K. Brayton 2QBF: Challenges and Solutions. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ralf Wimmer 0001, Christoph Scholl 0001, Karina Wimmer, Bernd Becker 0001 Dependency Schemes for DQBF. 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
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
1M. Fareed Arif, Carlos Mencía, Alexey Ignatiev, Norbert Manthey, Rafael Peñaloza, João Marques-Silva 0001 BEACON: An Efficient SAT-Based Tool for Debugging EL^+ Ontologies. 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
1Uwe Egly On Stronger Calculi for QBFs. 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
1Florian Lonsing, Uwe Egly, Martina Seidl Q-Resolution with Generalized Axioms. 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
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
1Jia Hui Liang, Vijay Ganesh, Pascal Poupart, Krzysztof Czarnecki 0001 Learning Rate Based Branching Heuristic for SAT Solvers. 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
1Leander Tentrup Non-prenex QBF Solving Using Abstraction. 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
1Mikolás Janota On Q-Resolution and CDCL QBF Solving. 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
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
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
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
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
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
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
1Markus N. Rabe, Sanjit A. Seshia Incremental Determinization. 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
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
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
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
1Ralf Wimmer 0001, Karina Gitina, Jennifer Nist, Christoph Scholl 0001, Bernd Becker 0001 Preprocessing for DQBF. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Carlos Ansótegui, Jesús Giráldez-Cru, Jordi Levy, Laurent Simon Using Community Structure to Detect Relevant Learnt Clauses. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Florian Lonsing, Uwe Egly Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Stefan Falkner, Marius Lindauer, Frank Hutter SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Ruiwen Chen, Rahul Santhanam Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Jan Burchard, Tobias Schubert 0001, Bernd Becker 0001 Laissez-Faire Caching for Parallel #SAT Solving. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Ravi Mangal, Xin Zhang 0035, Aditya V. Nori, Mayur Naik Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Miguel Neves 0001, Ruben Martins, Mikolás Janota, Inês Lynce, Vasco M. Manquinho Exploiting Resolution-Based Representations for MaxSAT Solving. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Shaowei Cai 0001, Chuan Luo 0002, Kaile Su CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Armin Biere, Andreas Fröhlich Evaluating CDCL Variable Scoring Schemes. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Carlos Mencía, Alessandro Previti, João Marques-Silva 0001 SAT-Based Horn Least Upper Bounds. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Alexey Ignatiev, Alessandro Previti, João Marques-Silva 0001 SAT-Based Formula Simplification. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1M. Fareed Arif, Carlos Mencía, João Marques-Silva 0001 Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing. Search on Bibsonomy SAT The full citation details ... 2015 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
1Marijn Heule, Sean A. Weaver (eds.) Theory and Applications of Satisfiability Testing - SAT 2015 - 18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky On Compiling CNFs into Structured Deterministic DNNFs. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Markus Iser, Norbert Manthey, Carsten Sinz Recognition of Nested Gates in CNF Formulas. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Rehan Abdul Aziz, Geoffrey Chu, Christian J. Muise, Peter J. Stuckey #∃SAT: Projected Model Counting. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Stefan Szeider Community Structure Inspired Algorithms for SAT and #SAT. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Tobias Philipp, Peter Steinke PBLib - A Library for Encoding Pseudo-Boolean Constraints into CNF. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Chanseok Oh Between SAT and UNSAT: The Fundamental Difference in CDCL SAT. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Valeriy Balabanov, Alexander Ivrii Speeding up MUS Extraction with Preprocessing and Chunking. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Oliver Kullmann, João Marques-Silva 0001 Computing Maximal Autarkies with Few and Simple Oracle Queries. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Kuan-Hua Tu, Tzu-Chien Hsu, Jie-Hong R. Jiang QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Alexander Ivrii, Vadim Ryvchin, Ofer Strichman Mining Backbone Literals in Incremental SAT - A New Kind of Incremental Data. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Florian Corzilius, Gereon Kremer, Sebastian Junges, Stefan Schupp, Erika Ábrahám SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Zack Newsham, William Lindsay, Vijay Ganesh, Jia Hui Liang, Sebastian Fischmeister, Krzysztof Czarnecki 0001 SATGraf: Visualizing the Evolution of SAT Formula Structure in Solvers. 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
1Adam Douglass, Andrew D. King, Jack Raymond Constructing SAT Filters with a Quantum Annealer. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Florent Capelli, Arnaud Durand 0001, Stefan Mengel Hypergraph Acyclicity and Propositional Model Counting. Search on Bibsonomy SAT The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Yoav Fekete, Michael Codish Simplifying Pseudo-Boolean Constraints in Residual Number Systems. Search on Bibsonomy SAT The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Fahiem Bacchus, Nina Narodytska Cores in Core Based MaxSat Algorithms: An Analysis. Search on Bibsonomy SAT The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Armin Biere, Daniel Le Berre, Emmanuel Lonca, Norbert Manthey Detecting Cardinality Constraints in CNF. Search on Bibsonomy SAT The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
Displaying result #201 - #300 of 780 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license