Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Ravi Gummadi, N. S. Narayanaswamy, Venkatakrishnan Ramaswamy |
Algorithms for Satisfiability using Independent Sets of Variables. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Armin Biere |
Resolve and Expand. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Naomi Nishimura, Prabhakar Ragde, Stefan Szeider |
Detecting Backdoor Sets with Respect to Horn and Binary Clauses. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Marco Maratea |
A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Yannet Interian |
Approximation Algorithm for Random MAX-kSAT. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Dave A. D. Tompkins, Holger H. Hoos |
UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT & MAX-SAT. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Carsten Sinz |
Visualizing the Internal Structure of SAT Instances (Preliminary Report) |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Steven D. Prestwich, Colin Quirke |
Local Search for Very Large SAT Problems. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Zhuo Huang, Hantao Zhang 0001, Jian Zhang 0001 |
Improving First-order Model Searching by Propositional Reasoning and Lemma Learning. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Marijn Heule, Hans van Maaren |
Aligning CNF- and Equivalence-reasoning. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Harold S. Connamacher |
A Random Constraint Satisfaction Problem That Seems Hard for DPLL. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Renato Bruni, Andrea Santori |
Adding a New Conflict Based Branching Heuristic in two Evolved DPLL SAT Solvers. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Daijue Tang, Yinlei Yu, Darsh Ranjan, Sharad Malik |
Analysis of Search Based Algorithms for Satisfiability of Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Gilles Audemard, Bertrand Mazure, Lakhdar Sais |
Dealing with Symmetries in Quantified Boolean Formulas. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Guoqiang Pan, Moshe Y. Vardi |
Search vs. Symbolic Techniques in Satisfiability Solving. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Ling Zhao, Martin Müller 0003 |
Game-SAT: A Preliminary Report. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Miroslav N. Velev |
Encoding Global Unobservability for Efficient Translation to SAT. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Evgeny Dantsin, Alexander Wolpert |
Derandomization of Schuler's Algorithm for SAT. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Shlomo Hoory, Stefan Szeider |
Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Inês Lynce, João Marques-Silva 0001 |
On Computing Minimum Unsatisfiable Cores. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Carsten Sinz, Wolfgang Küchlin |
Verifying the On-Line Help System of SIEMENS Magnetic Resonance Tomographs using SAT (Extended Abstract) |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Alex S. Fukunaga |
Efficient Implementations of SAT Local Search. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Sathiamoorthy Subbarayan, Dhiraj K. Pradhan |
NiVER: Non Increasing Variable Elimination Resolution for Preprocessing SAT instances. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Hubie Chen, Víctor Dalmau |
Looking Algebraically at Tractable Quantified Boolean Formulas. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Enrico Giunchiglia, Armando Tacchella (eds.) |
Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5-8, 2003 Selected Revised Papers |
SAT |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Zbigniew Stachniak |
A Note on Satisfying Truth-Value Assignments of Boolean Formulas. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Haixia Jia, Cristopher Moore, Bart Selman |
From Spin Glasses to Hard Satisfiable Formulas. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Nachum Dershowitz, Jieh Hsiang, Guan-Shieng Huang, Daher Kaiss |
Boolean Ring Satisfiability. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Hans Kleine Büning, Xishun Zhao |
Equivalence Models for Quantified Boolean Formulas. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Lengning Liu, Miroslaw Truszczynski |
Local Search with Bootstrapping. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | HoonSang Jin, Fabio Somenzi |
CirCUs: A Hybrid Satisfiability Solver. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Marco Benedetti, Sara Bernardini |
Incremental Compilation-to-SAT Procedures. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Darsh Ranjan, Daijue Tang, Sharad Malik |
A Comparative Study of 2QBF Algorithms. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Olivier Bailleux, Yacine Boufkhad |
Full CNF Encoding: The Counting Constraints Case. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Tian Sang, Fahiem Bacchus, Paul Beame, Henry A. Kautz, Toniann Pitassi |
Combining Component Caching and Clause Learning for Effective Model Counting. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Éric Grégoire, Richard Ostrowski, Bertrand Mazure, Lakhdar Sais |
Automatic Extraction of Functional Dependencies. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Hantao Zhang 0001, Dapeng Li, Haiou Shen |
A SAT Based Scheduler for Tournament Schedules. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Stefan Porschen, Ewald Speckenmeyer |
Worst Case Bounds for some NP-Complete Modified Horn-SAT Problems. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Christian Thiffault, Fahiem Bacchus, Toby Walsh |
Solving Non-clausal Formulas with DPLL search. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Daniel Sheridan |
The Optimality of a Fast CNF Conversion and its Use with SAT. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Elsa Carvalho, João Marques-Silva 0001 |
Using Rewarding Mechanisms for Improving Branching Heuristics. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer |
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. |
SAT |
2004 |
DBLP BibTeX RDF |
|
1 | Oliver Kullmann |
The Combinatorics of Conflicts between Clauses. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Hans Kleine Büning, Xishun Zhao |
Read-Once Unit Resolution. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Ryan Williams 0001 |
On Computing k-CNF Formula Properties. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Sven Baumer, Rainer Schuler |
Improving a Probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Elizabeth Broering, Satyanarayana V. Lokam |
Width-Based Algorithms for SAT and CIRCUIT-SAT: (Extended Abstract). |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Stefan Porschen, Bert Randerath, Ewald Speckenmeyer |
Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Hans van Maaren, Linda van Norden |
Hidden Threshold Phenomena for Fixed-Density SAT-formulae. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
Horn, graph-3-coloring, satisfiability, thresholds, 3-SAT |
1 | Hans Kleine Büning, K. Subramani 0001, Xishun Zhao |
On Boolean Models for Quantified Boolean Horn Formulas. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Michael R. Dransfield, V. Wiktor Marek, Miroslaw Truszczynski |
Satisfiability and Computing van der Waerden Numbers. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Gilles Dequen, Olivier Dubois 0002 |
kcnfs: An Efficient Solver for Random k-SAT Formulae. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Ian P. Gent, Enrico Giunchiglia, Massimo Narizzano, Andrew G. D. Rowley, Armando Tacchella |
Watched Data Structures for QBF Solvers. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Lyndon Drake, Alan M. Frisch |
The Interaction Between Inference and Branching Heuristics. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Daniele Pretolani |
Hypergraph Reductions and Satisfiability Problems. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Alfredo Braunstein, Riccardo Zecchina |
Survey and Belief Propagation on Random K-SAT. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Alessandro Armando, Luca Compagna |
Abstraction-Driven SAT-based Analysis of Security Protocols. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Hubie Chen |
An Algorithm for SAT Above the Threshold. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Sarfraz Khurshid, Darko Marinov, Ilya Shlyakhter, Daniel Jackson 0001 |
A Case for Efficient Solution Enumeration. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Maher N. Mneimneh, Karem A. Sakallah |
Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Guilhem Semerjian, Rémi Monasson |
A Study of Pure Random Walk on Random Satisfiability Problems with "Physical" Methods. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Le Berre, Laurent Simon, Armando Tacchella |
Challenges in the QBF Arena: the SAT'03 Evaluation of QBF Solvers. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Steven D. Prestwich |
Local Search on SAT-encoded Colouring Problems. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Per Bjesse, James H. Kukula, Robert F. Damiano, Ted Stanion, Yunshan Zhu |
Guiding SAT Diagnosis with Tree Decompositions. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Renato Bruni |
Solving Error Correction for Large Data Sets by Means of a SAT Solver. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Stefan Szeider |
On Fixed-Parameter Tractable Parameterizations of SAT. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Giorgio Parisi |
On the Probabilistic Approach to the Random Satisfiability Problem. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Le Berre, Laurent Simon |
The Essentials of the SAT 2003 Competition. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Lintao Zhang, Sharad Malik |
Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | John V. Franco, Michal Kouril, John S. Schlipf, Jeffrey Ward, Sean A. Weaver, Michael R. Dransfield, W. Mark Vanfleet |
SBSAT: a State-Based, BDD-Based Satisfiability Solver. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Ashish Sabharwal, Paul Beame, Henry A. Kautz |
Using Problem Structure for Efficient Clause Learning. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Edmund M. Clarke, Muralidhar Talupur, Helmut Veith, Dong Wang |
SAT Based Predicate Abstraction for Hardware Verification. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Fahiem Bacchus, Jonathan Winter |
Effective Preprocessing with Hyper-Resolution and Equality Reduction. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Niklas Eén, Niklas Sörensson |
An Extensible SAT-solver. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Eugene Goldberg, Yakov Novikov |
How Good Can a Resolution Based SAT-solver Be? |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Xiao Yu Li, Matthias F. M. Stallmann, Franc Brglez |
A Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Youichi Hanatani, Takashi Horiyama, Kazuo Iwama |
Density Condensation of Boolean Formulas. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Marc Herbstritt, Bernd Becker 0001 |
Conflict-Based Selection of Branching Rules. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Christian Bessière, Emmanuel Hebrard, Toby Walsh |
Local Consistencies in SAT. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
1 | Uwe Egly, Martina Seidl, Hans Tompits, Stefan Woltran, Michael Zolda |
Comparing Different Prenexing Strategies for Quantified Boolean Formulas. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|