Search results for "SAT"

Hits ?▲	Authors	Title	Venue	Year	Link
37	Norbert Manthey, Marius Lindauer	SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers.	SAT	2016	DBLP DOI BibTeX RDF
37	Stefan Falkner, Marius Lindauer, Frank Hutter	SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers.	SAT	2015	DBLP DOI BibTeX RDF
37	Ruiwen Chen, Rahul Santhanam	Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP.	SAT	2015	DBLP DOI BibTeX RDF
37	Jan Burchard, Tobias Schubert 0001, Bernd Becker 0001	Laissez-Faire Caching for Parallel #SAT Solving.	SAT	2015	DBLP DOI BibTeX RDF
37	Carlos Mencía, Alessandro Previti, João Marques-Silva 0001	SAT-Based Horn Least Upper Bounds.	SAT	2015	DBLP DOI BibTeX RDF
37	Alexey Ignatiev, Alessandro Previti, João Marques-Silva 0001	SAT-Based Formula Simplification.	SAT	2015	DBLP DOI BibTeX RDF
37	Rehan Abdul Aziz, Geoffrey Chu, Christian J. Muise, Peter J. Stuckey	#∃SAT: Projected Model Counting.	SAT	2015	DBLP DOI BibTeX RDF
37	Kuan-Hua Tu, Tzu-Chien Hsu, Jie-Hong R. Jiang	QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving.	SAT	2015	DBLP DOI BibTeX RDF
37	Alexander Ivrii, Vadim Ryvchin, Ofer Strichman	Mining Backbone Literals in Incremental SAT - A New Kind of Incremental Data.	SAT	2015	DBLP DOI BibTeX RDF
37	Zack Newsham, William Lindsay, Vijay Ganesh, Jia Hui Liang, Sebastian Fischmeister, Krzysztof Czarnecki 0001	SATGraf: Visualizing the Evolution of SAT Formula Structure in Solvers.	SAT	2015	DBLP DOI BibTeX RDF
37	Tomás Balyo, Peter Sanders 0001, Carsten Sinz	HordeSat: A Massively Parallel Portfolio SAT Solver.	SAT	2015	DBLP DOI BibTeX RDF
37	Adam Douglass, Andrew D. King, Jack Raymond	Constructing SAT Filters with a Quantum Annealer.	SAT	2015	DBLP DOI BibTeX RDF
37	Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle	Solving MaxSAT and #SAT on Structured CNF Formulas.	SAT	2014	DBLP DOI BibTeX RDF
37	Boris Konev, Alexei Lisitsa 0001	A SAT Attack on the Erdős Discrepancy Conjecture.	SAT	2014	DBLP DOI BibTeX RDF
37	Jakob Nordström	A (Biased) Proof Complexity Survey for SAT Practitioners.	SAT	2014	DBLP DOI BibTeX RDF
37	Andrei A. Bulatov, Cong Wang 0002	Approximating Highly Satisfiable Random 2-SAT.	SAT	2014	DBLP DOI BibTeX RDF
37	Gilles Audemard, Laurent Simon	Lazy Clause Exchange Policy for Parallel SAT Solvers.	SAT	2014	DBLP DOI BibTeX RDF
37	Ronald de Haan, Stefan Szeider	Fixed-Parameter Tractable Reductions to SAT.	SAT	2014	DBLP DOI BibTeX RDF
37	Zack Newsham, Vijay Ganesh, Sebastian Fischmeister, Gilles Audemard, Laurent Simon	Impact of Community Structure on SAT Solver Performance.	SAT	2014	DBLP DOI BibTeX RDF
37	Oliver Gableske	An Ising Model Inspired Extension of the Product-Based MP Framework for SAT.	SAT	2014	DBLP DOI BibTeX RDF
37	Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki	Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction.	SAT	2014	DBLP DOI BibTeX RDF
37	Tomohiro Sonobe, Shuya Kondoh, Mary Inaba	Community Branching for Parallel Portfolio SAT Solvers.	SAT	2014	DBLP DOI BibTeX RDF
37	Alexander Nadel, Vadim Ryvchin, Ofer Strichman	Ultimately Incremental SAT.	SAT	2014	DBLP DOI BibTeX RDF
37	Norbert Manthey, Tobias Philipp, Christoph Wernhard	Soundness of Inprocessing in Clause Sharing SAT Solvers.	SAT	2013	DBLP DOI BibTeX RDF
37	Oliver Gableske	On the Interpolation between Product-Based Message Passing Heuristics for SAT.	SAT	2013	DBLP DOI BibTeX RDF
37	Mordechai Ben-Ari	LearnSAT: A SAT Solver for Education.	SAT	2013	DBLP DOI BibTeX RDF
37	Hiroshi Fujita 0002, Miyuki Koshimura, Ryuzo Hasegawa	SCSat: A Soft Constraint Guided SAT Solver.	SAT	2013	DBLP DOI BibTeX RDF
37	Markus Iser, Carsten Sinz, Mana Taghdiri	Minimizing Models for Tseitin-Encoded SAT Instances.	SAT	2013	DBLP DOI BibTeX RDF
37	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
37	Marijn Heule, Stefan Szeider	A SAT Approach to Clique-Width.	SAT	2013	DBLP DOI BibTeX RDF
37	Takehide Soh, Naoyuki Tamura, Mutsunori Banbara	Scarab: A Rapid Prototyping Tool for SAT-Based Constraint Programming Systems.	SAT	2013	DBLP DOI BibTeX RDF
37	Alejandro Arbelaez, Philippe Codognet	Towards Massively Parallel Local Search for SAT - (Poster Presentation).	SAT	2012	DBLP DOI BibTeX RDF
37	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
37	Thomas Hugel	SATLab: X-Raying Random k-SAT - (Tool Presentation).	SAT	2012	DBLP DOI BibTeX RDF
37	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
37	Alexander Nadel, Vadim Ryvchin, Ofer Strichman	Preprocessing in Incremental SAT.	SAT	2012	DBLP DOI BibTeX RDF
37	Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs	Intensification Search in Modern SAT Solvers - (Poster Presentation).	SAT	2012	DBLP DOI BibTeX RDF
37	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
37	Tomoya Tanjo, Naoyuki Tamura, Mutsunori Banbara	Azucar: A SAT-Based CSP Solver Using Compact Order Encoding - (Tool Presentation).	SAT	2012	DBLP DOI BibTeX RDF
37	Sebastian Burg, Stephan Kottler, Michael Kaufmann 0001	Creating Industrial-Like SAT Instances by Clustering and Reconstruction - (Poster Presentation).	SAT	2012	DBLP DOI BibTeX RDF
37	Antti Eero Johannes Hyvärinen, Norbert Manthey	Designing Scalable Parallel SAT Solvers.	SAT	2012	DBLP DOI BibTeX RDF
37	Carlos Ansótegui, Jesús Giráldez-Cru, Jordi Levy	The Community Structure of SAT Formulas.	SAT	2012	DBLP DOI BibTeX RDF
37	Emir Demirovic, Haris Gavranovic	An Efficient Method for Solving UNSAT 3-SAT and Similar Instances via Static Decomposition - (Poster Presentation).	SAT	2012	DBLP DOI BibTeX RDF
37	Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann	Learning Back-Clauses in SAT - (Poster Presentation).	SAT	2012	DBLP DOI BibTeX RDF
37	Alexander Nadel, Vadim Ryvchin	Efficient SAT Solving under Assumptions.	SAT	2012	DBLP DOI BibTeX RDF
37	George Katsirelos, Laurent Simon	Learning Polynomials over GF(2) in a SAT Solver - (Poster Presentation).	SAT	2012	DBLP DOI BibTeX RDF
37	Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Jean-Marie Lagniez, Cédric Piette	Revisiting Clause Exchange in Parallel SAT Solving.	SAT	2012	DBLP DOI BibTeX RDF
37	Karem A. Sakallah, Laurent Simon (eds.)	Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings	SAT	2011	DBLP DOI BibTeX RDF
37	Allen Van Gelder	Careful Ranking of Multiple Solvers with Timeouts and Ties.	SAT	2011	DBLP DOI BibTeX RDF
37	Evgeny Dantsin, Edward A. Hirsch	Satisfiability Certificates Verifiable in Subexponential Time.	SAT	2011	DBLP DOI BibTeX RDF
37	Oliver Kullmann, Xishun Zhao	On Variables with Few Occurrences in Conjunctive Normal Forms.	SAT	2011	DBLP DOI BibTeX RDF
37	Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes	Analyzing the Instances of the MaxSAT Evaluation.	SAT	2011	DBLP DOI BibTeX RDF
37	Shin-ichi Minato	πDD: A New Decision Diagram for Efficient Problem Solving in Permutation Space.	SAT	2011	DBLP DOI BibTeX RDF
37	Mikolás Janota, João Marques-Silva 0001	Abstraction-Based Algorithm for 2QBF.	SAT	2011	DBLP DOI BibTeX RDF
37	Marijn Heule, Matti Järvisalo, Armin Biere	Efficient CNF Simplification Based on Binary Implication Graphs.	SAT	2011	DBLP DOI BibTeX RDF
37	Alessandro Previti, Raghuram Ramanujan, Marco Schaerf, Bart Selman	Applying UCT to Boolean Satisfiability.	SAT	2011	DBLP DOI BibTeX RDF
37	Hans Kleine Büning, Xishun Zhao, Uwe Bubeck	Transformations into Normal Forms for Quantified Circuits.	SAT	2011	DBLP DOI BibTeX RDF
37	Huxley Bennett, Sriram Sankaranarayanan 0001	Model Counting Using the Inclusion-Exclusion Principle.	SAT	2011	DBLP DOI BibTeX RDF
37	Koushik Sen	Concolic Testing and Constraint Satisfaction.	SAT	2011	DBLP DOI BibTeX RDF
37	Anton Belov, João Marques-Silva 0001	Minimally Unsatisfiable Boolean Circuits.	SAT	2011	DBLP DOI BibTeX RDF
37	Jian Gao 0007, Minghao Yin, Ke Xu 0001	Phase Transitions in Knowledge Compilation: An Experimental Study.	SAT	2011	DBLP DOI BibTeX RDF
37	Antonio Ramos, Peter van der Tak, Marijn Heule	Between Restarts and Backjumps.	SAT	2011	DBLP DOI BibTeX RDF
37	Allen Van Gelder	Generalized Conflict-Clause Strengthening for Satisfiability Solvers.	SAT	2011	DBLP DOI BibTeX RDF
37	Nadia Creignou, Frédéric Olive, Johannes Schmidt 0001	Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight.	SAT	2011	DBLP DOI BibTeX RDF
37	João Marques-Silva 0001, Inês Lynce	On Improving MUS Extraction Algorithms.	SAT	2011	DBLP DOI BibTeX RDF
37	Vadim Ryvchin, Ofer Strichman	Faster Extraction of High-Level Minimal Unsatisfiable Cores.	SAT	2011	DBLP DOI BibTeX RDF
37	Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais	On Freezing and Reactivating Learnt Clauses.	SAT	2011	DBLP DOI BibTeX RDF
37	Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider	Satisfiability of Acyclic and almost Acyclic CNF Formulas (II).	SAT	2011	DBLP DOI BibTeX RDF
37	Olaf Beyersdorff, Nicola Galesi, Massimo Lauria	Parameterized Complexity of DPLL Search Procedures.	SAT	2011	DBLP DOI BibTeX RDF
37	Ewald Speckenmeyer, Andreas Wotzlaw, Stefan Porschen	A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs.	SAT	2011	DBLP DOI BibTeX RDF
37	Amir Aavani	Translating Pseudo-Boolean Constraints into CNF.	SAT	2011	DBLP DOI BibTeX RDF
37	Ignasi Abío, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell	BDDs for Pseudo-Boolean Constraints - Revisited.	SAT	2011	DBLP DOI BibTeX RDF
37	Florian Lonsing, Armin Biere	Failed Literal Detection for QBF.	SAT	2011	DBLP DOI BibTeX RDF
37	Alexey Ignatiev, Alexander A. Semenov	DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions.	SAT	2011	DBLP DOI BibTeX RDF
37	Ofer Strichman, Stefan Szeider (eds.)	Theory and Applications of Satisfiability Testing - SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings	SAT	2010	DBLP DOI BibTeX RDF
37	Matti Järvisalo, Armin Biere	Reconstructing Solutions after Blocked Clause Elimination.	SAT	2010	DBLP DOI BibTeX RDF
37	Hadi Katebi, Karem A. Sakallah, Igor L. Markov	Symmetry and Satisfiability: An Update.	SAT	2010	DBLP DOI BibTeX RDF
37	Alexander Nadel, Vadim Ryvchin	Assignment Stack Shrinking.	SAT	2010	DBLP DOI BibTeX RDF
37	Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001	An Exact Algorithm for the Boolean Connectivity Problem for k-CNF.	SAT	2010	DBLP DOI BibTeX RDF
37	Florian Lonsing, Armin Biere	Integrating Dependency Schemes in Search-Based QBF Solvers.	SAT	2010	DBLP DOI BibTeX RDF
37	Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer	Complexity Results for Linear XSAT-Problems.	SAT	2010	DBLP DOI BibTeX RDF
37	Olaf Beyersdorff, Arne Meier, Sebastian Müller 0003, Michael Thomas 0001, Heribert Vollmer	Proof Complexity of Propositional Default Logic.	SAT	2010	DBLP DOI BibTeX RDF
37	Gayathri Namasivayam, Miroslaw Truszczynski	Simple but Hard Mixed Horn Formulas.	SAT	2010	DBLP DOI BibTeX RDF
37	Vasco M. Manquinho, Ruben Martins, Inês Lynce	Improving Unsatisfiability-Based Algorithms for Boolean Optimization.	SAT	2010	DBLP DOI BibTeX RDF
37	Miquel Bofill, Josep Suy, Mateu Villaret	A System for Solving Constraint Satisfaction Problems with SMT.	SAT	2010	DBLP DOI BibTeX RDF
37	Chu Min Li, Felip Manyà, Zhe Quan, Zhu Zhu	Exact MinSAT Solving.	SAT	2010	DBLP DOI BibTeX RDF
37	Scott Cotton	Two Techniques for Minimizing Resolution Proofs.	SAT	2010	DBLP DOI BibTeX RDF
37	Christian Miller, Stefan Kupferschmid, Matthew Lewis 0004, Bernd Becker 0001	Encoding Techniques, Craig Interpolants and Bounded Model Checking for Incomplete Designs.	SAT	2010	DBLP DOI BibTeX RDF
37	Enrico Giunchiglia, Paolo Marin, Massimo Narizzano	sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning.	SAT	2010	DBLP DOI BibTeX RDF
37	Yehuda Naveh	The Big Deal: Applying Constraint Satisfaction Technologies Where It Makes the Difference.	SAT	2010	DBLP DOI BibTeX RDF
37	Ramamohan Paturi	Exact Algorithms and Complexity.	SAT	2010	DBLP DOI BibTeX RDF
37	Uwe Bubeck, Hans Kleine Büning	Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN.	SAT	2010	DBLP DOI BibTeX RDF
37	William Klieber, Samir Sapra, Sicun Gao, Edmund M. Clarke	A Non-prenex, Non-clausal QBF Solver with Game-State Learning.	SAT	2010	DBLP DOI BibTeX RDF
37	Anton Belov, Zbigniew Stachniak	Improved Local Search for Circuit Satisfiability.	SAT	2010	DBLP DOI BibTeX RDF
37	Alexandra Goultiaeva, Fahiem Bacchus	Exploiting Circuit Representations in QBF Solving.	SAT	2010	DBLP DOI BibTeX RDF
37	Eli Ben-Sasson, Jan Johannsen	Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas.	SAT	2010	DBLP DOI BibTeX RDF
37	Claudia Peschiera, Luca Pulina, Armando Tacchella, Uwe Bubeck, Oliver Kullmann, Inês Lynce	The Seventh QBF Solvers Evaluation (QBFEVAL'10).	SAT	2010	DBLP DOI BibTeX RDF
37	Lukas Kroc, Ashish Sabharwal, Bart Selman	An Empirical Study of Optimal Noise and Runtime Distributions in Local Search.	SAT	2010	DBLP DOI BibTeX RDF
37	Oliver Kullmann (eds.)	Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings	SAT	2009	DBLP DOI BibTeX RDF
37	Olaf Beyersdorff, Sebastian Müller 0003	Does Advice Help to Prove Propositional Tautologies?	SAT	2009	DBLP DOI BibTeX RDF