Search results for "SAT"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Carla P. Gomes, Jörg Hoffmann 0001, Ashish Sabharwal, Bart Selman	Short XORs for Model Counting: From Theory to Practice.	SAT	2007	DBLP DOI BibTeX RDF
1	Marko Samer, Stefan Szeider	Backdoor Sets of Quantified Boolean Formulas.	SAT	2007	DBLP DOI BibTeX RDF
1	Martin Davis	SAT: Past and Future.	SAT	2007	DBLP DOI BibTeX RDF
1	Arist Kojevnikov	Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities.	SAT	2007	DBLP DOI BibTeX RDF	integer programming, cutting planes, propositional proof complexity
1	Chu Min Li, Wanxia Wei, Harry Zhang	Combining Adaptive Noise and Look-Ahead in Local Search for SAT.	SAT	2007	DBLP DOI BibTeX RDF
1	Debapratim De, Abishek Kumarasubramanian, Ramarathnam Venkatesan	Inversion Attacks on Secure Hash Functions Using satSolvers.	SAT	2007	DBLP DOI BibTeX RDF
1	Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl	SAT Solving for Termination Analysis with Polynomial Interpretations.	SAT	2007	DBLP DOI BibTeX RDF
1	Alessandro Cimatti, Alberto Griggio, Roberto Sebastiani	A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories.	SAT	2007	DBLP DOI BibTeX RDF
1	Federico Heras, Javier Larrosa, Albert Oliveras	MiniMaxSat: A New Weighted Max-SAT Solver.	SAT	2007	DBLP DOI BibTeX RDF
1	Uwe Bubeck, Hans Kleine Büning	Dependency Quantified Horn Formulas: Models and Complexity.	SAT	2006	DBLP DOI BibTeX RDF
1	Fahiem Bacchus	CSPs: Adding Structure to SAT.	SAT	2006	DBLP DOI BibTeX RDF
1	Su Chen, Tomasz Imielinski, Karin Johnsgard, Donald Smith, Mario Szegedy	A Dichotomy Theorem for Typed Constraint Satisfaction Problems.	SAT	2006	DBLP DOI BibTeX RDF
1	Maria Luisa Bonet, Jordi Levy, Felip Manyà	A Complete Calculus for Max-SAT.	SAT	2006	DBLP DOI BibTeX RDF
1	Mark Chavira, Adnan Darwiche	Encoding CNFs to Empower Component Analysis.	SAT	2006	DBLP DOI BibTeX RDF
1	Horst Samulowitz, Fahiem Bacchus	Binary Clause Reasoning in QBF.	SAT	2006	DBLP DOI BibTeX RDF
1	Hossein M. Sheini, Karem A. Sakallah	From Propositional Satisfiability to Satisfiability Modulo Theories.	SAT	2006	DBLP DOI BibTeX RDF
1	Eric I. Hsu, Sheila A. McIlraith	Characterizing Propagation Methods for Boolean Satisfiability.	SAT	2006	DBLP DOI BibTeX RDF
1	Inês Lynce, João Marques-Silva 0001	SAT in Bioinformatics: Making the Case with Haplotype Inference.	SAT	2006	DBLP DOI BibTeX RDF
1	Arist Kojevnikov, Alexander S. Kulikov	Complexity of Semialgebraic Proofs with Restricted Degree of Falsity.	SAT	2006	DBLP DOI BibTeX RDF
1	Nachum Dershowitz, Ziyad Hanna, Alexander Nadel	A Scalable Algorithm for Minimal Unsatisfiable Core Extraction.	SAT	2006	DBLP DOI BibTeX RDF
1	Yuliya Zabiyaka, Adnan Darwiche	Functional Treewidth: Bounding Complexity in the Presence of Functional Dependencies.	SAT	2006	DBLP DOI BibTeX RDF
1	Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä	A Distribution Method for Solving SAT in Grids.	SAT	2006	DBLP DOI BibTeX RDF
1	Eugene Goldberg	Determinization of Resolution by an Algorithm Operating on Complete Assignments.	SAT	2006	DBLP DOI BibTeX RDF
1	Daijue Tang, Sharad Malik	Solving Quantified Boolean Formulas with Circuit Observability Don't Cares.	SAT	2006	DBLP DOI BibTeX RDF
1	Evgeny Dantsin, Alexander Wolpert	MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s2) Time.	SAT	2006	DBLP DOI BibTeX RDF
1	Oliver Kullmann, Inês Lynce, João Marques-Silva 0001	Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel.	SAT	2006	DBLP DOI BibTeX RDF
1	Himanshu Jain, Constantinos Bartzis, Edmund M. Clarke	Satisfiability Checking of Non-clausal Formulas Using General Matings.	SAT	2006	DBLP DOI BibTeX RDF
1	Hossein M. Sheini, Karem A. Sakallah	A Progressive Simplifier for Satisfiability Modulo Theories.	SAT	2006	DBLP DOI BibTeX RDF
1	Allen Van Gelder	Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs.	SAT	2006	DBLP DOI BibTeX RDF
1	Hans Kleine Büning, Xishun Zhao	Minimal False Quantified Boolean Formulas.	SAT	2006	DBLP DOI BibTeX RDF
1	Robert Nieuwenhuis, Albert Oliveras	On SAT Modulo Theories and Optimization Problems.	SAT	2006	DBLP DOI BibTeX RDF
1	Hantao Zhang 0001	A Complete Random Jump Strategy with Guiding Paths.	SAT	2006	DBLP DOI BibTeX RDF
1	Naomi Nishimura, Prabhakar Ragde, Stefan Szeider	Solving #SAT Using Vertex Covers.	SAT	2006	DBLP DOI BibTeX RDF
1	Ilya Mironov, Lintao Zhang	Applications of SAT Solvers to Cryptanalysis of Hash Functions.	SAT	2006	DBLP DOI BibTeX RDF
1	Zhaohui Fu, Sharad Malik	On Solving the Partial MAX-SAT Problem.	SAT	2006	DBLP DOI BibTeX RDF
1	Marc Thurley	sharpSAT - Counting Models with Advanced Component Caching and Implicit BCP.	SAT	2006	DBLP DOI BibTeX RDF
1	Steven D. Prestwich, Inês Lynce	Local Search for Unsatisfiability.	SAT	2006	DBLP DOI BibTeX RDF
1	Scott Cotton, Oded Maler	Fast and Flexible Difference Constraint Propagation for DPLL(T).	SAT	2006	DBLP DOI BibTeX RDF
1	Roberto Sebastiani, Michele Vescovi	Encoding the Satisfiability of Modal and Description Logics into SAT: The Case Study of K(m)/ALC.	SAT	2006	DBLP DOI BibTeX RDF
1	António Morgado 0001, Paulo J. Matos, Vasco M. Manquinho, João Marques-Silva 0001	Counting Models in Integer Domains.	SAT	2006	DBLP DOI BibTeX RDF
1	Andrei A. Bulatov, Evgeny S. Skvortsov	Efficiency of Local Search.	SAT	2006	DBLP DOI BibTeX RDF
1	Armin Biere, Carla P. Gomes (eds.)	Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings	SAT	2006	DBLP DOI BibTeX RDF
1	Yinlei Yu, Sharad Malik	Lemma Learning in SMT on Linear Constraints.	SAT	2006	DBLP DOI BibTeX RDF
1	Joshua Buresh-Oppenheim, David G. Mitchell	Minimum Witnesses for Unsatisfiable 2CNFs.	SAT	2006	DBLP DOI BibTeX RDF
1	Ashish Sabharwal, Carlos Ansótegui, Carla P. Gomes, Justin W. Hart, Bart Selman	QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency.	SAT	2006	DBLP DOI BibTeX RDF
1	Stefan Porschen, Ewald Speckenmeyer, Bert Randerath	On Linear CNF Formulas.	SAT	2006	DBLP DOI BibTeX RDF	linear CNF formula, edge colouring, linear hypergraph, NP-completeness, satisfiability, latin square
1	Panagiotis Manolios, Yimin Zhang	Implementing Survey Propagation on Graphics Processing Units.	SAT	2006	DBLP DOI BibTeX RDF
1	Osamu Watanabe 0001, Masaki Yamamoto 0001	Average-Case Analysis for the MAX-2SAT Problem.	SAT	2006	DBLP DOI BibTeX RDF
1	Toni Jussila, Carsten Sinz, Armin Biere	Extended Resolution Proofs for Symbolic SAT Solving with Quantification.	SAT	2006	DBLP DOI BibTeX RDF
1	Teresa Alsinet, Felip Manyà, Jordi Planes	Improved Exact Solvers for Weighted Max-SAT.	SAT	2005	DBLP DOI BibTeX RDF
1	Michal Kouril, John V. Franco	Resolution Tunnels for Improved SAT Solver Performance.	SAT	2005	DBLP DOI BibTeX RDF
1	Ian P. Gent, Andrew G. D. Rowley	Local and Global Complete Solution Learning Methods for QBF.	SAT	2005	DBLP DOI BibTeX RDF
1	Nicola Galesi, Neil Thapen	Resolution and Pebbling Games.	SAT	2005	DBLP DOI BibTeX RDF
1	Evgeny Dantsin, Alexander Wolpert	An Improved Upper Bound for SAT.	SAT	2005	DBLP DOI BibTeX RDF
1	Fahiem Bacchus, Toby Walsh (eds.)	Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, St. Andrews, UK, June 19-23, 2005, Proceedings	SAT	2005	DBLP DOI BibTeX RDF
1	Vasco M. Manquinho, João Marques-Silva 0001	On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization.	SAT	2005	DBLP DOI BibTeX RDF
1	Andreas Meier 0002, Volker Sorge	A New Set of Algebraic Benchmark Problems for SAT Solvers.	SAT	2005	DBLP DOI BibTeX RDF
1	Marco Benedetti	Quantifier Trees for QBFs.	SAT	2005	DBLP DOI BibTeX RDF
1	Emmanuel Zarpas	Benchmarking SAT Solvers for Bounded Model Checking.	SAT	2005	DBLP DOI BibTeX RDF
1	Allen Van Gelder	Input Distance and Lower Bounds for Propositional Resolution Proof Length.	SAT	2005	DBLP DOI BibTeX RDF
1	Carsten Sinz, Edda-Maria Dieringer	DPvis - A Tool to Visualize the Structure of SAT Instances.	SAT	2005	DBLP DOI BibTeX RDF
1	Nachum Dershowitz, Ziyad Hanna, Alexander Nadel	A Clause-Based Heuristic for SAT Solvers.	SAT	2005	DBLP DOI BibTeX RDF
1	Matthew D. T. Lewis, Tobias Schubert 0001, Bernd Becker 0001	Speedup Techniques Utilized in Modern SAT Solvers.	SAT	2005	DBLP DOI BibTeX RDF
1	Sakari Seitz, Mikko Alava, Pekka Orponen	Threshold Behaviour of WalkSAT and Focused Metropolis Search on Random 3-Satisfiability.	SAT	2005	DBLP DOI BibTeX RDF
1	Uwe Bubeck, Hans Kleine Büning, Xishun Zhao	Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas.	SAT	2005	DBLP DOI BibTeX RDF
1	Anton Belov, Zbigniew Stachniak	Substitutional Definition of Satisfiability in Classical Propositional Logic.	SAT	2005	DBLP DOI BibTeX RDF
1	Josep Argelich, Felip Manyà	Solving Over-Constrained Problems with SAT Technology.	SAT	2005	DBLP DOI BibTeX RDF
1	Darko Marinov, Sarfraz Khurshid, Suhabe Bugrara, Lintao Zhang, Martin C. Rinard	Optimizations for Compiling Declarative Models into Boolean Formulas.	SAT	2005	DBLP DOI BibTeX RDF
1	Andrew C. Ling, Deshanand P. Singh, Stephen Dean Brown	FPGA Logic Synthesis Using Quantified Boolean Satisfiability.	SAT	2005	DBLP DOI BibTeX RDF
1	Edward A. Hirsch, Sergey I. Nikolenko	Simulating Cutting Plane Proofs with Restricted Degree of Falsity by Resolution.	SAT	2005	DBLP DOI BibTeX RDF
1	Alexander S. Kulikov	Automated Generation of Simplification Rules for SAT and MAXSAT.	SAT	2005	DBLP DOI BibTeX RDF
1	Vijay Durairaj, Priyank Kalla	Variable Ordering for Efficient SAT Search by Analyzing Constraint-Variable Dependencies.	SAT	2005	DBLP DOI BibTeX RDF
1	Chu Min Li, Wenqi Huang	Diversification and Determinism in Local Search for Satisfiability.	SAT	2005	DBLP DOI BibTeX RDF
1	Nachum Dershowitz, Ziyad Hanna, Jacob Katz	Bounded Model Checking with QBF.	SAT	2005	DBLP DOI BibTeX RDF
1	Roman Gershman, Ofer Strichman	Cost-Effective Hyper-Resolution for Preprocessing CNF Formulas.	SAT	2005	DBLP DOI BibTeX RDF
1	Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe	A Branching Heuristics for Quantified Renamable Horn Formulas.	SAT	2005	DBLP DOI BibTeX RDF
1	Xishun Zhao, Hans Kleine Büning	Model-Equivalent Reductions.	SAT	2005	DBLP DOI BibTeX RDF
1	Niklas Eén, Armin Biere	Effective Preprocessing in SAT Through Variable and Clause Elimination.	SAT	2005	DBLP DOI BibTeX RDF
1	Eugene Goldberg	Equivalence Checking of Circuits with Parameterized Specifications.	SAT	2005	DBLP DOI BibTeX RDF
1	Lintao Zhang	On Subsumption Removal and On-the-Fly CNF Simplification.	SAT	2005	DBLP DOI BibTeX RDF
1	Hans van Maaren, Linda van Norden	Sums of Squares, Satisfiability and Maximum Satisfiability.	SAT	2005	DBLP DOI BibTeX RDF
1	Finnegan Southey	Constraint Metrics for Local Search.	SAT	2005	DBLP DOI BibTeX RDF
1	Mark H. Liffiton, Karem A. Sakallah	On Finding All Minimally Unsatisfiable Subformulas.	SAT	2005	DBLP DOI BibTeX RDF
1	Hossein M. Sheini, Karem A. Sakallah	A Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic.	SAT	2005	DBLP DOI BibTeX RDF
1	Tian Sang, Paul Beame, Henry A. Kautz	Heuristics for Fast Exact Model Counting.	SAT	2005	DBLP DOI BibTeX RDF
1	Wei Wei 0040, Bart Selman	A New Approach to Model Counting.	SAT	2005	DBLP DOI BibTeX RDF
1	Maher N. Mneimneh, Inês Lynce, Zaher S. Andraus, João Marques-Silva 0001, Karem A. Sakallah	A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas.	SAT	2005	DBLP DOI BibTeX RDF
1	Daniel Rolf	Derandomization of PPSZ for Unique- k-SAT.	SAT	2005	DBLP DOI BibTeX RDF
1	Steven D. Prestwich	Random Walk with Continuously Smoothed Variable Weights.	SAT	2005	DBLP DOI BibTeX RDF
1	Marijn Heule, Hans van Maaren	Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming.	SAT	2005	DBLP DOI BibTeX RDF
1	Gilles Audemard, Lakhdar Sais	A Symbolic Search Based Approach for Quantified Boolean Formulas.	SAT	2005	DBLP DOI BibTeX RDF	Satisfiability, Binary decision diagram, Quantified boolean formula
1	Magnus Wahlström	Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable.	SAT	2005	DBLP DOI BibTeX RDF
1	Nicola Galesi, Oliver Kullmann	Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank.	SAT	2004	DBLP BibTeX RDF
1	Carlos Ansótegui, Felip Manyà	Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables.	SAT	2004	DBLP BibTeX RDF
1	Danila A. Sinopalnikov	Satisfiability Threshold of the Skewed Random k-SAT.	SAT	2004	DBLP BibTeX RDF
1	Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella	QBF Reasoning on Real-World Instances.	SAT	2004	DBLP BibTeX RDF
1	Jinbo Huang, Adnan Darwiche	Using DPLL for Efficient OBDD Construction.	SAT	2004	DBLP BibTeX RDF
1		SAT 2004 - The Seventh International Conference on Theory and Applications of Satisfiability Testing, 10-13 May 2004, Vancouver, BC, Canada, Online Proceedings	SAT	2004	DBLP BibTeX RDF
1	Vasco M. Manquinho, João Marques-Silva 0001	Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization.	SAT	2004	DBLP BibTeX RDF
1	Matthew D. T. Lewis, Tobias Schubert 0001, Bernd Becker 0001	Early Conflict Detection Based BCP for SAT Solving.	SAT	2004	DBLP BibTeX RDF

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