Search results for "SAT-solving"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
58	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	Armin Biere	SAT, SMT and Applications.	LPNMR	2009	DBLP DOI BibTeX RDF
53	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)
53	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
52	Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä	Incorporating Learning in Grid-Based Randomized SAT Solving.	AIMSA	2008	DBLP DOI BibTeX RDF
49	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
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
48	Yinlei Yu, Sharad Malik	Lemma Learning in SMT on Linear Constraints.	SAT	2006	DBLP DOI BibTeX RDF
45	Andreas Bauer 0002	Simplifying Diagnosis Using LSAT: A Propositional Approach to Reasoning from First Principles.	CPAIOR	2005	DBLP DOI BibTeX RDF	formal specification, model based reasoning, system monitoring, model based diagnosis, SAT-solving
44	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
44	Jinbo Huang, Adnan Darwiche	Toward Good Elimination Orders for Symbolic SAT Solving.	ICTAI	2004	DBLP DOI BibTeX RDF
42	Joachim Biskup, Lena Wiese	On Finding an Inference-Proof Complete Database for Controlled Query Evaluation. (PDF / PS)	DBSec	2006	DBLP DOI BibTeX RDF	confidentiality of data, complete database systems, Branch and Bound, propositional logic, inference control, SAT solving, lying, Controlled Query Evaluation
40	Thibaut Feydy, Peter J. Stuckey	Lazy Clause Generation Reengineered.	CP	2009	DBLP DOI BibTeX RDF
40	Hossein M. Sheini, Karem A. Sakallah	A Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic.	SAT	2005	DBLP DOI BibTeX RDF
40	Toni Jussila, Carsten Sinz, Armin Biere	Extended Resolution Proofs for Symbolic SAT Solving with Quantification.	SAT	2006	DBLP DOI BibTeX RDF
37	John D. Davis, Zhangxi Tan, Fang Yu 0002, Lintao Zhang	Designing an Efficient Hardware Implication Accelerator for SAT Solving.	SAT	2008	DBLP DOI BibTeX RDF
37	Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl	SAT Solving for Argument Filterings.	LPAR	2006	DBLP DOI BibTeX RDF
37	Shujun Deng, Weimin Wu, Jinian Bian	Bounded Model Checking Combining Symbolic Trajectory Evaluation Abstraction with Hybrid Three-Valued SAT Solving.	CSCWD (Selected Papers)	2006	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	Sean Safarpour, Andreas G. Veneris, Rolf Drechsler	Integrating observability don't cares in all-solution SAT solvers.	ISCAS	2006	DBLP DOI BibTeX RDF
37	Jesse D. Bingham, Alan J. Hu	Semi-formal Bounded Model Checking.	CAV	2002	DBLP DOI BibTeX RDF
36	Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah	Dynamic symmetry-breaking for improved Boolean optimization.	ASP-DAC	2005	DBLP DOI BibTeX RDF
34	Niklas Eén, Alan Mishchenko, Niklas Sörensson	Applying Logic Synthesis for Speeding Up SAT.	SAT	2007	DBLP DOI BibTeX RDF
34	Marc Thurley	sharpSAT - Counting Models with Advanced Component Caching and Implicit BCP.	SAT	2006	DBLP DOI BibTeX RDF
33	Arathi Ramani, Igor L. Markov	Automatically Exploiting Symmetries in Constraint Programming.	CSCLP	2004	DBLP DOI BibTeX RDF
32	Guoqiang Pan, Moshe Y. Vardi	Symbolic Decision Procedures for QBF.	CP	2004	DBLP DOI BibTeX RDF
31	Chih-Chun Lee, Jie-Hong Roland Jiang, Chung-Yang Huang, Alan Mishchenko	Scalable exploration of functional dependency by interpolation and incremental SAT solving.	ICCAD	2007	DBLP DOI BibTeX RDF
31	Domagoj Babic, Jesse D. Bingham, Alan J. Hu	Efficient SAT solving: beyond supercubes.	DAC	2005	DBLP DOI BibTeX RDF	learning, formal verification, SAT, search space pruning
30	Moshe Y. Vardi	Symbolic Techniques in Propositional Satisfiability Solving.	SAT	2009	DBLP DOI BibTeX RDF
30	Babita Sharma, Paritosh K. Pandya, Supratik Chakraborty	Bounded Validity Checking of Interval Duration Logic.	TACAS	2005	DBLP DOI BibTeX RDF
30	Daniel Singer, Alain Vagner	Parallel Resolution of the Satisfiability Problem (SAT) with OpenMP and MPI.	PPAM	2005	DBLP DOI BibTeX RDF
28	Junhao Shi, Görschwin Fey, Rolf Drechsler, Andreas Glowatz, Friedrich Hapke, Jürgen Schlöffel	PASSAT: Efficient SAT-Based Test Pattern Generation for Industrial Circuits.	ISVLSI	2005	DBLP DOI BibTeX RDF
28	Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah	ShatterPB: symmetry-breaking for pseudo-Boolean formulas.	ASP-DAC	2004	DBLP DOI BibTeX RDF
28	Fahiem Bacchus, Jonathan Winter	Effective Preprocessing with Hyper-Resolution and Equality Reduction.	SAT	2003	DBLP DOI BibTeX RDF
27	John Homer, Xinming Ou	SAT-solving approaches to context-aware enterprise network security management.	IEEE J. Sel. Areas Commun.	2009	DBLP DOI BibTeX RDF
26	Vincent Vallade	Contributions à la résolution parallèle du problème SAT. (Contribution to parallel SAT solving).		2023	RDF
26	Rick Plachetta, Alexander van der Grinten	SAT-and-Reduce for Vertex Cover: Accelerating Branch-and-Reduce by SAT Solving.	ALENEX	2021	DBLP DOI BibTeX RDF
26	Stephan Gocht, Tomás Balyo	Accelerating SAT Based Planning with Incremental SAT Solving.	ICAPS	2017	DBLP BibTeX RDF
26	Alessandro Dal Palù, Agostino Dovier, Andrea Formisano 0001, Enrico Pontelli	CUD@SAT: SAT solving on GPUs.	J. Exp. Theor. Artif. Intell.	2015	DBLP DOI BibTeX RDF
26	Kenji Kanazawa, Tsutomu Maruyama	FPGA acceleration of SAT/Max-SAT solving using variable-way cache.	FPL	2014	DBLP DOI BibTeX RDF
26	Stephan Kottler	Advanced Methods for SAT Solving (Alternative Ansätze für das Lösen von SAT Instanzen)		2013	RDF
26	Ashish Darbari, Bernd Fischer 0002, João Marques-Silva 0001	Industrial-Strength Certified SAT Solving through Verified SAT Proof Checking.	ICTAC	2010	DBLP DOI BibTeX RDF
25	Oliver Kullmann	Present and Future of Practical SAT Solving.	Complexity of Constraints	2008	DBLP DOI BibTeX RDF
24	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
24	Peter J. Stuckey, Lei Zheng	Improving Nogood Recording Using 2SAT.	ICTAI	2003	DBLP DOI BibTeX RDF
24	Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah	FORCE: a fast and easy-to-implement variable-ordering heuristic.	ACM Great Lakes Symposium on VLSI	2003	DBLP DOI BibTeX RDF	partitioning, placement, SAT, BDDs, hypergraph, CNF, pre-processing, backtrack search, variable order
24	Sumit Gulwani	Dimensions in program synthesis.	PPDP	2010	DBLP DOI BibTeX RDF	deductive synthesis, inductive synthesis, sat solving, smt solving, machine learning, genetic programming, programming by demonstration, belief propagation, programming by examples, probabilistic inference
24	Xiaoke Qin, Mingsong Chen, Prabhat Mishra 0001	Synchronized Generation of Directed Tests Using Satisfiability Solving.	VLSI Design	2010	DBLP DOI BibTeX RDF	Directed test generation, SAT solving
24	Michael Codish, Samir Genaim, Peter J. Stuckey	A declarative encoding of telecommunications feature subscription in SAT.	PPDP	2009	DBLP DOI BibTeX RDF	sat solving, telecommunications feature subscription, declarative modelling
24	Volker Sorge, Andreas Meier 0002, Roy L. McCasland, Simon Colton	Automatic Construction and Verification of Isotopy Invariants.	J. Autom. Reason.	2008	DBLP DOI BibTeX RDF	Automated mathematics, Classification theorems, Computer algebra, Automated theorem proving, Model generation, SAT solving, Invariant generation, Isotopy
24	Viorica Sofronie-Stokkermans	On unification for bounded distributive lattices.	ACM Trans. Comput. Log.	2007	DBLP DOI BibTeX RDF	decision procedures for the positive theory, Theorem proving, unification, distributive lattices, SAT solving
24	Julian Dolby, Mandana Vaziri, Frank Tip	Finding bugs efficiently with a SAT solver.	ESEC/SIGSOFT FSE	2007	DBLP DOI BibTeX RDF	model checking, specification, slicing, SAT solving
22	Liang Xu	SMT-Based Bounded Model Checking for Real-Time Systems (Short Paper).	QSIC	2008	DBLP DOI BibTeX RDF	real-time systems, SMT, BMC
22	Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah	Symmetry breaking for pseudo-Boolean formulas.	ACM J. Exp. Algorithmics	2007	DBLP DOI BibTeX RDF	Graph automorphism
22	Cesare Tinelli	An Abstract Framework for Satisfiability Modulo Theories.	TABLEAUX	2007	DBLP DOI BibTeX RDF
22	Warren A. Hunt Jr., Erik Reeber	A SAT-based procedure for verifying finite state machines in ACL2.	ACL2	2006	DBLP DOI BibTeX RDF	satisfiability solving, theorem proving, hardware verification, ACL2
22	Paul T. Darga, Mark H. Liffiton, Karem A. Sakallah, Igor L. Markov	Exploiting structure in symmetry detection for CNF.	DAC	2004	DBLP DOI BibTeX RDF	abstract algebra, partition refinement, symmetry, backtrack search, graph automorphism, boolean satisfiability (SAT)
22	Amol Dattatraya Mali, Yevgeny Lipen	MFSAT: A SAT Solver Using Multi-Flip Local Search.	ICTAI	2003	DBLP DOI BibTeX RDF
22	Alfonso San Miguel Aguirre, Moshe Y. Vardi	Random 3-SAT and BDDs: The Plot Thickens Further.	CP	2001	DBLP DOI BibTeX RDF
22	Parosh Aziz Abdulla, Per Bjesse, Niklas Eén	Symbolic Reachability Analysis Based on SAT-Solvers.	TACAS	2000	DBLP DOI BibTeX RDF
21	Marijn J. H. Heule, Oliver Kullmann, Victor W. Marek	Solving Very Hard Problems: Cube-and-Conquer, a Hybrid SAT Solving Method.	IJCAI	2017	DBLP DOI BibTeX RDF
21	Sven Schulz, Wolfgang Blochinger	Cooperate and compete! A hybrid solving strategy for task-parallel SAT solving on Peer-to-Peer Desktop Grids.	HPCS	2010	DBLP DOI BibTeX RDF
20	Mladen Nikolic, Filip Maric, Predrag Janicic	Instance-Based Selection of Policies for SAT Solvers.	SAT	2009	DBLP DOI BibTeX RDF
20	Andreas Eggers, Martin Fränzle, Christian Herde	SAT Modulo ODE: A Direct SAT Approach to Hybrid Systems.	ATVA	2008	DBLP DOI BibTeX RDF
18	Andrew DeOrio, Valeria Bertacco	Human computing for EDA.	DAC	2009	DBLP DOI BibTeX RDF	satisfiability, human computing
18	Maarten Mariën, Johan Wittocx, Marc Denecker	Integrating Inductive Definitions in SAT.	LPAR	2007	DBLP DOI BibTeX RDF
18	Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom, Konrad Slind	Analyzing the Intel Itanium Memory Ordering Rules Using Logic Programming and SAT.	CHARME	2003	DBLP DOI BibTeX RDF
16	Hariprasadh Govindasamy, Babak Esfandiari, Paulo Garcia	Accelerating Boolean Constraint Propagation for Efficient SAT-Solving on FPGAs.	CoRR	2024	DBLP DOI BibTeX RDF
16	Zhengyuan Shi, Tiebing Tang, Sadaf Khan, Hui-Ling Zhen, Mingxuan Yuan, Zhufei Chu, Qiang Xu	EDA-Driven Preprocessing for SAT Solving.	CoRR	2024	DBLP DOI BibTeX RDF
16	Daniela Kaufmann, Armin Biere	Improving AMulet2 for verifying multiplier circuits using SAT solving and computer algebra.	Int. J. Softw. Tools Technol. Transf.	2023	DBLP DOI BibTeX RDF
16	Zhiyuan Yan, Min Li 0019, Zhengyuan Shi, Wenjie Zhang, Yingcong Chen, Hongce Zhang	Addressing Variable Dependency in GNN-based SAT Solving.	CoRR	2023	DBLP DOI BibTeX RDF
16	Yunuo Cen, Zhiwei Zhang, Xuanyao Fong	Massively Parallel Continuous Local Search for Hybrid SAT Solving on GPUs.	CoRR	2023	DBLP DOI BibTeX RDF
16	Zhaoyu Li, Jinpei Guo, Xujie Si	G4SATBench: Benchmarking and Advancing SAT Solving with Graph Neural Networks.	CoRR	2023	DBLP DOI BibTeX RDF
16	Jiong Yang 0002, Arijit Shaw, Teodora Baluta, Mate Soos, Kuldeep S. Meel	Explaining SAT Solving Using Causal Reasoning.	CoRR	2023	DBLP DOI BibTeX RDF
16	Bernhard Andraschko, Julian Danner, Martin Kreuzer	SAT Solving Using XOR-OR-AND Normal Forms.	CoRR	2023	DBLP DOI BibTeX RDF
16	Bernardo Subercaseaux, Marijn Heule	Toward Optimal Radio Colorings of Hypercubes via SAT-solving.	LPAR	2023	DBLP DOI BibTeX RDF
16	Jinghui Jiang, Zhenpei Huang, Qiao Xiang, Lu Tang 0004, Jiwu Shu	Poster: P4-DPLL: Accelerating SAT Solving Using Switching ASICs.	SIGCOMM	2023	DBLP DOI BibTeX RDF
16	Fangzhou Wang, Jinwei Liu, Evangeline F. Y. Young	FastPass: Fast Pin Access Analysis with Incremental SAT Solving.	ISPD	2023	DBLP DOI BibTeX RDF
16	Jiong Yang 0002, Arijit Shaw, Teodora Baluta, Mate Soos, Kuldeep S. Meel	Explaining SAT Solving Using Causal Reasoning.	SAT	2023	DBLP DOI BibTeX RDF
16	Zhenpei Huang, Xiwen Fan, Jinghui Jiang, Mingyuan Song, Lu Tang 0004, Qiao Xiang, Jiwu Shu	Accelerating SAT Solving Using Switching ASICs.	ICPADS	2023	DBLP DOI BibTeX RDF
16	Sabrine Saouli, Souheib Baarir, Claude Dutheillet, Jo Devriendt	CosySEL: Improving SAT Solving Using Local Symmetries.	VMCAI	2023	DBLP DOI BibTeX RDF
16	Min Li 0019, Zhengyuan Shi, Qiuxia Lai, Sadaf Khan, Shaowei Cai 0001, Qiang Xu 0001	On EDA-Driven Learning for SAT Solving.	DAC	2023	DBLP DOI BibTeX RDF
16	Dominik Schreiber	Scalable SAT Solving and its Application		2023	DOI RDF
16	Yi Xiang, Xiaowei Yang, Han Huang 0002, Zhengxin Huang, Miqing Li	Sampling configurations from software product lines via probability-aware diversification and SAT solving.	Autom. Softw. Eng.	2022	DBLP DOI BibTeX RDF
16	Thomas Linsbichler, Marco Maratea, Andreas Niskanen, Johannes Peter Wallner, Stefan Woltran	Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving.	Artif. Intell.	2022	DBLP DOI BibTeX RDF
16	Peter Sanders 0001, Dominik Schreiber	Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling.	J. Open Source Softw.	2022	DBLP DOI BibTeX RDF
16	Zhengyuan Shi, Min Li 0019, Sadaf Khan, Hui-Ling Zhen, Mingxuan Yuan, Qiang Xu 0001	SATformer: Transformers for SAT Solving.	CoRR	2022	DBLP DOI BibTeX RDF
16	Dominik Schreiber, Peter Sanders 0001	Scalable SAT Solving in the Cloud.	CoRR	2022	DBLP DOI BibTeX RDF
16	Jeremy Jierui Tan	An attack on Zarankiewicz's problem through SAT solving.	CoRR	2022	DBLP DOI BibTeX RDF
16	Mathias Fleury, Armin Biere	Scalable Proof Producing Multi-Threaded SAT Solving with Gimsatul through Sharing instead of Copying Clauses.	CoRR	2022	DBLP DOI BibTeX RDF
16	Dantong Ouyang, Mengting Liao, Yuxin Ye	Lightweight axiom pinpointing via replicated driver and customized SAT-solving.	Frontiers Comput. Sci.	2022	DBLP DOI BibTeX RDF
16	Dominik Schreiber, Peter Sanders 0001	Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling.		2022	DOI RDF
16	Michele Collevati, Agostino Dovier, Andrea Formisano 0001	GPU parallelism for SAT solving heuristics.	CILC	2022	DBLP BibTeX RDF
16	Ning Luo, Samuel Judson, Timos Antonopoulos, Ruzica Piskac, Xiao Wang 0012	ppSAT: Towards Two-Party Private SAT Solving.	USENIX Security Symposium	2022	DBLP BibTeX RDF
16	Jinghui Jiang, Zhenpei Huang, Qiao Xiang, Lu Tang 0004, Jiwu Shu	P4-DPLL: accelerating SAT solving using switching ASICs.	FFSPIN@SIGCOMM	2022	DBLP DOI BibTeX RDF
16	Jakob Rath, Armin Biere, Laura Kovács	First-Order Subsumption via SAT Solving.	FMCAD	2022	DBLP DOI BibTeX RDF
16	Oleg Zaikin 0002, Stepan Kochemazov	On black-box optimization in divide-and-conquer SAT solving.	Optim. Methods Softw.	2021	DBLP DOI BibTeX RDF
16	Wenxi Wang, Yang Hu, Mohit Tiwari, Sarfraz Khurshid, Kenneth L. McMillan, Risto Miikkulainen	NeuroComb: Improving SAT Solving with Graph Neural Networks.	CoRR	2021	DBLP BibTeX RDF
16	Jianfeng Chen, Xipeng Shen, Tim Menzies	Faster SAT Solving for Software with Repeated Structures (with Case Studies on Software Test Suite Minimization).	CoRR	2021	DBLP BibTeX RDF
16	Martin Capek, Pavel Surynek	DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies.	CoRR	2021	DBLP BibTeX RDF