|
|
Conferences in DBLP
- Michael R. Dransfield, V. Wiktor Marek, Miroslaw Truszczynski
Satisfiability and Computing van der Waerden Numbers. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:1-13 [Conf]
- Hubie Chen
An Algorithm for SAT Above the Threshold. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:14-24 [Conf]
- Ian P. Gent, Enrico Giunchiglia, Massimo Narizzano, Andrew G. D. Rowley, Armando Tacchella
Watched Data Structures for QBF Solvers. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:25-36 [Conf]
- Eugene Goldberg, Yakov Novikov
How Good Can a Resolution Based SAT-solver Be? [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:37-52 [Conf]
- Xiao Yu Li, Matthias F. M. Stallmann, Franc Brglez
A Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:53-68 [Conf]
- Youichi Hanatani, Takashi Horiyama, Kazuo Iwama
Density Condensation of Boolean Formulas. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:69-77 [Conf]
- Edmund M. Clarke, Muralidhar Talupur, Helmut Veith, Dong Wang
SAT Based Predicate Abstraction for Hardware Verification. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:78-92 [Conf]
- Hans Kleine Büning, K. Subramani, Xishun Zhao
On Boolean Models for Quantified Boolean Horn Formulas. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:93-104 [Conf]
- Steven David Prestwich
Local Search on SAT-encoded Colouring Problems. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:105-119 [Conf]
- Guilhem Semerjian, Rémi Monasson
A Study of Pure Random Walk on Random Satisfiability Problems with "Physical" Methods. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:120-134 [Conf]
- Hans van Maaren, Linda van Norden
Hidden Threshold Phenomena for Fixed-Density SAT-formulae. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:135-149 [Conf]
- Sven Baumer, Rainer Schuler
Improving a Probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:150-161 [Conf]
- Elizabeth Broering, Satyanarayana V. Lokam
Width-Based Algorithms for SAT and CIRCUIT-SAT: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:162-171 [Conf]
- Stefan Porschen, Bert Randerath, Ewald Speckenmeyer
Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:172-187 [Conf]
- Stefan Szeider
On Fixed-Parameter Tractable Parameterizations of SAT. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:188-202 [Conf]
- Giorgio Parisi
On the Probabilistic Approach to the Random Satisfiability Problem. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:203-213 [Conf]
- Uwe Egly, Martina Seidl, Hans Tompits, Stefan Woltran, Michael Zolda
Comparing Different Prenexing Strategies for Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:214-228 [Conf]
- Renato Bruni
Solving Error Correction for Large Data Sets by Means of a SAT Solver. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:229-241 [Conf]
- Ashish Sabharwal, Paul Beame, Henry A. Kautz
Using Problem Structure for Efficient Clause Learning. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:242-256 [Conf]
- Alessandro Armando, Luca Compagna
Abstraction-Driven SAT-based Analysis of Security Protocols. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:257-271 [Conf]
- Sarfraz Khurshid, Darko Marinov, Ilya Shlyakhter, Daniel Jackson
A Case for Efficient Solution Enumeration. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:272-286 [Conf]
- Lintao Zhang, Sharad Malik
Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:287-298 [Conf]
- Christian Bessière, Emmanuel Hebrard, Toby Walsh
Local Consistencies in SAT. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:299-314 [Conf]
- Per Bjesse, James H. Kukula, Robert F. Damiano, Ted Stanion, Yunshan Zhu
Guiding SAT Diagnosis with Tree Decompositions. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:315-329 [Conf]
- Ryan Williams
On Computing k-CNF Formula Properties. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:330-340 [Conf]
- Fahiem Bacchus, Jonathan Winter
Effective Preprocessing with Hyper-Resolution and Equality Reduction. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:341-355 [Conf]
- Hans Kleine Büning, Xishun Zhao
Read-Once Unit Resolution. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:356-369 [Conf]
- Lyndon Drake, Alan M. Frisch
The Interaction Between Inference and Branching Heuristics. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:370-382 [Conf]
- Daniele Pretolani
Hypergraph Reductions and Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:383-397 [Conf]
- John V. Franco, Michal Kouril, John S. Schlipf, Jeffrey Ward, Sean Weaver, Michael Dransfield, W. Mark Vanfleet
SBSAT: a State-Based, BDD-Based Satisfiability Solver. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:398-410 [Conf]
- Maher N. Mneimneh, Karem A. Sakallah
Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:411-425 [Conf]
- Oliver Kullmann
The Combinatorics of Conflicts between Clauses. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:426-440 [Conf]
- Marc Herbstritt, Bernd Becker
Conflict-Based Selection of Branching Rules. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:441-451 [Conf]
- Daniel Le Berre, Laurent Simon
The Essentials of the SAT 2003 Competition. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:452-467 [Conf]
- Daniel Le Berre, Laurent Simon, Armando Tacchella
Challenges in the QBF Arena: the SAT'03 Evaluation of QBF Solvers. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:468-485 [Conf]
- Gilles Dequen, Olivier Dubois
kcnfs: An Efficient Solver for Random k-SAT Formulae. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:486-501 [Conf]
- Niklas Eén, Niklas Sörensson
An Extensible SAT-solver. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:502-518 [Conf]
- Alfredo Braunstein, Riccardo Zecchina
Survey and Belief Propagation on Random K-SAT. [Citation Graph (0, 0)][DBLP]
SAT, 2003, pp:519-528 [Conf]
|
