Search results for "SAT-solver"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
86	Lei Fang 0002, Michael S. Hsiao	A new hybrid solution to boost SAT solver performance.	DATE	2007	DBLP DOI BibTeX RDF
84	Thibaut Feydy, Peter J. Stuckey	Lazy Clause Generation Reengineered.	CP	2009	DBLP DOI BibTeX RDF
81	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
80	Kei Ohmura, Kazunori Ueda	c-sat: A Parallel SAT Solver for Clusters.	SAT	2009	DBLP DOI BibTeX RDF
79	Hidetomo Nabeshima, Katsumi Inoue, Hiromasa Haneda	Implementing an action language using a SAT solver.	ICTAI	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
78	John D. Davis, Zhangxi Tan, Fang Yu 0002, Lintao Zhang	A practical reconfigurable hardware accelerator for Boolean satisfiability solvers.	DAC	2008	DBLP DOI BibTeX RDF	BCP, FPGA, reconfigurable, SAT solver, co-processor
78	Hossein M. Sheini, Karem A. Sakallah	A Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic.	SAT	2005	DBLP DOI BibTeX RDF
76	Mark A. Iwen, Amol Dattatraya Mali	DSatz: A Directional SAT Solver for Planning.	ICTAI	2002	DBLP DOI BibTeX RDF
75	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
74	Xiuqin Wang, Hao Wang, Guangsheng Ma	Hybrid SAT Solver Considering Circuit Observability.	ICYCS	2008	DBLP DOI BibTeX RDF
74	Feng Lu 0002, Li-C. Wang, Kwang-Ting Cheng, Ric C.-Y. Huang	A Circuit SAT Solver With Signal Correlation Guided Learning.	DATE	2003	DBLP DOI BibTeX RDF
72	Hossein M. Sheini, Karem A. Sakallah	A SAT-Based Decision Procedure for Mixed Logical/Integer Linear Problems.	CPAIOR	2005	DBLP DOI BibTeX RDF
70	Mona Safar, M. Watheq El-Kharashi, Ashraf Salem	FPGA-Based SAT Solver.	CCECE	2006	DBLP DOI BibTeX RDF
69	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
69	Niklas Eén, Niklas Sörensson	An Extensible SAT-solver.	SAT	2003	DBLP DOI BibTeX RDF
68	Romanelli Lodron Zuim, José T. de Sousa, Claudionor José Nunes Coelho Jr.	A Fast SAT Solver Strategy Based on Negated Clauses.	VLSI-SoC	2006	DBLP DOI BibTeX RDF
68	James R. Ezick, Samuel B. Luckenbill, Donald Nguyen, Péter Szilágyi, John Starks, Richard A. Lethin	Poster reception - Alef parallel SAT solver for HPC hardware.	SC	2006	DBLP DOI BibTeX RDF
68	Viresh Paruthi, Andreas Kuehlmann	Equivalence Checking Combining a Structural SAT-Solver, BDDs, and Simulation.	ICCD	2000	DBLP DOI BibTeX RDF
68	João Marques-Silva 0001, Inês Lynce	Towards Robust CNF Encodings of Cardinality Constraints.	CP	2007	DBLP DOI BibTeX RDF
67	Zhaohui Fu, Yinlei Yu, Sharad Malik	Considering Circuit Observability Don't Cares in CNF Satisfiability.	DATE	2005	DBLP DOI BibTeX RDF
64	Olga Ohrimenko, Peter J. Stuckey, Michael Codish	Propagation via lazy clause generation.	Constraints An Int. J.	2009	DBLP DOI BibTeX RDF	Finite domain propagation, Boolean variables, SAT solver
64	Yogesh S. Mahajan, Zhaohui Fu, Sharad Malik	Zchaff2004: An Efficient SAT Solver.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
63	Mona Safar, Mohamed Shalan, M. Watheq El-Kharashi, Ashraf Salem	Interactive presentation: A shift register based clause evaluator for reconfigurable SAT solver.	DATE	2007	DBLP DOI BibTeX RDF
63	Pak K. Chan, Mark J. Boyd, Sezer Gören 0001, K. Klenk, V. Kodavati, R. Kundu, M. Margolese, J. Sun, Katsuharu Suzuki, E. Thorne, X. Wang, J. Xu, M. Zhu	Reducing Compilation Time of Zhong's FPGA-Based SAT Solver.	FCCM	1999	DBLP DOI BibTeX RDF
63	Zhaohui Fu, Sharad Malik	On Solving the Partial MAX-SAT Problem.	SAT	2006	DBLP DOI BibTeX RDF
63	Per Bjesse	Industrial Model Checking Based on Satisfiability Solvers.	SPIN	2002	DBLP DOI BibTeX RDF
62	Fadi A. Aloul, Arathi Ramani, Karem A. Sakallah, Igor L. Markov	Solution and Optimization of Systems of Pseudo-Boolean Constraints.	IEEE Trans. Computers	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)
62	Chi-An Wu, Ting-Hao Lin, Chih-Chun Lee, Chung-Yang Huang	QuteSAT: a robust circuit-based SAT solver for complex circuit structure.	DATE	2007	DBLP DOI BibTeX RDF
62	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
61	Marco Baioletti, Stefano Marcugini, Alfredo Milani	An Extension of SATPLAN for Planning with Constraints.	AIMSA	1998	DBLP DOI BibTeX RDF
60	Peter Hawkins, Peter J. Stuckey	A Hybrid BDD and SAT Finite Domain Constraint Solver.	PADL	2006	DBLP DOI BibTeX RDF
57	Federico Heras, Javier Larrosa, Albert Oliveras	MiniMaxSat: A New Weighted Max-SAT Solver.	SAT	2007	DBLP DOI BibTeX RDF
57	Romanelli Lodron Zuim, José T. de Sousa, Claudionor José Nunes Coelho Jr.	A fast SAT solver algorithm best suited to reconfigurable hardware.	SBCCI	2006	DBLP DOI BibTeX RDF	formal verification, SAT, CNF, DPLL
57	Jingchao Chen	Building a Hybrid SAT Solver via Conflict-Driven, Look-Ahead and XOR Reasoning Techniques.	SAT	2009	DBLP DOI BibTeX RDF	Conflict-driven, XOR reasoning, Hybrid solving technique, search pruning technique, Look-ahead, Boolean satisfiability (SAT)
56	Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Fausto Giunchiglia, Armando Tacchella	SAT-Based Decision Procedures for Automated Reasoning: A Unifying Perspective.	Mechanizing Mathematical Reasoning	2005	DBLP DOI BibTeX RDF
56	Ateet Bhalla, Inês Lynce, José T. de Sousa, João Marques-Silva 0001	Heuristic Backtracking Algorithms for SAT.	MTV	2003	DBLP DOI BibTeX RDF
56	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
56	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
56	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
56	Ben Browning, Anja Remshagen	A SAT-based solver for Q-ALL SAT.	ACM Southeast Regional Conference	2006	DBLP DOI BibTeX RDF	learning, logic programming, quantified Boolean formula
56	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
56	Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah	Solving difficult instances of Boolean satisfiability in the presence of symmetry.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2003	DBLP DOI BibTeX RDF
55	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
55	Filip Maric	Formalization and Implementation of Modern SAT Solvers.	J. Autom. Reason.	2009	DBLP DOI BibTeX RDF	Algorithms, Data structures, Software verification, DPLL, SAT solving
55	Chu Min Li, Felip Manyà, Jordi Planes	Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers.	CP	2005	DBLP DOI BibTeX RDF
55	Peixin Zhong, Margaret Martonosi, Pranav Ashar, Sharad Malik	Solving Boolean Satisfiability with Dynamic Hardware Configurations.	FPL	1998	DBLP DOI BibTeX RDF
54	Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Peter van Rossum, Stephan Schulz 0001, Roberto Sebastiani	MathSAT: Tight Integration of SAT and Mathematical Decision Procedures.	J. Autom. Reason.	2005	DBLP DOI BibTeX RDF	Satisfiability module theory, Integrated decision procedures, Linear arithmetic logic, Propositional satisfiability
53	Tobias Eibach, Enrico Pilz, Gunnar Völkel	Attacking Bivium Using SAT Solvers.	SAT	2008	DBLP DOI BibTeX RDF	Rsat, Bivium, Gröbner Base, Cryptography, Application, Stream Cipher, BDD, SAT Solver, eSTREAM, Trivium
53	Hossein M. Sheini, Karem A. Sakallah	A Progressive Simplifier for Satisfiability Modulo Theories.	SAT	2006	DBLP DOI BibTeX RDF
52	Eugene Goldberg	Boundary Points and Resolution.	SAT	2009	DBLP DOI BibTeX RDF	proof quality, resolution, SAT-solver, boundary points
52	Murthy Palla, Jens Bargfrede, Klaus Koch, Walter Anheier, Rolf Drechsler	Adaptive Branch and Bound Using SAT to Estimate False Crosstalk.	ISQED	2008	DBLP DOI BibTeX RDF	Crosstalk Analysis, False Noise, STA, SAT Solver
51	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)
50	Amol Dattatraya Mali, Yevgeny Lipen	MFSAT: A SAT Solver Using Multi-Flip Local Search.	ICTAI	2003	DBLP DOI BibTeX RDF
50	Avi Yadgar, Orna Grumberg, Assaf Schuster	Hybrid BDD and All-SAT Method for Model Checking.	Languages: From Formal to Natural	2009	DBLP DOI BibTeX RDF
50	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
50	Franc Brglez, Xiao Yu Li, Matthias F. M. Stallmann	On SAT instance classes and a method for reliable performance experiments with SAT solvers.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF	exponential and heavy-tail distributions, reliability function, satisfiability, experimental design, equivalence classes, conjunctive normal form
50	Héctor Palacios, Hector Geffner	Mapping Conformant Planning into SAT Through Compilation and Projection.	CAEPIA	2005	DBLP DOI BibTeX RDF
50	Alessandro Armando, Luca Compagna, Pierre Ganty	SAT-Based Model-Checking of Security Protocols Using Planning Graph Analysis.	FME	2003	DBLP DOI BibTeX RDF	SAT encodings, security protocols, bounded model-checking, SAT-solvers
49	Emad Saad	Probabilistic Reasoning by SAT Solvers.	ECSQARU	2009	DBLP DOI BibTeX RDF
49	Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton-Brown	: The Design and Analysis of an Algorithm Portfolio for SAT.	CP	2007	DBLP DOI BibTeX RDF
49	Himanshu Jain, Constantinos Bartzis, Edmund M. Clarke	Satisfiability Checking of Non-clausal Formulas Using General Matings.	SAT	2006	DBLP DOI BibTeX RDF
49	Sean Safarpour, Andreas G. Veneris, Rolf Drechsler	Integrating observability don't cares in all-solution SAT solvers.	ISCAS	2006	DBLP DOI BibTeX RDF
49	Malay K. Ganai, Aarti Gupta, Pranav Ashar	Efficient Modeling of Embedded Memories in Bounded Model Checking.	CAV	2004	DBLP DOI BibTeX RDF
48	Mate Soos, Karsten Nohl, Claude Castelluccia	Extending SAT Solvers to Cryptographic Problems.	SAT	2009	DBLP DOI BibTeX RDF
48	Miquel Ramírez, Hector Geffner	Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT.	CP	2007	DBLP DOI BibTeX RDF
47	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
46	Hossein M. Sheini, Karem A. Sakallah	Ario: A Linear Integer Arithmetic Logic Solver.	FMCAD	2006	DBLP DOI BibTeX RDF
44	Rafiq Muhammad 0006, Peter J. Stuckey	A Stochastic Non-CNF SAT Solver.	PRICAI	2006	DBLP DOI BibTeX RDF
44	Evguenii I. Goldberg, Yakov Novikov	BerkMin: A Fast and Robust Sat-Solver.	DATE	2002	DBLP DOI BibTeX RDF
44	N. A. Reis, José T. de Sousa	On Implementing a Configware/Software SAT Solver.	FCCM	2002	DBLP DOI BibTeX RDF
44	Mary Sheeran, Satnam Singh, Gunnar Stålmarck	Checking Safety Properties Using Induction and a SAT-Solver.	FMCAD	2000	DBLP DOI BibTeX RDF
44	Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue	Effective SAT Planning by Speculative Computation.	Australian Joint Conference on Artificial Intelligence	2002	DBLP DOI BibTeX RDF
43	Xiuqin Wang, Guangsheng Ma, Hao Wang	A Novel Method for All Solutions SAT Problem.	SNPD	2008	DBLP DOI BibTeX RDF	All Solutions, Observability Don't Cares, Circuit Structure, Boolean Satisfiability
43	Hantao Zhang 0001	A Complete Random Jump Strategy with Guiding Paths.	SAT	2006	DBLP DOI BibTeX RDF
43	Marc Thurley	sharpSAT - Counting Models with Advanced Component Caching and Implicit BCP.	SAT	2006	DBLP DOI BibTeX RDF
43	Mukul R. Prasad, Armin Biere, Aarti Gupta	A survey of recent advances in SAT-based formal verification.	Int. J. Softw. Tools Technol. Transf.	2005	DBLP DOI BibTeX RDF	Model checking, Verification, ATPG, SAT, QBF
43	Kameshwar Chandrasekar, Michael S. Hsiao	State Set Management for SAT-based Unbounded Model Checking.	ICCD	2005	DBLP DOI BibTeX RDF
43	Horst Samulowitz, Fahiem Bacchus	Using SAT in QBF.	CP	2005	DBLP DOI BibTeX RDF
43	Clark W. Barrett, David L. Dill, Aaron Stump	Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT.	CAV	2002	DBLP DOI BibTeX RDF	Satisfiability, First-Order Logic, Decision Procedures, Propositional Satisfiability
42	Jinbo Huang	Universal Booleanization of Constraint Models.	CP	2008	DBLP DOI BibTeX RDF
42	Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä	Strategies for Solving SAT in Grids by Randomized Search.	AISC/MKM/Calculemus	2008	DBLP DOI BibTeX RDF
42	Fernando Brizzolari, Igor Melatti, Enrico Tronci, Giuseppe Della Penna	Disk Based Software Verification via Bounded Model Checking.	APSEC	2007	DBLP DOI BibTeX RDF
42	Christian Thiffault, Fahiem Bacchus, Toby Walsh	Solving Non-clausal Formulas with DPLL Search.	CP	2004	DBLP DOI BibTeX RDF
42	Evguenii I. Goldberg, Yakov Novikov	Verification of Proofs of Unsatisfiability for CNF Formulas.	DATE	2003	DBLP DOI BibTeX RDF
42	Fahiem Bacchus, Jonathan Winter	Effective Preprocessing with Hyper-Resolution and Equality Reduction.	SAT	2003	DBLP DOI BibTeX RDF
42	Maria Paola Bonacina, Mnacho Echenim	T-Decision by Decomposition.	CADE	2007	DBLP DOI BibTeX RDF
40	Blandine Debraize, Louis Goubin	Guess-and-Determine Algebraic Attack on the Self-Shrinking Generator.	FSE	2008	DBLP DOI BibTeX RDF	guess-and-determine attacks, stream cipher, SAT solver, algebraic cryptanalysis, self-shrinking generator, multivariate quadratic equations
40	Albin Coquereau	[ErgoFast] Amélioration de performances du solveur SMT Alt-Ergo grâce à l'intégration d'un solveur SAT efficace. ([ErgoFast] Improving performance of the SMT solver Alt-Ergo with a better integration of efficient SAT solver).		2019	RDF
38	Tobias Schubert 0001, Matthew D. T. Lewis, Bernd Becker 0001	PaMira - A Parallel SAT Solver with Knowledge Sharing.	MTV	2005	DBLP DOI BibTeX RDF
38	Roman Gershman, Ofer Strichman	HaifaSat: A New Robust SAT Solver.	Haifa Verification Conference	2005	DBLP DOI BibTeX RDF
38	Jinwen Xi, Peixin Zhong	Hardware/Software Co-Modeling of SAT Solver Based on Distributed Computing Elements using SystemC.	ICCD	2004	DBLP DOI BibTeX RDF
38	Enrico Giunchiglia, Marco Maratea, Armando Tacchella	(In)Effectiveness of Look-Ahead Techniques in a Modern SAT Solver.	CP	2003	DBLP DOI BibTeX RDF
37	Juan P. Galeotti, Nicolás Rosner, Carlos López Pombo, Marcelo F. Frias	Analysis of invariants for efficient bounded verification.	ISSTA	2010	DBLP DOI BibTeX RDF	dynalloy, kodkod, sat-based code analysis, static analysis, alloy
37	Niklas Eén, Alan Mishchenko, Niklas Sörensson	Applying Logic Synthesis for Speeding Up SAT.	SAT	2007	DBLP DOI BibTeX RDF
37	Aarti Gupta, Malay K. Ganai, Pranav Ashar	Lazy Constraints and SAT Heuristics for Proof-Based Abstraction.	VLSI Design	2005	DBLP DOI BibTeX RDF
37	Sathiamoorthy Subbarayan, Dhiraj K. Pradhan	NiVER: Non-increasing Variable Elimination Resolution for Preprocessing SAT Instances.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
37	Liang Zhang 0012, Mukul R. Prasad, Michael S. Hsiao	Incremental deductive & inductive reasoning for SAT-based bounded model checking.	ICCAD	2004	DBLP DOI BibTeX RDF
37	Chao Wang 0001, HoonSang Jin, Gary D. Hachtel, Fabio Somenzi	Refining the SAT decision ordering for bounded model checking.	DAC	2004	DBLP DOI BibTeX RDF	decision heuristic, SAT, bounded model checking
37	Jesse D. Bingham, Alan J. Hu	Semi-formal Bounded Model Checking.	CAV	2002	DBLP DOI BibTeX RDF
37	Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah	Solving difficult SAT instances in the presence of symmetry.	DAC	2002	DBLP DOI BibTeX RDF	difficult, faster, search, symmetry, SAT, CNF, speed-up, instances