Search results for "SAT"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Bistra Dilkina, Carla P. Gomes, Ashish Sabharwal	Backdoors in the Context of Learning.	SAT	2009	DBLP DOI BibTeX RDF
1	Hans Kleine Büning, Xishun Zhao, Uwe Bubeck	Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits.	SAT	2009	DBLP DOI BibTeX RDF
1	Kei Ohmura, Kazunori Ueda	c-sat: A Parallel SAT Solver for Clusters.	SAT	2009	DBLP DOI BibTeX RDF
1	Robert Nieuwenhuis	SAT Modulo Theories: Enhancing SAT with Special-Purpose Algorithms.	SAT	2009	DBLP DOI BibTeX RDF
1	Anton Belov, Zbigniew Stachniak	Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability.	SAT	2009	DBLP DOI BibTeX RDF
1	Evgeny S. Skvortsov	A Theoretical Analysis of Search in GSAT.	SAT	2009	DBLP DOI BibTeX RDF
1	Matthew Lewis 0004, Paolo Marin, Tobias Schubert 0001, Massimo Narizzano, Bernd Becker 0001, Enrico Giunchiglia	PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing.	SAT	2009	DBLP DOI BibTeX RDF	Parallel QBF Solving, Master/Slave Architecture, MPI, Message Passing
1	Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy	Solving (Weighted) Partial MaxSAT through Satisfiability Testing.	SAT	2009	DBLP DOI BibTeX RDF
1	Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes	Exploiting Cycle Structures in Max-SAT.	SAT	2009	DBLP DOI BibTeX RDF
1	Marko Samer, Helmut Veith	Encoding Treewidth into SAT.	SAT	2009	DBLP DOI BibTeX RDF
1	Vasco M. Manquinho, João Marques-Silva 0001, Jordi Planes	Algorithms for Weighted Boolean Optimization.	SAT	2009	DBLP DOI BibTeX RDF
1	Carsten Sinz, Markus Iser	Problem-Sensitive Restart Heuristics for the DPLL Procedure.	SAT	2009	DBLP DOI BibTeX RDF
1	Eugene Goldberg	Boundary Points and Resolution.	SAT	2009	DBLP DOI BibTeX RDF	proof quality, resolution, SAT-solver, boundary points
1	Niklas Sörensson, Armin Biere	Minimizing Learned Clauses.	SAT	2009	DBLP DOI BibTeX RDF
1	Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer	On Some Aspects of Mixed Horn Formulas.	SAT	2009	DBLP DOI BibTeX RDF	Mixed Horn formula, polynomial time reduction, NP-completeness, satisfiability, exact algorithm
1	Knot Pipatsrisawat, Adnan Darwiche	Width-Based Restart Policies for Clause-Learning Satisfiability Solvers.	SAT	2009	DBLP DOI BibTeX RDF
1	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
1	Moshe Y. Vardi	Symbolic Techniques in Propositional Satisfiability Solving.	SAT	2009	DBLP DOI BibTeX RDF
1	Shai Haim, Toby Walsh	Restart Strategy Selection Using Machine Learning Techniques.	SAT	2009	DBLP DOI BibTeX RDF
1	Yury Chebiryak, Thomas Wahl, Daniel Kroening, Leopold Haller	Finding Lean Induced Cycles in Binary Hypercubes.	SAT	2009	DBLP DOI BibTeX RDF
1	Daniel Johannsen, Igor Razgon, Magnus Wahlström	Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences.	SAT	2009	DBLP DOI BibTeX RDF
1	Patrick Traxler	Variable Influences in Conjunctive Normal Forms.	SAT	2009	DBLP DOI BibTeX RDF
1	Roberto Asín, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell	Cardinality Networks and Their Applications.	SAT	2009	DBLP DOI BibTeX RDF
1	Mate Soos, Karsten Nohl, Claude Castelluccia	Extending SAT Solvers to Cryptographic Problems.	SAT	2009	DBLP DOI BibTeX RDF
1	Lukas Kroc, Ashish Sabharwal, Bart Selman	Relaxed DPLL Search for MaxSAT.	SAT	2009	DBLP DOI BibTeX RDF
1	HyoJung Han, Fabio Somenzi	On-the-Fly Clause Improvement.	SAT	2009	DBLP DOI BibTeX RDF
1	Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol	(1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms.	SAT	2009	DBLP DOI BibTeX RDF
1	Florian Lonsing, Armin Biere	A Compact Representation for Syntactic Dependencies in QBFs.	SAT	2009	DBLP DOI BibTeX RDF
1	Stefan Szeider	The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT.	SAT	2009	DBLP DOI BibTeX RDF
1	Timo Berthold, Stefan Heinz 0001, Marc E. Pfetsch	Nonlinear Pseudo-Boolean Optimization: Relaxation or Propagation?.	SAT	2009	DBLP DOI BibTeX RDF
1	Hyondeuk Kim, Fabio Somenzi, HoonSang Jin	Efficient Term-ITE Conversion for Satisfiability Modulo Theories.	SAT	2009	DBLP DOI BibTeX RDF
1	Eric I. Hsu, Sheila A. McIlraith	VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search.	SAT	2009	DBLP DOI BibTeX RDF	Survey Propagation/EMBP, Variable/Value Ordering Heuristics, Probabilistic Inference
1	Maria Luisa Bonet, Katherine St. John	Efficiently Calculating Evolutionary Tree Measures Using SAT.	SAT	2009	DBLP DOI BibTeX RDF
1	Mark H. Liffiton, Karem A. Sakallah	Generalizing Core-Guided Max-SAT.	SAT	2009	DBLP DOI BibTeX RDF
1	Allen Van Gelder	Improved Conflict-Clause Minimization Leads to Improved Propositional Proof Traces.	SAT	2009	DBLP DOI BibTeX RDF
1	Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà	Sequential Encodings from Max-CSP into Partial Max-SAT.	SAT	2009	DBLP DOI BibTeX RDF
1	Jan Johannsen	An Exponential Lower Bound for Width-Restricted Clause Learning.	SAT	2009	DBLP DOI BibTeX RDF
1	Arist Kojevnikov, Alexander S. Kulikov, Grigory Yaroslavtsev	Finding Efficient Circuits Using SAT-Solvers.	SAT	2009	DBLP DOI BibTeX RDF
1	Olivier Bailleux, Yacine Boufkhad, Olivier Roussel	New Encodings of Pseudo-Boolean Constraints into CNF.	SAT	2009	DBLP DOI BibTeX RDF	Pseudo-Boolean, SAT translation
1	Bas Schaafsma, Marijn Heule, Hans van Maaren	Dynamic Symmetry Breaking by Simulating Zykov Contraction.	SAT	2009	DBLP DOI BibTeX RDF
1	Adrian Balint, Michael Henn, Oliver Gableske	A Novel Approach to Combine a SLS- and a DPLL-Solver for the Satisfiability Problem.	SAT	2009	DBLP DOI BibTeX RDF
1	Mladen Nikolic, Filip Maric, Predrag Janicic	Instance-Based Selection of Policies for SAT Solvers.	SAT	2009	DBLP DOI BibTeX RDF
1	Olaf Beyersdorff, Arne Meier, Michael Thomas 0001, Heribert Vollmer	The Complexity of Reasoning for Fragments of Default Logic.	SAT	2009	DBLP DOI BibTeX RDF
1	Javier Larrosa, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell	Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates.	SAT	2009	DBLP DOI BibTeX RDF
1	Yong Gao 0001	Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms.	SAT	2008	DBLP DOI BibTeX RDF
1	Maarten Mariën, Johan Wittocx, Marc Denecker, Maurice Bruynooghe	SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions.	SAT	2008	DBLP DOI BibTeX RDF
1	Mark H. Liffiton, Karem A. Sakallah	Searching for Autarkies to Trim Unsatisfiable Clause Sets.	SAT	2008	DBLP DOI BibTeX RDF
1	João Marques-Silva 0001, Vasco M. Manquinho	Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms.	SAT	2008	DBLP DOI BibTeX RDF
1	Florian Lonsing, Armin Biere	Nenofex: Expanding NNF for QBF Solving.	SAT	2008	DBLP DOI BibTeX RDF
1	John D. Davis, Zhangxi Tan, Fang Yu 0002, Lintao Zhang	Designing an Efficient Hardware Implication Accelerator for SAT Solving.	SAT	2008	DBLP DOI BibTeX RDF
1	Germain Faure, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell	SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers.	SAT	2008	DBLP DOI BibTeX RDF
1	Stephan Kottler, Michael Kaufmann 0001, Carsten Sinz	A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors.	SAT	2008	DBLP DOI BibTeX RDF
1	Armin Biere	Adaptive Restart Strategies for Conflict Driven SAT Solvers.	SAT	2008	DBLP DOI BibTeX RDF
1	Gilles Audemard, Lucas Bordeaux, Youssef Hamadi, Saïd Jabbour, Lakhdar Sais	A Generalized Framework for Conflict Analysis.	SAT	2008	DBLP DOI BibTeX RDF
1	Konstantinos Georgiou, Periklis A. Papakonstantinou	Complexity and Algorithms for Well-Structured k-SAT Instances.	SAT	2008	DBLP DOI BibTeX RDF
1	Zbigniew Stachniak, Anton Belov	Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning.	SAT	2008	DBLP DOI BibTeX RDF
1	Hans Kleine Büning, Xishun Zhao (eds.)	Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings	SAT	2008	DBLP DOI BibTeX RDF
1	Hans van Maaren, Siert Wieringa	Finding Guaranteed MUSes Fast.	SAT	2008	DBLP DOI BibTeX RDF
1	Josep Argelich, Chu Min Li, Felip Manyà	A Preprocessor for Max-SAT Solvers.	SAT	2008	DBLP DOI BibTeX RDF
1	Dominik Scheder, Philipp Zumstein	How Many Conflicts Does It Need to Be Unsatisfiable?	SAT	2008	DBLP DOI BibTeX RDF	unsatisfiable formulas, Lovász Local Lemma, satisfiability, conflict graph
1	Vadim Ryvchin, Ofer Strichman	Local Restarts.	SAT	2008	DBLP DOI BibTeX RDF
1	Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol	New Results on the Phase Transition for Random Quantified Boolean Formulas.	SAT	2008	DBLP DOI BibTeX RDF
1	Tobias Eibach, Enrico Pilz, Gunnar Völkel	Attacking Bivium Using SAT Solvers.	SAT	2008	DBLP DOI BibTeX RDF	Rsat, Bivium, Gröbner Base, Cryptography, Application, Stream Cipher, BDD, SAT Solver, eSTREAM, Trivium
1	Alasdair Urquhart	Regular and General Resolution: An Improved Separation.	SAT	2008	DBLP DOI BibTeX RDF
1	Kazuo Iwama	SAT, UNSAT and Coloring.	SAT	2008	DBLP DOI BibTeX RDF
1	Stefan Porschen, Ewald Speckenmeyer	A CNF Class Generalizing Exact Linear Formulas.	SAT	2008	DBLP DOI BibTeX RDF	CNF satisfiability, exact linear formula, fibre-transversal, hypergraph
1	Stephan Kottler, Michael Kaufmann 0001, Carsten Sinz	Computation of Renameable Horn Backdoors.	SAT	2008	DBLP DOI BibTeX RDF
1	Eugene Goldberg	A Decision-Making Procedure for Resolution-Based SAT-Solvers.	SAT	2008	DBLP DOI BibTeX RDF
1	Florian Letombe, João Marques-Silva 0001	Improvements to Hybrid Incremental SAT Algorithms.	SAT	2008	DBLP DOI BibTeX RDF
1	Federico Heras, Javier Larrosa	A Max-SAT Inference-Based Pre-processing for Max-Clique.	SAT	2008	DBLP DOI BibTeX RDF	Max-clique, Inference, Max-SAT
1	Shai Haim, Toby Walsh	Online Estimation of SAT Solving Runtime.	SAT	2008	DBLP DOI BibTeX RDF
1	Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà	Modelling Max-CSP as Partial Max-SAT.	SAT	2008	DBLP DOI BibTeX RDF
1	Horst Samulowitz, Fahiem Bacchus	Dynamically Partitioning for Solving QBF.	SAT	2007	DBLP DOI BibTeX RDF
1	Inês Lynce, João Marques-Silva 0001	Breaking Symmetries in SAT Matrix Models.	SAT	2007	DBLP DOI BibTeX RDF
1	Uwe Bubeck, Hans Kleine Büning	Bounded Universal Expansion for Preprocessing QBF.	SAT	2007	DBLP DOI BibTeX RDF
1	Alexander Hertel, Philipp Hertel, Alasdair Urquhart	Formalizing Dangerous SAT Encodings.	SAT	2007	DBLP DOI BibTeX RDF
1	Niklas Eén, Alan Mishchenko, Niklas Sörensson	Applying Logic Synthesis for Speeding Up SAT.	SAT	2007	DBLP DOI BibTeX RDF
1	Steven D. Prestwich	Variable Dependency in Local Search: Prevention Is Better Than Cure.	SAT	2007	DBLP DOI BibTeX RDF
1	Gilles Audemard, Lakhdar Sais	Circuit Based Encoding of CNF Formula.	SAT	2007	DBLP DOI BibTeX RDF
1	Josep Argelich, Felip Manyà	Partial Max-SAT Solvers with Clause Learning.	SAT	2007	DBLP DOI BibTeX RDF
1	Panagiotis Manolios, Daron Vroon 0001	Efficient Circuit to CNF Conversion.	SAT	2007	DBLP DOI BibTeX RDF
1	Marijn Heule, Hans van Maaren	From Idempotent Generalized Boolean Assignments to Multi-bit Search.	SAT	2007	DBLP DOI BibTeX RDF
1	Nachum Dershowitz, Ziyad Hanna, Alexander Nadel	Towards a Better Understanding of the Functionality of a Conflict-Driven SAT Solver.	SAT	2007	DBLP DOI BibTeX RDF
1	Stefan Staber, Roderick Bloem	Fault Localization and Correction with QBF.	SAT	2007	DBLP DOI BibTeX RDF
1	Marijn Heule, Hans van Maaren	Effective Incorporation of Double Look-Ahead Procedures.	SAT	2007	DBLP DOI BibTeX RDF
1	Juan Antonio Navarro Pérez, Andrei Voronkov	Encodings of Problems in Effectively Propositional Logic.	SAT	2007	DBLP DOI BibTeX RDF
1	Oliver Kullmann	Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices.	SAT	2007	DBLP DOI BibTeX RDF
1	João Marques-Silva 0001, Karem A. Sakallah (eds.)	Theory and Applications of Satisfiability Testing - SAT 2007, 10th International Conference, Lisbon, Portugal, May 28-31, 2007, Proceedings	SAT	2007	DBLP DOI BibTeX RDF
1	Marina Langlois, Robert H. Sloan, György Turán	Horn Upper Bounds and Renaming.	SAT	2007	DBLP DOI BibTeX RDF
1	Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà	Mapping CSP into Many-Valued SAT.	SAT	2007	DBLP DOI BibTeX RDF
1	Dominik Scheder, Philipp Zumstein	Satisfiability with Exponential Families.	SAT	2007	DBLP DOI BibTeX RDF	polynomial circuits, NP-hardness, satisfiability, context-free grammars, VC-dimension
1	Martin Lukasiewycz, Michael Glaß, Christian Haubelt, Jürgen Teich	Solving Multi-objective Pseudo-Boolean Problems.	SAT	2007	DBLP DOI BibTeX RDF
1	Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001	On the Boolean Connectivity Problem for Horn Relations.	SAT	2007	DBLP DOI BibTeX RDF
1	Knot Pipatsrisawat, Adnan Darwiche	A Lightweight Component Caching Scheme for Satisfiability Solvers.	SAT	2007	DBLP DOI BibTeX RDF
1	Fadi A. Aloul, Nagarajan Kandasamy	Sensor Deployment for Failure Diagnosis in Networked Aerial Robots: A Satisfiability-Based Approach.	SAT	2007	DBLP DOI BibTeX RDF	0-1 ILP, UAV networks, distributed systems, fault diagnosis, SAT
1	Allen Van Gelder	Verifying Propositional Unsatisfiability: Pitfalls to Avoid.	SAT	2007	DBLP DOI BibTeX RDF
1	Stefan Szeider	Matched Formulas and Backdoor Sets.	SAT	2007	DBLP DOI BibTeX RDF
1	Stefan Porschen, Ewald Speckenmeyer	Algorithms for Variable-Weighted 2-SAT and Dual Problems.	SAT	2007	DBLP DOI BibTeX RDF	weighted satisfiability, edge cover, graph factor, NP-hardness, optimization problem, perfect matching
1	Toni Jussila, Armin Biere, Carsten Sinz, Daniel Kröning, Christoph M. Wintersteiger	A First Step Towards a Unified Proof Checker for QBF.	SAT	2007	DBLP DOI BibTeX RDF
1	Joshua Buresh-Oppenheim, David G. Mitchell	Minimum 2CNF Resolution Refutations in Polynomial Time.	SAT	2007	DBLP DOI BibTeX RDF

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