Search results for "SAT"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Adrian Balint, Armin Biere, Andreas Fröhlich, Uwe Schöning	Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses.	SAT	2014	DBLP DOI BibTeX RDF
1	Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle	Solving MaxSAT and #SAT on Structured CNF Formulas.	SAT	2014	DBLP DOI BibTeX RDF
1	Matti Järvisalo, Janne H. Korhonen	Conditional Lower Bounds for Failed Literals and Related Techniques.	SAT	2014	DBLP DOI BibTeX RDF
1	Friedrich Slivovsky, Stefan Szeider	Variable Dependencies and Q-Resolution.	SAT	2014	DBLP DOI BibTeX RDF
1	Alexey Ignatiev, António Morgado 0001, João Marques-Silva 0001	On Reducing Maximum Independent Set to Minimum Satisfiability.	SAT	2014	DBLP DOI BibTeX RDF
1	Charles Jordan, Lukasz Kaiser, Florian Lonsing, Martina Seidl	MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing.	SAT	2014	DBLP DOI BibTeX RDF
1	Gabriel Istrate, Adrian Craciun	Proof Complexity and the Kneser-Lovász Theorem.	SAT	2014	DBLP DOI BibTeX RDF
1	Bernd Finkbeiner, Leander Tentrup	Fast DQBF Refutation.	SAT	2014	DBLP DOI BibTeX RDF
1	Boris Konev, Alexei Lisitsa 0001	A SAT Attack on the Erdős Discrepancy Conjecture.	SAT	2014	DBLP DOI BibTeX RDF
1	Mladen Miksa, Jakob Nordström	Long Proofs of (Seemingly) Simple Formulas.	SAT	2014	DBLP DOI BibTeX RDF
1	Carles Creus, Pau Fernández, Guillem Godoy	Automatic Evaluation of Reductions between NP-Complete Problems.	SAT	2014	DBLP DOI BibTeX RDF
1	João Marques-Silva 0001, Alessandro Previti	On Computing Preferred MUSes and MCSes.	SAT	2014	DBLP DOI BibTeX RDF
1	Nathan Wetzler, Marijn Heule, Warren A. Hunt Jr.	DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs.	SAT	2014	DBLP DOI BibTeX RDF
1	Tomás Balyo, Andreas Fröhlich, Marijn Heule, Armin Biere	Everything You Always Wanted to Know about Blocked Sets (But Were Afraid to Ask).	SAT	2014	DBLP DOI BibTeX RDF
1	Jakob Nordström	A (Biased) Proof Complexity Survey for SAT Practitioners.	SAT	2014	DBLP DOI BibTeX RDF
1	Tamir Heyman, Dan Smith, Yogesh Mahajan, Lance Leong, Husam Abu-Haimed	Dominant Controllability Check Using QBF-Solver and Netlist Optimizer.	SAT	2014	DBLP DOI BibTeX RDF
1	Carsten Sinz, Uwe Egly (eds.)	Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings	SAT	2014	DBLP DOI BibTeX RDF
1	Andrei A. Bulatov, Cong Wang 0002	Approximating Highly Satisfiable Random 2-SAT.	SAT	2014	DBLP DOI BibTeX RDF
1	Valeriy Balabanov, Magdalena Widl, Jie-Hong R. Jiang	QBF Resolution Systems and Their Proof Complexities.	SAT	2014	DBLP DOI BibTeX RDF
1	Anton Belov, Marijn Heule, João Marques-Silva 0001	MUS Extraction Using Clausal Proofs.	SAT	2014	DBLP DOI BibTeX RDF
1	Ruben Martins, Vasco M. Manquinho, Inês Lynce	Open-WBO: A Modular MaxSAT Solver, .	SAT	2014	DBLP DOI BibTeX RDF
1	Gilles Audemard, Laurent Simon	Lazy Clause Exchange Policy for Parallel SAT Solvers.	SAT	2014	DBLP DOI BibTeX RDF
1	Daniel Larraz, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio	Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions.	SAT	2014	DBLP DOI BibTeX RDF
1	Ronald de Haan, Stefan Szeider	Fixed-Parameter Tractable Reductions to SAT.	SAT	2014	DBLP DOI BibTeX RDF
1	Zack Newsham, Vijay Ganesh, Sebastian Fischmeister, Gilles Audemard, Laurent Simon	Impact of Community Structure on SAT Solver Performance.	SAT	2014	DBLP DOI BibTeX RDF
1	Olaf Beyersdorff, Oliver Kullmann	Unified Characterisations of Resolution Hardness Measures.	SAT	2014	DBLP DOI BibTeX RDF
1	Oliver Gableske	An Ising Model Inspired Extension of the Product-Based MP Framework for SAT.	SAT	2014	DBLP DOI BibTeX RDF
1	Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki	Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction.	SAT	2014	DBLP DOI BibTeX RDF
1	Tomohiro Sonobe, Shuya Kondoh, Mary Inaba	Community Branching for Parallel Portfolio SAT Solvers.	SAT	2014	DBLP DOI BibTeX RDF
1	Alexander Nadel, Vadim Ryvchin, Ofer Strichman	Ultimately Incremental SAT.	SAT	2014	DBLP DOI BibTeX RDF
1	Charles Jordan, Lukasz Kaiser	Experiments with Reduction Finding.	SAT	2013	DBLP DOI BibTeX RDF
1	Ruben Martins, Vasco M. Manquinho, Inês Lynce	Community-Based Partitioning for MaxSAT Solving.	SAT	2013	DBLP DOI BibTeX RDF
1	Igor Razgon, Justyna Petke	Cliquewidth and Knowledge Compilation.	SAT	2013	DBLP DOI BibTeX RDF
1	Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman 0001, Stefan Szeider	Upper and Lower Bounds for Weak Backdoor Set Detection.	SAT	2013	DBLP DOI BibTeX RDF
1	Albert Atserias	The Proof-Search Problem between Bounded-Width Resolution and Bounded-Degree Semi-algebraic Proofs.	SAT	2013	DBLP DOI BibTeX RDF
1	Norbert Manthey, Tobias Philipp, Christoph Wernhard	Soundness of Inprocessing in Clause Sharing SAT Solvers.	SAT	2013	DBLP DOI BibTeX RDF
1	Marcelo Finger, Ronan LeBras, Carla P. Gomes, Bart Selman	Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability.	SAT	2013	DBLP DOI BibTeX RDF
1	Alessandro Cimatti, Alberto Griggio, Bastiaan Joost Schaafsma, Roberto Sebastiani	A Modular Approach to MaxSAT Modulo Theories.	SAT	2013	DBLP DOI BibTeX RDF
1	Olaf Beyersdorff	The Complexity of Theorem Proving in Autoepistemic Logic.	SAT	2013	DBLP DOI BibTeX RDF
1	Massimo Lauria	A Rank Lower Bound for Cutting Planes Proofs of Ramsey's Theorem.	SAT	2013	DBLP DOI BibTeX RDF
1	Ronald de Haan, Iyad A. Kanj, Stefan Szeider	Local Backbones.	SAT	2013	DBLP DOI BibTeX RDF
1	Alexandra Goultiaeva, Fahiem Bacchus	Recovering and Utilizing Partial Duality in QBF.	SAT	2013	DBLP DOI BibTeX RDF
1	Oliver Gableske	On the Interpolation between Product-Based Message Passing Heuristics for SAT.	SAT	2013	DBLP DOI BibTeX RDF
1	Mikolás Janota, João Marques-Silva 0001	On Propositional QBF Expansions and Q-Resolution.	SAT	2013	DBLP DOI BibTeX RDF
1	Jan Johannsen	Exponential Separations in a Hierarchy of Clause Learning Proof Systems.	SAT	2013	DBLP DOI BibTeX RDF
1	Uwe Bubeck, Hans Kleine Büning	Nested Boolean Functions as Models for Quantified Boolean Formulas.	SAT	2013	DBLP DOI BibTeX RDF
1	Alexey Ignatiev, Mikolás Janota, João Marques-Silva 0001	Quantified Maximum Satisfiability: - A Core-Guided Approach.	SAT	2013	DBLP DOI BibTeX RDF
1	Jessica Davies 0001, Fahiem Bacchus	Exploiting the Power of mip Solvers in maxsat.	SAT	2013	DBLP DOI BibTeX RDF
1	Siert Wieringa, Keijo Heljanko	Concurrent Clause Strengthening.	SAT	2013	DBLP DOI BibTeX RDF
1	Matti Järvisalo, Allen Van Gelder (eds.)	Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings	SAT	2013	DBLP DOI BibTeX RDF
1	Horst Samulowitz, Chandra Reddy, Ashish Sabharwal, Meinolf Sellmann	Snappy: A Simple Algorithm Portfolio.	SAT	2013	DBLP DOI BibTeX RDF
1	Jacobo Torán	On the Resolution Complexity of Graph Non-isomorphism.	SAT	2013	DBLP DOI BibTeX RDF
1	Mordechai Ben-Ari	LearnSAT: A SAT Solver for Education.	SAT	2013	DBLP DOI BibTeX RDF
1	Jean-Marie Lagniez, Armin Biere	Factoring Out Assumptions to Speed Up MUS Extraction.	SAT	2013	DBLP DOI BibTeX RDF
1	Hiroshi Fujita 0002, Miyuki Koshimura, Ryuzo Hasegawa	SCSat: A Soft Constraint Guided SAT Solver.	SAT	2013	DBLP DOI BibTeX RDF
1	Andrew Mihal, Steve Teig	A Constraint Satisfaction Approach for Programmable Logic Detailed Placement.	SAT	2013	DBLP DOI BibTeX RDF
1	Peter J. Stuckey	There Are No CNF Problems.	SAT	2013	DBLP DOI BibTeX RDF
1	Markus Iser, Carsten Sinz, Mana Taghdiri	Minimizing Models for Tseitin-Encoded SAT Instances.	SAT	2013	DBLP DOI BibTeX RDF
1	Florian Lonsing, Uwe Egly, Allen Van Gelder	Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation.	SAT	2013	DBLP DOI BibTeX RDF
1	Gilles Audemard, Jean-Marie Lagniez, Laurent Simon	Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction.	SAT	2013	DBLP DOI BibTeX RDF
1	Johannes Dellert, Christian Zielke, Michael Kaufmann 0001	MUStICCa: MUS Extraction with Interactive Choice of Candidates.	SAT	2013	DBLP DOI BibTeX RDF
1	Marijn Heule, Stefan Szeider	A SAT Approach to Clique-Width.	SAT	2013	DBLP DOI BibTeX RDF
1	Takehide Soh, Naoyuki Tamura, Mutsunori Banbara	Scarab: A Rapid Prototyping Tool for SAT-Based Constraint Programming Systems.	SAT	2013	DBLP DOI BibTeX RDF
1	Edmund M. Clarke	Turing's Computable Real Numbers and Why They Are Still Important Today.	SAT	2013	DBLP DOI BibTeX RDF
1	Anton Belov, Norbert Manthey, João Marques-Silva 0001	Parallel MUS Extraction.	SAT	2013	DBLP DOI BibTeX RDF
1	Aaron R. Bradley	Understanding IC3.	SAT	2012	DBLP DOI BibTeX RDF
1	Alejandro Arbelaez, Philippe Codognet	Towards Massively Parallel Local Search for SAT - (Poster Presentation).	SAT	2012	DBLP DOI BibTeX RDF
1	Georg Weissenbacher	Interpolant Strength Revisited.	SAT	2012	DBLP DOI BibTeX RDF
1	Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton-Brown	Evaluating Component Solver Contributions to Portfolio-Based Algorithm Selectors.	SAT	2012	DBLP DOI BibTeX RDF
1	Krystof Hoder, Nikolaj S. Bjørner	Generalized Property Directed Reachability.	SAT	2012	DBLP DOI BibTeX RDF
1	Norbert Manthey	Coprocessor 2.0 - A Flexible CNF Simplifier - (Tool Presentation).	SAT	2012	DBLP DOI BibTeX RDF
1	Donald E. Knuth	Satisfiability and The Art of Computer Programming.	SAT	2012	DBLP DOI BibTeX RDF
1	Bard Bloom, David Grove, Benjamin Herta, Ashish Sabharwal, Horst Samulowitz, Vijay A. Saraswat	SatX10: A Scalable Plug&Play Parallel SAT Framework - (Tool Presentation).	SAT	2012	DBLP DOI BibTeX RDF
1	Ashutosh Gupta	Improved Single Pass Algorithms for Resolution Proof Reduction - (Poster Presentation).	SAT	2012	DBLP DOI BibTeX RDF
1	Yael Ben-Haim, Alexander Ivrii, Oded Margalit, Arie Matsliah	Perfect Hashing and CNF Encodings of Cardinality Constraints.	SAT	2012	DBLP DOI BibTeX RDF
1	Florian Corzilius, Ulrich Loup, Sebastian Junges, Erika Ábrahám	SMT-RAT: An SMT-Compliant Nonlinear Real Arithmetic Toolbox - (Tool Presentation).	SAT	2012	DBLP DOI BibTeX RDF
1	Friedrich Slivovsky, Stefan Szeider	Computing Resolution-Path Dependencies in Linear Time , .	SAT	2012	DBLP DOI BibTeX RDF
1	Mikolás Janota, William Klieber, João Marques-Silva 0001, Edmund M. Clarke	Solving QBF with Counterexample Guided Refinement.	SAT	2012	DBLP DOI BibTeX RDF
1	Mark H. Liffiton, Jordyn C. Maglalang	A Cardinality Solver: More Expressive Constraints for Free - (Poster Presentation).	SAT	2012	DBLP DOI BibTeX RDF
1	Thomas Hugel	SATLab: X-Raying Random k-SAT - (Tool Presentation).	SAT	2012	DBLP DOI BibTeX RDF
1	Iago Abal, Alcino Cunha, Joe Hurd, Jorge Sousa Pinto	Using Term Rewriting to Solve Bit-Vector Arithmetic Problems - (Poster Presentation).	SAT	2012	DBLP DOI BibTeX RDF
1	Anton Belov, Alexander Ivrii, Arie Matsliah, João Marques-Silva 0001	On Efficient Computation of Variable MUSes.	SAT	2012	DBLP DOI BibTeX RDF
1	Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä	Conflict-Driven XOR-Clause Learning.	SAT	2012	DBLP DOI BibTeX RDF
1	Stephan Kottler, Christian Zielke, Paul Seitz, Michael Kaufmann 0001	CoPAn: Exploring Recurring Patterns in Conflict Analysis of CDCL SAT Solvers - (Tool Presentation).	SAT	2012	DBLP DOI BibTeX RDF
1	Paolo Marin, Christian Miller, Bernd Becker 0001	Incremental QBF Preprocessing for Partial Design Verification - (Poster Presentation).	SAT	2012	DBLP DOI BibTeX RDF
1	Aina Niemetz, Mathias Preiner, Florian Lonsing, Martina Seidl, Armin Biere	Resolution-Based Certificate Extraction for QBF - (Tool Presentation).	SAT	2012	DBLP DOI BibTeX RDF
1	Alexander Nadel, Vadim Ryvchin, Ofer Strichman	Preprocessing in Incremental SAT.	SAT	2012	DBLP DOI BibTeX RDF
1	Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs	Intensification Search in Modern SAT Solvers - (Poster Presentation).	SAT	2012	DBLP DOI BibTeX RDF
1	António Morgado 0001, Federico Heras, João Marques-Silva 0001	Improvements to Core-Guided Binary Search for MaxSAT.	SAT	2012	DBLP DOI BibTeX RDF
1	Vijay Ganesh, Charles W. O'Donnell, Mate Soos, Srinivas Devadas, Martin C. Rinard, Armando Solar-Lezama	Lynx: A Programmatic SAT Solver for the RNA-Folding Problem.	SAT	2012	DBLP DOI BibTeX RDF
1	Tomoya Tanjo, Naoyuki Tamura, Mutsunori Banbara	Azucar: A SAT-Based CSP Solver Using Compact Order Encoding - (Tool Presentation).	SAT	2012	DBLP DOI BibTeX RDF
1	Stefano Ermon, Ronan LeBras, Carla P. Gomes, Bart Selman, R. Bruce van Dover	SMT-Aided Combinatorial Materials Discovery.	SAT	2012	DBLP DOI BibTeX RDF
1	Chu Min Li, Yu Li	Satisfying versus Falsifying in Local Search for Satisfiability - (Poster Presentation).	SAT	2012	DBLP DOI BibTeX RDF
1	Allen Van Gelder, Samuel B. Wood, Florian Lonsing	Extended Failed-Literal Preprocessing for Quantified Boolean Formulas.	SAT	2012	DBLP DOI BibTeX RDF
1	Sebastian Burg, Stephan Kottler, Michael Kaufmann 0001	Creating Industrial-Like SAT Instances by Clustering and Reconstruction - (Poster Presentation).	SAT	2012	DBLP DOI BibTeX RDF
1	Peter van der Tak, Marijn Heule, Armin Biere	Concurrent Cube-and-Conquer - (Poster Presentation).	SAT	2012	DBLP DOI BibTeX RDF
1	Markus Iser, Mana Taghdiri, Carsten Sinz	Optimizing MiniSAT Variable Orderings for the Relational Model Finder Kodkod - (Poster Presentation).	SAT	2012	DBLP DOI BibTeX RDF
1	Antti Eero Johannes Hyvärinen, Norbert Manthey	Designing Scalable Parallel SAT Solvers.	SAT	2012	DBLP DOI BibTeX RDF
1	Dimitris Achlioptas, Ricardo Menchaca-Mendez	Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas.	SAT	2012	DBLP DOI BibTeX RDF
1	Carlos Ansótegui, Jesús Giráldez-Cru, Jordi Levy	The Community Structure of SAT Formulas.	SAT	2012	DBLP DOI BibTeX RDF

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