The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for SAT with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1958-1988 (17) 1989-1992 (19) 1993-1994 (25) 1995 (18) 1996 (31) 1997 (33) 1998 (34) 1999 (60) 2000 (97) 2001 (103) 2002 (148) 2003 (220) 2004 (307) 2005 (314) 2006 (256) 2007 (326) 2008 (324) 2009 (291) 2010 (223) 2011 (179) 2012 (208) 2013 (191) 2014 (217) 2015 (167) 2016 (207) 2017 (189) 2018 (205) 2019 (34)
Publication types (Num. hits)
article(1174) book(2) incollection(35) inproceedings(3175) phdthesis(34) proceedings(23)
Venues (Conferences, Journals, ...)
SAT(611) CoRR(276) CP(138) DATE(70) DAC(67) ICCAD(54) ICTAI(53) AAAI(48) CAV(47) IJCAI(45) IEEE Trans. on CAD of Integrat...(42) TACAS(40) JSAT(39) ASP-DAC(38) FMCAD(38) Electronic Colloquium on Compu...(36) More (+10 of total 951)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1731 occurrences of 797 keywords

Results
Found 4453 publication records. Showing 4443 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
111Weixiong Zhang Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT. Search on Bibsonomy CP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
109Malay K. Ganai, Aarti Gupta, Zijiang Yang, Pranav Ashar Efficient distributed SAT and SAT-based distributed Bounded Model Checking. Search on Bibsonomy STTT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Distributed-SAT, Parallel SAT, Model Checking, Formal Verification, SAT, BMC
104Kei Ohmura, Kazunori Ueda c-sat: A Parallel SAT Solver for Clusters. Search on Bibsonomy SAT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
101Konstantinos Georgiou, Periklis A. Papakonstantinou Complexity and Algorithms for Well-Structured k-SAT Instances. Search on Bibsonomy SAT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
98Zhaohui Fu, Sharad Malik On Solving the Partial MAX-SAT Problem. Search on Bibsonomy SAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
98Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà, Carla P. Gomes Capturing Structure with Satisfiability. Search on Bibsonomy CP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
97Tianyan Deng, Daoyun Xu Hardness of Approximation Algorithms on k-SAT and (k, s)-SAT Problems. Search on Bibsonomy ICYCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
87Florian Letombe, João Marques-Silva Improvements to Hybrid Incremental SAT Algorithms. Search on Bibsonomy SAT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
87Jinshu Li, Heyong Wang, Jing Liu 0006, Licheng Jiao Solving SAT problem with a multiagent evolutionary algorithm. Search on Bibsonomy IEEE Congress on Evolutionary Computation The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
87Jingchao Chen Building a Hybrid SAT Solver via Conflict-Driven, Look-Ahead and XOR Reasoning Techniques. Search on Bibsonomy SAT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Conflict-driven, XOR reasoning, Hybrid solving technique, search pruning technique, Look-ahead, Boolean satisfiability (SAT)
85Alessandro Armando, Luca Compagna, Pierre Ganty SAT-Based Model-Checking of Security Protocols Using Planning Graph Analysis. Search on Bibsonomy FME The full citation details ... 2003 DBLP  DOI  BibTeX  RDF SAT encodings, security protocols, bounded model-checking, SAT-solvers
82Fadi A. Aloul, Arathi Ramani, Karem A. Sakallah, Igor L. Markov Solution and Optimization of Systems of Pseudo-Boolean Constraints. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Pseudo Boolean (PB), Max-ONE, Global Routing, Conjunctive Normal Form (CNF), Backtrack Search, Integer Linear Programming (ILP), Max-SAT, Boolean Satisfiability (SAT)
80Louise Leenen, Anbulagan, Thomas Meyer 0002, Aditya K. Ghose Modeling and Solving Semiring Constraint Satisfaction Problems by Transformation to Weighted Semiring Max-SAT. Search on Bibsonomy Australian Conference on Artificial Intelligence The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
80Tobias Eibach, Enrico Pilz, Gunnar Völkel Attacking Bivium Using SAT Solvers. Search on Bibsonomy SAT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Rsat, Bivium, Gröbner Base, Cryptography, Application, Stream Cipher, BDD, SAT Solver, eSTREAM, Trivium
79Yacine Boufkhad, Olivier Dubois 0002, Yannet Interian, Bart Selman Regular Random k-SAT: Properties of Balanced Formulas. Search on Bibsonomy J. Autom. Reasoning The full citation details ... 2005 DBLP  DOI  BibTeX  RDF regular, satisfiability, phase transition, Boolean formulae, k-SAT
77Josep Argelich, Felip Manyà Partial Max-SAT Solvers with Clause Learning. Search on Bibsonomy SAT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
77Robert Nieuwenhuis SAT Modulo Theories: Enhancing SAT with Special-Purpose Algorithms. Search on Bibsonomy SAT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
76Yogesh S. Mahajan, Zhaohui Fu, Sharad Malik Zchaff2004: An Efficient SAT Solver. Search on Bibsonomy SAT (Selected Papers The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
76Daniel Le Berre, Laurent Simon Fifty-Five Solvers in Vancouver: The SAT 2004 Competition. Search on Bibsonomy SAT (Selected Papers The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
75Tseren-Onolt Ishdorj, Alberto Leporati Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources. Search on Bibsonomy Natural Computing The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Pre-computed resourses, SAT, Membrane computing, Spiking neural P systems, 3-SAT
74Darko Marinov, Sarfraz Khurshid, Suhabe Bugrara, Lintao Zhang, Martin C. Rinard Optimizations for Compiling Declarative Models into Boolean Formulas. Search on Bibsonomy SAT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
73Mark H. Liffiton, Karem A. Sakallah Generalizing Core-Guided Max-SAT. Search on Bibsonomy SAT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
73Mate Soos, Karsten Nohl, Claude Castelluccia Extending SAT Solvers to Cryptographic Problems. Search on Bibsonomy SAT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
73Maarten Mariën, Johan Wittocx, Marc Denecker, Maurice Bruynooghe SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions. Search on Bibsonomy SAT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
73Pavel Surynek Solving Difficult SAT Instances Using Greedy Clique Decomposition. Search on Bibsonomy SARA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF difficult instances, search, consistency, SAT, clique
73Stefan Porschen, Tatjana Schmidt On Some SAT-Variants over Linear Formulas. Search on Bibsonomy SOFSEM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF not-all-equal satisfiability, exact satisfiability, linear formula, linear hypergraph, bicolorability
73Richard Chang, Suresh Purini Amplifying ZPP^SAT[1] and the Two Queries Problem. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2008 DBLP  DOI  BibTeX  RDF ZPP, amplification, bounded queries
73Olivier Bailleux, Pierre Marquis Some Computational Aspects of distance-sat. Search on Bibsonomy J. Autom. Reasoning The full citation details ... 2006 DBLP  DOI  BibTeX  RDF computational complexity, satisfiability
73Andreas Goerdt, André Lanka On the Hardness and Easiness of Random 4-SAT Formulas. Search on Bibsonomy ISAAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
73Eran Halperin, Uri Zwick Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs. Search on Bibsonomy IPCO The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
73Federico Heras, Javier Larrosa A Max-SAT Inference-Based Pre-processing for Max-Clique. Search on Bibsonomy SAT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Max-clique, Inference, Max-SAT
72Dave A. D. Tompkins, Holger H. Hoos UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT. Search on Bibsonomy SAT (Selected Papers The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
72Bernard Jurkowiak, Chu Min Li, Gil Utard A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers. Search on Bibsonomy J. Autom. Reasoning The full citation details ... 2005 DBLP  DOI  BibTeX  RDF parallelism, automated theorem proving, SAT problem
70Niklas Eén, Alan Mishchenko, Niklas Sörensson Applying Logic Synthesis for Speeding Up SAT. Search on Bibsonomy SAT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
70Federico Heras, Javier Larrosa, Albert Oliveras MiniMaxSat: A New Weighted Max-SAT Solver. Search on Bibsonomy SAT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
70Lintao Zhang, Sharad Malik Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms. Search on Bibsonomy SAT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
70Niklas Eén, Niklas Sörensson An Extensible SAT-solver. Search on Bibsonomy SAT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
70Stefan Szeider The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT. Search on Bibsonomy SAT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
69Sathiamoorthy Subbarayan, Dhiraj K. Pradhan NiVER: Non-increasing Variable Elimination Resolution for Preprocessing SAT Instances. Search on Bibsonomy SAT (Selected Papers The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
69Ben Browning, Anja Remshagen A SAT-based solver for Q-ALL SAT. Search on Bibsonomy ACM Southeast Regional Conference The full citation details ... 2006 DBLP  DOI  BibTeX  RDF learning, logic programming, quantified Boolean formula
69Franc Brglez, Xiao Yu Li, Matthias F. M. Stallmann On SAT instance classes and a method for reliable performance experiments with SAT solvers. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF exponential and heavy-tail distributions, reliability function, satisfiability, experimental design, equivalence classes, conjunctive normal form
69Malay K. Ganai, Aarti Gupta, Zijiang Yang, Pranav Ashar Efficient Distributed SAT and SAT-Based Distributed Bounded Model Checking. Search on Bibsonomy CHARME The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
68Juan Frausto Solís, Marco Antonio Cruz-Chavez A Reduced Codification for the Logical Representation of Job Shop Scheduling Problems. Search on Bibsonomy ICCSA (4) The full citation details ... 2004 DBLP  DOI  BibTeX  RDF the propositional satisfiability problem (SAT), Latest starting time, SAT formula, Job shop scheduling
67Dominik Scheder, Philipp Zumstein Satisfiability with Exponential Families. Search on Bibsonomy SAT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF polynomial circuits, NP-hardness, satisfiability, context-free grammars, VC-dimension
67António Morgado, Paulo J. Matos, Vasco M. Manquinho, João P. Marques Silva Counting Models in Integer Domains. Search on Bibsonomy SAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
67Yinlei Yu, Sharad Malik Lemma Learning in SMT on Linear Constraints. Search on Bibsonomy SAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
67Roman Gershman, Ofer Strichman Cost-Effective Hyper-Resolution for Preprocessing CNF Formulas. Search on Bibsonomy SAT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
67Hossein M. Sheini, Karem A. Sakallah A Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic. Search on Bibsonomy SAT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
67Maria Luisa Bonet, Katherine St. John Efficiently Calculating Evolutionary Tree Measures Using SAT. Search on Bibsonomy SAT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
67Stephan Kottler, Michael Kaufmann 0001, Carsten Sinz A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors. Search on Bibsonomy SAT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
67John D. Davis, Zhangxi Tan, Fang Yu, Lintao Zhang Designing an Efficient Hardware Implication Accelerator for SAT Solving. Search on Bibsonomy SAT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
67Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà Modelling Max-CSP as Partial Max-SAT. Search on Bibsonomy SAT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
67Josep Argelich, Chu Min Li, Felip Manyà A Preprocessor for Max-SAT Solvers. Search on Bibsonomy SAT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
67Armin Biere Adaptive Restart Strategies for Conflict Driven SAT Solvers. Search on Bibsonomy SAT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
67Eugene Goldberg A Decision-Making Procedure for Resolution-Based SAT-Solvers. Search on Bibsonomy SAT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
67Elizabeth Broering, Satyanarayana V. Lokam Width-Based Algorithms for SAT and CIRCUIT-SAT: (Extended Abstract). Search on Bibsonomy SAT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
66Pablo San Segundo, Cristóbal Tapia, Julio Puente, Diego Rodríguez-Losada A New Exact Bit-Parallel Algorithm for SAT. Search on Bibsonomy ICTAI (2) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
66Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Fausto Giunchiglia, Armando Tacchella SAT-Based Decision Procedures for Automated Reasoning: A Unifying Perspective. Search on Bibsonomy Mechanizing Mathematical Reasoning The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
66Dave A. D. Tompkins, Holger H. Hoos Scaling and Probabilistic Smoothing: Dynamic Local Search for Unweighted MAX-SAT. Search on Bibsonomy Canadian Conference on AI The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
66Ateet Bhalla, Inês Lynce, José T. de Sousa, João P. Marques Silva Heuristic Backtracking Algorithms for SAT. Search on Bibsonomy MTV The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
65Qi Zhu 0002, Nathan Kitchen, Andreas Kuehlmann, Alberto L. Sangiovanni-Vincentelli SAT sweeping with local observability don't-cares. Search on Bibsonomy DAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF SAT sweeping, and/inverter graphs, observability
64Gábor Kusper Solving the resolution-free SAT problem by submodel propagation in linear time. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF resolution-free SAT, submodel propagation, Unicorn-SAT, SAT
64Hidetomo Nabeshima, Katsumi Inoue, Hiromasa Haneda Implementing an action language using a SAT solver. Search on Bibsonomy ICTAI The full citation details ... 2000 DBLP  DOI  BibTeX  RDF planning algorithms, plan search space, planning graph, SAT planning, AMP, domain description, Java, Java, data structures, data structure, planning (artificial intelligence), computability, inference mechanisms, satisfiability problem, SAT solver, reasoning about action, model generation, action language
63Moshe Y. Vardi Symbolic Techniques in Propositional Satisfiability Solving. Search on Bibsonomy SAT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
63Alexander Hertel, Philipp Hertel, Alasdair Urquhart Formalizing Dangerous SAT Encodings. Search on Bibsonomy SAT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
63Robert Nieuwenhuis, Albert Oliveras On SAT Modulo Theories and Optimization Problems. Search on Bibsonomy SAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
63Ilya Mironov, Lintao Zhang Applications of SAT Solvers to Cryptanalysis of Hash Functions. Search on Bibsonomy SAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
63Edmund M. Clarke, Muralidhar Talupur, Helmut Veith, Dong Wang SAT Based Predicate Abstraction for Hardware Verification. Search on Bibsonomy SAT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
63Gilles Dequen, Olivier Dubois 0002 kcnfs: An Efficient Solver for Random k-SAT Formulae. Search on Bibsonomy SAT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
63Ryan Williams 0001 Time-Space Tradeoffs for Counting NP Solutions Modulo Integers. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
63Per Bjesse Industrial Model Checking Based on Satisfiability Solvers. Search on Bibsonomy SPIN The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
63Gi-Joon Nam, Karem A. Sakallah, Rob A. Rutenbar Hybrid Routing for FPGAs by Integrating Boolean Satisfiability with Geometric Search. Search on Bibsonomy FPL The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
63Eugene Goldberg Boundary Points and Resolution. Search on Bibsonomy SAT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF proof quality, resolution, SAT-solver, boundary points
63Hans van Maaren, Linda van Norden Hidden Threshold Phenomena for Fixed-Density SAT-formulae. Search on Bibsonomy SAT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Horn, graph-3-coloring, satisfiability, thresholds, 3-SAT
62Stefan Porschen, Ewald Speckenmeyer Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems. Search on Bibsonomy SAT (Selected Papers The full citation details ... 2004 DBLP  DOI  BibTeX  RDF (hidden) Horn formula, quadratic formula, minimal vertex cover, NP-completeness, satisfiability, fixed-parameter tractability
62Adi Avidor, Ido Berkovitch, Uri Zwick Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT. Search on Bibsonomy WAOA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
62Habiba Drias, Mohamed Khabzaoui Scatter Search with Random Walk Strategy for SAT and MAX-W-SAT Problems. Search on Bibsonomy IEA/AIE The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Weighted maximum satisfiability problem, genetic algorithm, heuristic search, optimization problem, scatter search, evolutionary approach
62John D. Davis, Zhangxi Tan, Fang Yu, Lintao Zhang A practical reconfigurable hardware accelerator for Boolean satisfiability solvers. Search on Bibsonomy DAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF BCP, FPGA, reconfigurable, SAT solver, co-processor
60Marc Thurley sharpSAT - Counting Models with Advanced Component Caching and Implicit BCP. Search on Bibsonomy SAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
60Himanshu Jain, Constantinos Bartzis, Edmund M. Clarke Satisfiability Checking of Non-clausal Formulas Using General Matings. Search on Bibsonomy SAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
60Hantao Zhang A Complete Random Jump Strategy with Guiding Paths. Search on Bibsonomy SAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
60Ryan Williams 0001 On Computing k-CNF Formula Properties. Search on Bibsonomy SAT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
60Marko Samer, Helmut Veith Encoding Treewidth into SAT. Search on Bibsonomy SAT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
60Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà Sequential Encodings from Max-CSP into Partial Max-SAT. Search on Bibsonomy SAT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
60Mladen Nikolic, Filip Maric, Predrag Janicic Instance-Based Selection of Policies for SAT Solvers. Search on Bibsonomy SAT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
60Shai Haim, Toby Walsh Online Estimation of SAT Solving Runtime. Search on Bibsonomy SAT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
59Daijue Tang, Yinlei Yu, Darsh Ranjan, Sharad Malik Analysis of Search Based Algorithms for Satisfiability of Propositional and Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems. Search on Bibsonomy SAT (Selected Papers The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
59Jason Cong, Kirill Minkovich Improved SAT-based Boolean matching using implicants for LUT-based FPGAs. Search on Bibsonomy FPGA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF logic synthesis, SAT, implicant, boolean matching, FPGA lookup table
59Romanelli Lodron Zuim, José T. de Sousa, Claudionor José Nunes Coelho Jr. A fast SAT solver algorithm best suited to reconfigurable hardware. Search on Bibsonomy SBCCI The full citation details ... 2006 DBLP  DOI  BibTeX  RDF formal verification, SAT, CNF, DPLL
59Mukul R. Prasad, Armin Biere, Aarti Gupta A survey of recent advances in SAT-based formal verification. Search on Bibsonomy STTT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Model checking, Verification, ATPG, SAT, QBF
59Malay K. Ganai, Aarti Gupta, Pranav Ashar Beyond safety: customized SAT-based model checking. Search on Bibsonomy DAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF circuit cofactoring, unbounded model checking, formal verification, SAT, liveness, bounded model checking, LTL
59Chao Wang 0001, HoonSang Jin, Gary D. Hachtel, Fabio Somenzi Refining the SAT decision ordering for bounded model checking. Search on Bibsonomy DAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF decision heuristic, SAT, bounded model checking
59Gianpiero Cabodi, Paolo Camurati, Stefano Quer Can BDDs compete with SAT solvers on bounded model checking? Search on Bibsonomy DAC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF model checking, formal verification, SAT, BDDs
59Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah Solving difficult SAT instances in the presence of symmetry. Search on Bibsonomy DAC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF difficult, faster, search, symmetry, SAT, CNF, speed-up, instances
59Avi Yadgar, Orna Grumberg, Assaf Schuster Hybrid BDD and All-SAT Method for Model Checking. Search on Bibsonomy Languages: From Formal to Natural The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
59Armin Biere SAT, SMT and Applications. Search on Bibsonomy LPNMR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
59Yu Hu, Victor Shih, Rupak Majumdar, Lei He 0001 Exploiting Symmetries to Speed Up SAT-Based Boolean Matching for Logic Synthesis of FPGAs. Search on Bibsonomy IEEE Trans. on CAD of Integrated Circuits and Systems The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
59Daniel Lopez-Escogido, Jose Torres-Jimenez, Eduardo Rodriguez-Tello, Nelson Rangel-Valdez Strength Two Covering Arrays Construction Using a SAT Representation. Search on Bibsonomy MICAI The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
59Shinya Hiramoto, Masaki Nakanishi, Shigeru Yamashita, Yasuhiko Nakashima A Hardware SAT Solver Using Non-chronological Backtracking and Clause Recording Without Overheads. Search on Bibsonomy ARC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
59Gábor Kusper Finding Models for Blocked 3-SAT Problems in Linear Time by Systematical Refinement of a Sub-model. Search on Bibsonomy KI The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 4443 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license