Search results for "SAT"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Adrian Balint, Uwe Schöning	Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break.	SAT	2012	DBLP DOI BibTeX RDF
1	Robert Crowston, Gregory Z. Gutin, Mark Jones 0001, Venkatesh Raman 0001, Saket Saurabh 0001, Anders Yeo	Fixed-Parameter Tractability of Satisfying beyond the Number of Variables.	SAT	2012	DBLP DOI BibTeX RDF
1	Nadia Creignou, Heribert Vollmer	Parameterized Complexity of Weighted Satisfiability Problems.	SAT	2012	DBLP DOI BibTeX RDF
1	Serge Gaspers, Stefan Szeider	Strong Backdoors to Nested Satisfiability.	SAT	2012	DBLP DOI BibTeX RDF
1	Uwe Egly	On Sequent Systems and Resolution for QBFs.	SAT	2012	DBLP DOI BibTeX RDF
1	Arie Matsliah, Ashish Sabharwal, Horst Samulowitz	Augmenting Clause Learning with Implied Literals - (Poster Presentation).	SAT	2012	DBLP DOI BibTeX RDF
1	Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen	Finding Efficient Circuits for Ensemble Computation.	SAT	2012	DBLP DOI BibTeX RDF
1	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
1	Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann	Learning Back-Clauses in SAT - (Poster Presentation).	SAT	2012	DBLP DOI BibTeX RDF
1	Alexander Nadel, Vadim Ryvchin	Efficient SAT Solving under Assumptions.	SAT	2012	DBLP DOI BibTeX RDF
1	Maria Luisa Bonet, Samuel R. Buss	An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning.	SAT	2012	DBLP DOI BibTeX RDF
1	Alessandro Cimatti, Roberto Sebastiani (eds.)	Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings	SAT	2012	DBLP DOI BibTeX RDF
1	George Katsirelos, Laurent Simon	Learning Polynomials over GF(2) in a SAT Solver - (Poster Presentation).	SAT	2012	DBLP DOI BibTeX RDF
1	Oliver Kullmann, Xishun Zhao	On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets.	SAT	2012	DBLP DOI BibTeX RDF
1	Alexandra Goultiaeva, Fahiem Bacchus	Off the Trail: Re-examining the CDCL Algorithm.	SAT	2012	DBLP DOI BibTeX RDF
1	Jian Zhang 0001, Feifei Ma, Zhiqiang Zhang 0007	Faulty Interaction Identification via Constraint Solving and Optimization.	SAT	2012	DBLP DOI BibTeX RDF
1	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
1	Valeriy Balabanov, Hui-Ju Katherine Chiang, Jie-Hong Roland Jiang	Henkin Quantifiers and Boolean Formulae.	SAT	2012	DBLP DOI BibTeX RDF
1	Chu Min Li, Wanxia Wei, Yu Li	Exploiting Historical Relationships of Clauses and Variables in Local Search for Satisfiability - (Poster Presentation).	SAT	2012	DBLP DOI BibTeX RDF
1	Sam Bayless, Alan J. Hu	Single-Solver Algorithms for 2QBF - (Poster Presentation).	SAT	2012	DBLP DOI BibTeX RDF
1	Allen Van Gelder	Careful Ranking of Multiple Solvers with Timeouts and Ties.	SAT	2011	DBLP DOI BibTeX RDF
1	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
1	Evgeny Dantsin, Edward A. Hirsch	Satisfiability Certificates Verifiable in Subexponential Time.	SAT	2011	DBLP DOI BibTeX RDF
1	Oliver Kullmann, Xishun Zhao	On Variables with Few Occurrences in Conjunctive Normal Forms.	SAT	2011	DBLP DOI BibTeX RDF
1	Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes	Analyzing the Instances of the MaxSAT Evaluation.	SAT	2011	DBLP DOI BibTeX RDF
1	Hadi Katebi, Karem A. Sakallah, João P. Marques Silva	Empirical Study of the Anatomy of Modern Sat Solvers.	SAT	2011	DBLP DOI BibTeX RDF
1	Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann	Non-Model-Based Algorithm Portfolios for SAT.	SAT	2011	DBLP DOI BibTeX RDF
1	Shin-ichi Minato	πDD: A New Decision Diagram for Efficient Problem Solving in Permutation Space.	SAT	2011	DBLP DOI BibTeX RDF
1	Mikolás Janota, João Marques-Silva 0001	Abstraction-Based Algorithm for 2QBF.	SAT	2011	DBLP DOI BibTeX RDF
1	Marijn Heule, Matti Järvisalo, Armin Biere	Efficient CNF Simplification Based on Binary Implication Graphs.	SAT	2011	DBLP DOI BibTeX RDF
1	Alexander Nadel	Generating Diverse Solutions in SAT.	SAT	2011	DBLP DOI BibTeX RDF
1	Alessandro Previti, Raghuram Ramanujan, Marco Schaerf, Bart Selman	Applying UCT to Boolean Satisfiability.	SAT	2011	DBLP DOI BibTeX RDF
1	Hans Kleine Büning, Xishun Zhao, Uwe Bubeck	Transformations into Normal Forms for Quantified Circuits.	SAT	2011	DBLP DOI BibTeX RDF
1	Huxley Bennett, Sriram Sankaranarayanan 0001	Model Counting Using the Inclusion-Exclusion Principle.	SAT	2011	DBLP DOI BibTeX RDF
1	Koushik Sen	Concolic Testing and Constraint Satisfaction.	SAT	2011	DBLP DOI BibTeX RDF
1	Justyna Petke, Peter Jeavons 0001	The Order Encoding: From Tractable CSP to Tractable SAT.	SAT	2011	DBLP DOI BibTeX RDF
1	Oliver Gableske, Marijn Heule	EagleUP: Solving Random 3-SAT Using SLS with Unit Propagation.	SAT	2011	DBLP DOI BibTeX RDF
1	Anton Belov, João Marques-Silva 0001	Minimally Unsatisfiable Boolean Circuits.	SAT	2011	DBLP DOI BibTeX RDF
1	Jian Gao 0007, Minghao Yin, Ke Xu 0001	Phase Transitions in Knowledge Compilation: An Experimental Study.	SAT	2011	DBLP DOI BibTeX RDF
1	Antonio Ramos, Peter van der Tak, Marijn Heule	Between Restarts and Backjumps.	SAT	2011	DBLP DOI BibTeX RDF
1	Allen Van Gelder	Generalized Conflict-Clause Strengthening for Satisfiability Solvers.	SAT	2011	DBLP DOI BibTeX RDF
1	Ryan Williams 0001	Connecting SAT Algorithms and Complexity Lower Bounds.	SAT	2011	DBLP DOI BibTeX RDF
1	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
1	João Marques-Silva 0001, Inês Lynce	On Improving MUS Extraction Algorithms.	SAT	2011	DBLP DOI BibTeX RDF
1	Dave A. D. Tompkins, Adrian Balint, Holger H. Hoos	Captain Jack: New Variable Selection Heuristics in Local Search for SAT.	SAT	2011	DBLP DOI BibTeX RDF
1	Vadim Ryvchin, Ofer Strichman	Faster Extraction of High-Level Minimal Unsatisfiable Cores.	SAT	2011	DBLP DOI BibTeX RDF
1	Bryan Silverthorn, Risto Miikkulainen	Learning Polarity from Structure in SAT.	SAT	2011	DBLP DOI BibTeX RDF
1	Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais	On Freezing and Reactivating Learnt Clauses.	SAT	2011	DBLP DOI BibTeX RDF
1	Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider	Satisfiability of Acyclic and almost Acyclic CNF Formulas (II).	SAT	2011	DBLP DOI BibTeX RDF
1	Martin Mundhenk, Robert Zeranski	How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms.	SAT	2011	DBLP DOI BibTeX RDF
1	Tomoya Tanjo, Naoyuki Tamura, Mutsunori Banbara	A Compact and Efficient SAT-Encoding of Finite Domain CSP.	SAT	2011	DBLP DOI BibTeX RDF
1	Olaf Beyersdorff, Nicola Galesi, Massimo Lauria	Parameterized Complexity of DPLL Search Procedures.	SAT	2011	DBLP DOI BibTeX RDF
1	Ewald Speckenmeyer, Andreas Wotzlaw, Stefan Porschen	A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs.	SAT	2011	DBLP DOI BibTeX RDF
1	Amir Aavani	Translating Pseudo-Boolean Constraints into CNF.	SAT	2011	DBLP DOI BibTeX RDF
1	Ignasi Abío, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell	BDDs for Pseudo-Boolean Constraints - Revisited.	SAT	2011	DBLP DOI BibTeX RDF
1	Florian Lonsing, Armin Biere	Failed Literal Detection for QBF.	SAT	2011	DBLP DOI BibTeX RDF
1	Ignasi Abío, Morgan Deters, Robert Nieuwenhuis, Peter J. Stuckey	Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One.	SAT	2011	DBLP DOI BibTeX RDF
1	Alexey Ignatiev, Alexander A. Semenov	DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions.	SAT	2011	DBLP DOI BibTeX RDF
1	Matti Järvisalo, Armin Biere	Reconstructing Solutions after Blocked Clause Elimination.	SAT	2010	DBLP DOI BibTeX RDF
1	Hadi Katebi, Karem A. Sakallah, Igor L. Markov	Symmetry and Satisfiability: An Update.	SAT	2010	DBLP DOI BibTeX RDF
1	Vishwambhar Rathi, Erik Aurell, Lars K. Rasmussen, Mikael Skoglund	Bounds on Threshold of Regular Random k-SAT.	SAT	2010	DBLP DOI BibTeX RDF
1	Adrian Balint, Andreas Fröhlich	Improving Stochastic Local Search for SAT with a New Probability Distribution.	SAT	2010	DBLP DOI BibTeX RDF
1	Denis Pankratov, Allan Borodin	On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem.	SAT	2010	DBLP DOI BibTeX RDF
1	William Matthews, Ramamohan Paturi	Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable.	SAT	2010	DBLP DOI BibTeX RDF
1	Rüdiger Ehlers	Minimising Deterministic Büchi Automata Precisely Using SAT Solving.	SAT	2010	DBLP DOI BibTeX RDF
1	Alexander Nadel, Vadim Ryvchin	Assignment Stack Shrinking.	SAT	2010	DBLP DOI BibTeX RDF
1	Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001	An Exact Algorithm for the Boolean Connectivity Problem for k-CNF.	SAT	2010	DBLP DOI BibTeX RDF
1	Florian Lonsing, Armin Biere	Integrating Dependency Schemes in Search-Based QBF Solvers.	SAT	2010	DBLP DOI BibTeX RDF
1	Stephan Kottler	SAT Solving with Reference Points.	SAT	2010	DBLP DOI BibTeX RDF
1	Yacine Boufkhad, Thomas Hugel	Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold.	SAT	2010	DBLP DOI BibTeX RDF
1	Robert Brummayer, Florian Lonsing, Armin Biere	Automated Testing and Debugging of SAT and QBF Solvers.	SAT	2010	DBLP DOI BibTeX RDF
1	Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer	Complexity Results for Linear XSAT-Problems.	SAT	2010	DBLP DOI BibTeX RDF
1	Oliver Kullmann	Green-Tao Numbers and SAT.	SAT	2010	DBLP DOI BibTeX RDF
1	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
1	Gayathri Namasivayam, Miroslaw Truszczynski	Simple but Hard Mixed Horn Formulas.	SAT	2010	DBLP DOI BibTeX RDF
1	Vasco M. Manquinho, Ruben Martins, Inês Lynce	Improving Unsatisfiability-Based Algorithms for Boolean Optimization.	SAT	2010	DBLP DOI BibTeX RDF
1	Miquel Bofill, Josep Suy, Mateu Villaret	A System for Solving Constraint Satisfaction Problems with SMT.	SAT	2010	DBLP DOI BibTeX RDF
1	Chu Min Li, Felip Manyà, Zhe Quan, Zhu Zhu	Exact MinSAT Solving.	SAT	2010	DBLP DOI BibTeX RDF
1	Scott Cotton	Two Techniques for Minimizing Resolution Proofs.	SAT	2010	DBLP DOI BibTeX RDF
1	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
1	Dave A. D. Tompkins, Holger H. Hoos	Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT.	SAT	2010	DBLP DOI BibTeX RDF
1	Evgeny Dantsin, Alexander Wolpert	On Moderately Exponential Time for SAT.	SAT	2010	DBLP DOI BibTeX RDF
1	Enrico Giunchiglia, Paolo Marin, Massimo Narizzano	sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning.	SAT	2010	DBLP DOI BibTeX RDF
1	Mladen Nikolic	Statistical Methodology for Comparison of SAT Solvers.	SAT	2010	DBLP DOI BibTeX RDF
1	Yehuda Naveh	The Big Deal: Applying Constraint Satisfaction Technologies Where It Makes the Difference.	SAT	2010	DBLP DOI BibTeX RDF
1	Ramamohan Paturi	Exact Algorithms and Complexity.	SAT	2010	DBLP DOI BibTeX RDF
1	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
1	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
1	Carsten Fuhs, Peter Schneider-Kamp	Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT.	SAT	2010	DBLP DOI BibTeX RDF
1	Anton Belov, Zbigniew Stachniak	Improved Local Search for Circuit Satisfiability.	SAT	2010	DBLP DOI BibTeX RDF
1	Alexandra Goultiaeva, Fahiem Bacchus	Exploiting Circuit Representations in QBF Solving.	SAT	2010	DBLP DOI BibTeX RDF
1	Allen Van Gelder, Ivor T. A. Spence	Zero-One Designs Produce Small Hard SAT Instances.	SAT	2010	DBLP DOI BibTeX RDF
1	Eli Ben-Sasson, Jan Johannsen	Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas.	SAT	2010	DBLP DOI BibTeX RDF
1	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
1	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
1	Lukas Kroc, Ashish Sabharwal, Bart Selman	An Empirical Study of Optimal Noise and Runtime Distributions in Local Search.	SAT	2010	DBLP DOI BibTeX RDF
1	Albert Atserias, Johannes Klaus Fichte, Marc Thurley	Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution.	SAT	2009	DBLP DOI BibTeX RDF
1	Olaf Beyersdorff, Sebastian Müller 0003	Does Advice Help to Prove Propositional Tautologies?	SAT	2009	DBLP DOI BibTeX RDF
1	Alexandra Goultiaeva, Vicki Iverson, Fahiem Bacchus	Beyond CNF: A Circuit-Based QBF Solver.	SAT	2009	DBLP DOI BibTeX RDF
1	Jingchao Chen	Building a Hybrid SAT Solver via Conflict-Driven, Look-Ahead and XOR Reasoning Techniques.	SAT	2009	DBLP DOI BibTeX RDF	Conflict-driven, XOR reasoning, Hybrid solving technique, search pruning technique, Look-ahead, Boolean satisfiability (SAT)

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