|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1725 occurrences of 797 keywords
|
|
|
Results
Found 5713 publication records. Showing 5700 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
55 | Yu Hu 0002, Victor Shih, Rupak Majumdar, Lei He 0001 |
Exploiting Symmetries to Speed Up SAT-Based Boolean Matching for Logic Synthesis of FPGAs. |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. |
2008 |
DBLP DOI BibTeX RDF |
|
55 | Daniel Lopez-Escogido, Jose Torres-Jimenez, Eduardo Rodriguez-Tello, Nelson Rangel-Valdez |
Strength Two Covering Arrays Construction Using a SAT Representation. |
MICAI |
2008 |
DBLP DOI BibTeX RDF |
|
55 | Shinya Hiramoto, Masaki Nakanishi, Shigeru Yamashita, Yasuhiko Nakashima |
A Hardware SAT Solver Using Non-chronological Backtracking and Clause Recording Without Overheads. |
ARC |
2007 |
DBLP DOI BibTeX RDF |
|
55 | Gábor Kusper |
Finding Models for Blocked 3-SAT Problems in Linear Time by Systematical Refinement of a Sub-model. |
KI |
2006 |
DBLP DOI BibTeX RDF |
|
55 | Mona Safar, M. Watheq El-Kharashi, Ashraf Salem |
FPGA-Based SAT Solver. |
CCECE |
2006 |
DBLP DOI BibTeX RDF |
|
55 | Héctor Palacios, Hector Geffner |
Mapping Conformant Planning into SAT Through Compilation and Projection. |
CAEPIA |
2005 |
DBLP DOI BibTeX RDF |
|
55 | Hui Xu 0001, Rob A. Rutenbar, Karem A. Sakallah |
sub-SAT: a formulation for relaxed Boolean satisfiability with applications in routing. |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. |
2003 |
DBLP DOI BibTeX RDF |
|
55 | Chris Calabro, Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi |
The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs. |
CCC |
2003 |
DBLP DOI BibTeX RDF |
|
55 | Hui Xu 0001, Rob A. Rutenbar, Karem A. Sakallah |
sub-SAT: a formulation for relaxed boolean satisfiability with applications in routing. |
ISPD |
2002 |
DBLP DOI BibTeX RDF |
|
55 | Mark A. Iwen, Amol Dattatraya Mali |
DSatz: A Directional SAT Solver for Planning. |
ICTAI |
2002 |
DBLP DOI BibTeX RDF |
|
55 | Bistra Dilkina, Carla P. Gomes, Ashish Sabharwal |
Backdoors in the Context of Learning. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
55 | Evgeny S. Skvortsov |
A Theoretical Analysis of Search in GSAT. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
55 | 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 |
55 | HyoJung Han, Fabio Somenzi |
On-the-Fly Clause Improvement. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
55 | 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 |
55 | Inês Lynce, João Marques-Silva 0001 |
Breaking Symmetries in SAT Matrix Models. |
SAT |
2007 |
DBLP DOI BibTeX RDF |
|
55 | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà |
Mapping CSP into Many-Valued SAT. |
SAT |
2007 |
DBLP DOI BibTeX RDF |
|
55 | Fahiem Bacchus |
CSPs: Adding Structure to SAT. |
SAT |
2006 |
DBLP DOI BibTeX RDF |
|
55 | Maria Luisa Bonet, Jordi Levy, Felip Manyà |
A Complete Calculus for Max-SAT. |
SAT |
2006 |
DBLP DOI BibTeX RDF |
|
55 | Inês Lynce, João Marques-Silva 0001 |
SAT in Bioinformatics: Making the Case with Haplotype Inference. |
SAT |
2006 |
DBLP DOI BibTeX RDF |
|
55 | Toni Jussila, Carsten Sinz, Armin Biere |
Extended Resolution Proofs for Symbolic SAT Solving with Quantification. |
SAT |
2006 |
DBLP DOI BibTeX RDF |
|
55 | Emmanuel Zarpas |
Benchmarking SAT Solvers for Bounded Model Checking. |
SAT |
2005 |
DBLP DOI BibTeX RDF |
|
55 | Josep Argelich, Felip Manyà |
Solving Over-Constrained Problems with SAT Technology. |
SAT |
2005 |
DBLP DOI BibTeX RDF |
|
55 | Vijay Durairaj, Priyank Kalla |
Variable Ordering for Efficient SAT Search by Analyzing Constraint-Variable Dependencies. |
SAT |
2005 |
DBLP DOI BibTeX RDF |
|
55 | Niklas Eén, Armin Biere |
Effective Preprocessing in SAT Through Variable and Clause Elimination. |
SAT |
2005 |
DBLP DOI BibTeX RDF |
|
55 | Marco Benedetti, Sara Bernardini |
Incremental Compilation-to-SAT Procedures. |
SAT (Selected Papers |
2004 |
DBLP DOI BibTeX RDF |
|
55 | Danila A. Sinopalnikov |
Satisfiability Threshold of the Skewed Random k-SAT. |
SAT (Selected Papers |
2004 |
DBLP DOI BibTeX RDF |
|
55 | Nicola Galesi, Oliver Kullmann |
Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. |
SAT (Selected Papers |
2004 |
DBLP DOI BibTeX RDF |
|
55 | Sven Baumer, Rainer Schuler |
Improving a Probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
55 | 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 |
|
52 | Arist Kojevnikov, Alexander S. Kulikov, Grigory Yaroslavtsev |
Finding Efficient Circuits Using SAT-Solvers. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
52 | 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 |
|
52 | Kazuo Iwama |
SAT, UNSAT and Coloring. |
SAT |
2008 |
DBLP DOI BibTeX RDF |
|
51 | Marcos Villagra, Benjamín Barán |
Ant Colony Optimization with Adaptive Fitness Function for Satisfiability Testing. |
WoLLIC |
2007 |
DBLP DOI BibTeX RDF |
Adaptive Fitness Function, Local Search, Ant Colony Optimization, SAT |
51 | João Marques-Silva 0001, Inês Lynce |
Towards Robust CNF Encodings of Cardinality Constraints. |
CP |
2007 |
DBLP DOI BibTeX RDF |
|
51 | Ateet Bhalla, Inês Lynce, José T. de Sousa, João Marques-Silva 0001 |
Heuristic-Based Backtracking for Propositional Satisfiability. |
EPIA |
2003 |
DBLP DOI BibTeX RDF |
|
51 | Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah |
Generic ILP versus specialized 0-1 ILP: an update. |
ICCAD |
2002 |
DBLP DOI BibTeX RDF |
|
51 | Hossein M. Sheini, Karem A. Sakallah |
From Propositional Satisfiability to Satisfiability Modulo Theories. |
SAT |
2006 |
DBLP DOI BibTeX RDF |
|
51 | Nachum Dershowitz, Ziyad Hanna, Jacob Katz |
Bounded Model Checking with QBF. |
SAT |
2005 |
DBLP DOI BibTeX RDF |
|
51 | Ravi Gummadi, N. S. Narayanaswamy, Venkatakrishnan Ramaswamy |
Algorithms for Satisfiability Using Independent Sets of Variables. |
SAT (Selected Papers |
2004 |
DBLP DOI BibTeX RDF |
|
51 | Haixia Jia, Cristopher Moore, Bart Selman |
From Spin Glasses to Hard Satisfiable Formulas. |
SAT (Selected Papers |
2004 |
DBLP DOI BibTeX RDF |
|
51 | Sarfraz Khurshid, Darko Marinov, Ilya Shlyakhter, Daniel Jackson 0001 |
A Case for Efficient Solution Enumeration. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
51 | Fahiem Bacchus, Jonathan Winter |
Effective Preprocessing with Hyper-Resolution and Equality Reduction. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
49 | Jun Gu |
Global Optimization for Satisfiability (SAT) Problem. |
IEEE Trans. Knowl. Data Eng. |
1994 |
DBLP DOI BibTeX RDF |
global optimization algorithms, VLSI engineering, DNF local search methods, Universal SAT problem model, UniSAT, discrete SAT problem, Boolean space, unconstrained global optimization problem, real space, direct correspondence, global minimum point, backtracking/resolution procedures, optimisation, inference, inference mechanisms, search problems, automated reasoning, formal logic, CNF, conjunctive normal form, computing theory, satisfiability problem, SAT problem, mathematical logic |
49 | Miquel Bofill, Dídac Busquets, Mateu Villaret |
A declarative approach to robust weighted Max-SAT. |
PPDP |
2010 |
DBLP DOI BibTeX RDF |
max-sat, robustness |
49 | Sama Goliaei, Saeed Jalili |
An Optical Wavelength-Based Solution to the 3-SAT Problem. |
OSC |
2009 |
DBLP DOI BibTeX RDF |
Wavelength-Based Approach, 3-SAT Problem, NP- Complete, Optical Computing, Unconventional Computing |
49 | Clifford R. Johnson |
Automating the DNA computer: solving n-Variable 3-SAT problems. |
Nat. Comput. |
2008 |
DBLP DOI BibTeX RDF |
SAT Computation, DNA Computation, Molecular Computation, Natural Computing |
49 | Stephan Eggersglüß, Rolf Drechsler |
On the Influence of Boolean Encodings in SAT-Based ATPG for Path Delay Faults. |
ISMVL |
2008 |
DBLP DOI BibTeX RDF |
Boolean Encodings, ATPG, SAT, Path Delay Faults |
49 | Ming-e Jing, Dian Zhou, Pushan Tang, Xiaofang Zhou, Hua Zhang 0019 |
Solving SAT problem by heuristic polarity decision-making algorithm. |
Sci. China Ser. F Inf. Sci. |
2007 |
DBLP DOI BibTeX RDF |
complete algorithm, decision-making, DPLL, SAT problem |
49 | Stefan Disch, Christoph Scholl 0001 |
Combinational Equivalence Checking Using Incremental SAT Solving, Output Ordering, and Resets. |
ASP-DAC |
2007 |
DBLP DOI BibTeX RDF |
shared circuit structures, incremental SAT techniques, bounded model checking, combinational equivalence checking |
49 | Domagoj Babic, Jesse D. Bingham, Alan J. Hu |
B-Cubing: New Possibilities for Efficient SAT-Solving. |
IEEE Trans. Computers |
2006 |
DBLP DOI BibTeX RDF |
SAT, Boolean satisfiability, search space pruning |
49 | Josep Argelich, Felip Manyà |
Exact Max-SAT solvers for over-constrained problems. |
J. Heuristics |
2006 |
DBLP DOI BibTeX RDF |
Soft constraints, Solvers, Max-SAT |
49 | Malay K. Ganai, Pranav Ashar, Aarti Gupta, Lintao Zhang, Sharad Malik |
Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver. |
DAC |
2002 |
DBLP DOI BibTeX RDF |
boolean constraint propagation (BCP), bounded model checking (BMC), conjunctive normal form (CNF), boolean satisfiability (SAT) |
49 | Olivier Bailleux, Yacine Boufkhad, Olivier Roussel |
New Encodings of Pseudo-Boolean Constraints into CNF. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
Pseudo-Boolean, SAT translation |
48 | Emad Saad |
Probabilistic Reasoning by SAT Solvers. |
ECSQARU |
2009 |
DBLP DOI BibTeX RDF |
|
48 | Himanshu Jain, Edmund M. Clarke |
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts. |
DAC |
2009 |
DBLP DOI BibTeX RDF |
NNF, verification, Boolean satisfiability, DPLL |
48 | Mona Safar, Mohamed Shalan, M. Watheq El-Kharashi, Ashraf Salem |
Hardware based algorithm for conflict diagnosis in SAT solver. |
AICCSA |
2008 |
DBLP DOI BibTeX RDF |
|
48 | Rolf Drechsler, Görschwin Fey, Sebastian Kinder |
An Integrated Approach for Combining BDD and SAT Provers. |
VLSI Design |
2006 |
DBLP DOI BibTeX RDF |
|
48 | Sean Safarpour, Andreas G. Veneris, Gregg Baeckler, Richard Yuan |
Efficient SAT-based Boolean matching for FPGA technology mapping. |
DAC |
2006 |
DBLP DOI BibTeX RDF |
FPGA technology mapping, Boolean satisfiability, Boolean matching |
48 | Daniele Pretolani |
Probability logic and optimization SAT: The PSAT and CPA models. |
Ann. Math. Artif. Intell. |
2005 |
DBLP DOI BibTeX RDF |
CNF formulas, ideal matrices, probability, logic, directed graphs, propositional satisfiability |
48 | Feng Lu 0002, Madhu K. Iyer, Ganapathy Parthasarathy, Li-C. Wang, Kwang-Ting Cheng, Kuang-Chien Chen |
An Efficient Sequential SAT Solver With Improved Search Strategies. |
DATE |
2005 |
DBLP DOI BibTeX RDF |
|
48 | Federico Heras, Javier Larrosa |
Local Consistency in Weighted CSPs and Inference in Max-SAT. |
CP |
2005 |
DBLP DOI BibTeX RDF |
|
48 | Kevin Smyth, Holger H. Hoos, Thomas Stützle |
Iterated Robust Tabu Search for MAX-SAT. |
AI |
2003 |
DBLP DOI BibTeX RDF |
|
48 | Lyndon Drake, Alan M. Frisch, Toby Walsh |
Automatic Generation of Implied Clauses for SAT. |
CP |
2002 |
DBLP DOI BibTeX RDF |
|
48 | Xiaotie Deng, Chan H. Lee, Yunlei Zhao, Hong Zhu 0004 |
(2+ f(n))-SAT and Its Properties. |
COCOON |
2002 |
DBLP DOI BibTeX RDF |
|
48 | John Thornton 0001, Stuart Bain, Abdul Sattar 0001, Duc Nghia Pham |
A Two Level Local Search for MAX-SAT Problems with Hard and Soft Constraints. |
Australian Joint Conference on Artificial Intelligence |
2002 |
DBLP DOI BibTeX RDF |
|
48 | Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue |
Effective SAT Planning by Speculative Computation. |
Australian Joint Conference on Artificial Intelligence |
2002 |
DBLP DOI BibTeX RDF |
|
48 | Russell Impagliazzo, Ramamohan Paturi |
Complexity of k-SAT. |
CCC |
1999 |
DBLP DOI BibTeX RDF |
NP-completeness, Satisfiability, Reductions, Complexity Theory |
48 | Alexandra Goultiaeva, Vicki Iverson, Fahiem Bacchus |
Beyond CNF: A Circuit-Based QBF Solver. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
48 | Anton Belov, Zbigniew Stachniak |
Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
48 | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy |
Solving (Weighted) Partial MaxSAT through Satisfiability Testing. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
48 | Carsten Sinz, Markus Iser |
Problem-Sensitive Restart Heuristics for the DPLL Procedure. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
48 | Knot Pipatsrisawat, Adnan Darwiche |
Width-Based Restart Policies for Clause-Learning Satisfiability Solvers. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
48 | Shai Haim, Toby Walsh |
Restart Strategy Selection Using Machine Learning Techniques. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
48 | Yury Chebiryak, Thomas Wahl, Daniel Kroening, Leopold Haller |
Finding Lean Induced Cycles in Binary Hypercubes. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
48 | Lukas Kroc, Ashish Sabharwal, Bart Selman |
Relaxed DPLL Search for MaxSAT. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
48 | 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 |
|
48 | Vadim Ryvchin, Ofer Strichman |
Local Restarts. |
SAT |
2008 |
DBLP DOI BibTeX RDF |
|
48 | Stephan Kottler, Michael Kaufmann 0001, Carsten Sinz |
Computation of Renameable Horn Backdoors. |
SAT |
2008 |
DBLP DOI BibTeX RDF |
|
48 | 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 |
|
48 | 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 |
|
48 | Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä |
A Distribution Method for Solving SAT in Grids. |
SAT |
2006 |
DBLP DOI BibTeX RDF |
|
48 | 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 |
|
48 | Carsten Sinz, Edda-Maria Dieringer |
DPvis - A Tool to Visualize the Structure of SAT Instances. |
SAT |
2005 |
DBLP DOI BibTeX RDF |
|
48 | Nachum Dershowitz, Ziyad Hanna, Alexander Nadel |
A Clause-Based Heuristic for SAT Solvers. |
SAT |
2005 |
DBLP DOI BibTeX RDF |
|
48 | Matthew D. T. Lewis, Tobias Schubert 0001, Bernd Becker 0001 |
Speedup Techniques Utilized in Modern SAT Solvers. |
SAT |
2005 |
DBLP DOI BibTeX RDF |
|
48 | Evgeny Dantsin, Alexander Wolpert |
Derandomization of Schuler's Algorithm for SAT. |
SAT (Selected Papers |
2004 |
DBLP DOI BibTeX RDF |
|
48 | Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Marco Maratea |
A SAT-Based Decision Procedure for the Boolean Combination of Difference Constraints. |
SAT (Selected Papers |
2004 |
DBLP DOI BibTeX RDF |
|
48 | 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 |
|
48 | Daniel Le Berre, Laurent Simon |
The Essentials of the SAT 2003 Competition. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
46 | Chris Calabro, Ramamohan Paturi |
k-SAT Is No Harder Than Decision-Unique-k-SAT. |
CSR |
2009 |
DBLP DOI BibTeX RDF |
unique satisfiability, independent set, quantified Boolean formulas, hitting set, k-SAT, exponential complexity |
46 | Adi Avidor, Uri Zwick |
Approximating MIN 2-SAT and MIN 3-SAT. |
Theory Comput. Syst. |
2005 |
DBLP DOI BibTeX RDF |
|
46 | Armin Biere, Mathias Fleury, Nils Froleyks, Marijn J. H. Heule |
The SAT Museum. |
POS@SAT |
2023 |
DBLP BibTeX RDF |
|
46 | Vincent Vallade, Julien Sopena, Souheib Baarir |
Enhancing State-of-the-Art Parallel SAT Solvers Through Optimized Sharing Policies. |
POS@SAT |
2023 |
DBLP BibTeX RDF |
|
46 | Sebastiaan Brand, Tim Coopmans, Alfons Laarman |
Quantum Graph-State Synthesis with SAT. |
POS@SAT |
2023 |
DBLP BibTeX RDF |
|
46 | Yoichiro Iida, Tomohiro Sonobe, Mary Inaba |
An Empirical Study of the Effect of Learnt Clause on the Structural Measures of SAT problems. |
POS@SAT |
2023 |
DBLP BibTeX RDF |
|
46 | Stepan Kochemazov, Alexey Ignatiev, João Marques-Silva 0001 |
Assessing Progress in SAT Solvers Through the Lens of Incremental SAT. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
46 | Gilles Audemard, Loïc Paulevé, Laurent Simon |
SAT Heritage: A Community-Driven Effort for Archiving, Building and Running More Than Thousand SAT Solvers. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
46 | Mate Soos, Raghav Kulkarni, Kuldeep S. Meel |
CrystalBall: Gazing in the Black Box of SAT Solving. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
46 | Daniel Selsam, Nikolaj S. Bjørner |
Guiding High-Performance SAT Solvers with Unsat-Core Predictions. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
Displaying result #101 - #200 of 5700 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ >>] |
|