Search results for "3-SAT"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
46	Akhil A. Dixit, Phokion G. Kolaitis	A SAT-Based System for Consistent Query Answering.	SAT	2019	DBLP DOI BibTeX RDF
46	Oleksii Omelchenko, Andrei A. Bulatov	Satisfiability Threshold for Power Law Random 2-SAT in Configuration Model.	SAT	2019	DBLP DOI BibTeX RDF
46	Randy Hickey, Fahiem Bacchus	Speeding Up Assumption-Based SAT.	SAT	2019	DBLP DOI BibTeX RDF
46	Katalin Fazekas, Armin Biere, Christoph Scholl 0001	Incremental Inprocessing in SAT Solving.	SAT	2019	DBLP DOI BibTeX RDF
46	Marc Vinyals, Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström	In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving.	SAT	2018	DBLP DOI BibTeX RDF
46	Alexey Ignatiev, António Morgado 0001, João Marques-Silva 0001	PySAT: A Python Toolkit for Prototyping with SAT Oracles.	SAT	2018	DBLP DOI BibTeX RDF
46	Tobias Friedrich 0001, Ralf Rothenberger	Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT.	SAT	2018	DBLP DOI BibTeX RDF
46	Thorsten Ehlers, Dirk Nowotka	Tuning Parallel SAT Solvers.	POS@SAT	2018	DBLP DOI BibTeX RDF
46	Zack Newsham, Vijay Ganesh, Sebastian Fischmeister	Predicting SAT Solver Performance on Heterogeneous Hardware.	POS@SAT	2018	DBLP DOI BibTeX RDF
46	Michal Karpinski, Marek Piotrów	Competitive Sorter-based Encoding of PB-Constraints into SAT.	POS@SAT	2018	DBLP DOI BibTeX RDF
46	Jia Hui Liang, Chanseok Oh, Minu Mathew, Ciza Thomas, Chunxiao Li 0002, Vijay Ganesh	Machine Learning-Based Restart Policy for CDCL SAT Solvers.	SAT	2018	DBLP DOI BibTeX RDF
46	Stepan Kochemazov, Oleg Zaikin 0002	ALIAS: A Modular Tool for Finding Backdoors for SAT.	SAT	2018	DBLP DOI BibTeX RDF
46	Markus Iser, Carsten Sinz	A Problem Meta-Data Library for Research in SAT.	POS@SAT	2018	DBLP DOI BibTeX RDF
46	Bart Bogaerts 0001, Tomi Janhunen, Shahab Tasharrofi	SAT-to-SAT in QBFEval 2016.	QBF@SAT	2016	DBLP BibTeX RDF
46	Robert Ganian, Stefan Szeider	Community Structure Inspired Algorithms for SAT and #SAT.	SAT	2015	DBLP DOI BibTeX RDF
46	Chanseok Oh	Between SAT and UNSAT: The Fundamental Difference in CDCL SAT.	SAT	2015	DBLP DOI BibTeX RDF
46	Adrian Balint, Armin Biere, Andreas Fröhlich, Uwe Schöning	Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses.	SAT	2014	DBLP DOI BibTeX RDF
46	Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Cédric Piette	Dolius: A Distributed Parallel SAT Solving Framework.	POS@SAT	2014	DBLP DOI BibTeX RDF
46	Laurent Simon	Post Mortem Analysis of SAT Solver Proofs.	POS@SAT	2014	DBLP DOI BibTeX RDF
46	Zoltán Ádám Mann	Typical-case complexity and the SAT competitions.	POS@SAT	2014	DBLP DOI BibTeX RDF
46	Armin Biere	Lingeling Essentials, A Tutorial on Design and Implementation Aspects of the the SAT Solver Lingeling.	POS@SAT	2014	DBLP DOI BibTeX RDF
46	Marijn Heule, Norbert Manthey, Tobias Philipp	Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers.	POS@SAT	2014	DBLP DOI BibTeX RDF
46	Valentin Mayer-Eichberger, Toby Walsh	SAT Encodings for the Car Sequencing Problem.	POS@SAT	2013	DBLP DOI BibTeX RDF
46	Martin Aigner 0003, Armin Biere, Christoph M. Kirsch, Aina Niemetz, Mathias Preiner	Analysis of Portfolio-Style Parallel SAT Solving on Current Multi-Core Architectures.	POS@SAT	2013	DBLP DOI BibTeX RDF
46	Norbert Manthey, Davide Lanti, Ahmed Irfan	Modern Cooperative Parallel SAT Solving.	POS@SAT	2013	DBLP DOI BibTeX RDF
46	Hadi Katebi, Karem A. Sakallah, João P. Marques Silva	Empirical Study of the Anatomy of Modern Sat Solvers.	SAT	2011	DBLP DOI BibTeX RDF
46	Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann	Non-Model-Based Algorithm Portfolios for SAT.	SAT	2011	DBLP DOI BibTeX RDF
46	Alexander Nadel	Generating Diverse Solutions in SAT.	SAT	2011	DBLP DOI BibTeX RDF
46	Justyna Petke, Peter Jeavons 0001	The Order Encoding: From Tractable CSP to Tractable SAT.	SAT	2011	DBLP DOI BibTeX RDF
46	Oliver Gableske, Marijn Heule	EagleUP: Solving Random 3-SAT Using SLS with Unit Propagation.	SAT	2011	DBLP DOI BibTeX RDF
46	Ryan Williams 0001	Connecting SAT Algorithms and Complexity Lower Bounds.	SAT	2011	DBLP DOI BibTeX RDF
46	Dave A. D. Tompkins, Adrian Balint, Holger H. Hoos	Captain Jack: New Variable Selection Heuristics in Local Search for SAT.	SAT	2011	DBLP DOI BibTeX RDF
46	Bryan Silverthorn, Risto Miikkulainen	Learning Polarity from Structure in SAT.	SAT	2011	DBLP DOI BibTeX RDF
46	Martin Mundhenk, Robert Zeranski	How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms.	SAT	2011	DBLP DOI BibTeX RDF
46	Tomoya Tanjo, Naoyuki Tamura, Mutsunori Banbara	A Compact and Efficient SAT-Encoding of Finite Domain CSP.	SAT	2011	DBLP DOI BibTeX RDF
46	Ignasi Abío, Morgan Deters, Robert Nieuwenhuis, Peter J. Stuckey	Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One.	SAT	2011	DBLP DOI BibTeX RDF
46	Youssef Hamadi	From Parallel SAT to Distributed SAT.	POS@SAT	2010	DBLP DOI BibTeX RDF
46	Vishwambhar Rathi, Erik Aurell, Lars K. Rasmussen, Mikael Skoglund	Bounds on Threshold of Regular Random k-SAT.	SAT	2010	DBLP DOI BibTeX RDF
46	Adrian Balint, Andreas Fröhlich	Improving Stochastic Local Search for SAT with a New Probability Distribution.	SAT	2010	DBLP DOI BibTeX RDF
46	Denis Pankratov, Allan Borodin	On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem.	SAT	2010	DBLP DOI BibTeX RDF
46	William Matthews, Ramamohan Paturi	Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable.	SAT	2010	DBLP DOI BibTeX RDF
46	Rüdiger Ehlers	Minimising Deterministic Büchi Automata Precisely Using SAT Solving.	SAT	2010	DBLP DOI BibTeX RDF
46	Stephan Kottler	SAT Solving with Reference Points.	SAT	2010	DBLP DOI BibTeX RDF
46	Yacine Boufkhad, Thomas Hugel	Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold.	SAT	2010	DBLP DOI BibTeX RDF
46	Robert Brummayer, Florian Lonsing, Armin Biere	Automated Testing and Debugging of SAT and QBF Solvers.	SAT	2010	DBLP DOI BibTeX RDF
46	Oliver Kullmann	Green-Tao Numbers and SAT.	SAT	2010	DBLP DOI BibTeX RDF
46	Dave A. D. Tompkins, Holger H. Hoos	Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT.	SAT	2010	DBLP DOI BibTeX RDF
46	Evgeny Dantsin, Alexander Wolpert	On Moderately Exponential Time for SAT.	SAT	2010	DBLP DOI BibTeX RDF
46	Mladen Nikolic	Statistical Methodology for Comparison of SAT Solvers.	SAT	2010	DBLP DOI BibTeX RDF
46	Carsten Fuhs, Peter Schneider-Kamp	Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT.	SAT	2010	DBLP DOI BibTeX RDF
46	Allen Van Gelder, Ivor T. A. Spence	Zero-One Designs Produce Small Hard SAT Instances.	SAT	2010	DBLP DOI BibTeX RDF
46	Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes	Exploiting Cycle Structures in Max-SAT.	SAT	2009	DBLP DOI BibTeX RDF
46	Daniel Johannsen, Igor Razgon, Magnus Wahlström	Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences.	SAT	2009	DBLP DOI BibTeX RDF
46	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
45	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
45	Jinji Yang, Kaile Su, Qingliang Chen	Improving Encoding Efficiency for Bounded Model Checking.	TASE	2008	DBLP DOI BibTeX RDF	encoding, SAT, Bounded Model Checking
45	Ofer Strichman	Accelerating Bounded Model Checking of Safety Properties.	Formal Methods Syst. Des.	2004	DBLP DOI BibTeX RDF	SAT, Bounded Model Checking
45	Fadi A. Aloul, Nagarajan Kandasamy	Sensor Deployment for Failure Diagnosis in Networked Aerial Robots: A Satisfiability-Based Approach.	SAT	2007	DBLP DOI BibTeX RDF	0-1 ILP, UAV networks, distributed systems, fault diagnosis, SAT
45	Éric Grégoire, Richard Ostrowski, Bertrand Mazure, Lakhdar Sais	Automatic Extraction of Functional Dependencies.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF	propositional reasoning and search, Boolean function, SAT
44	Huzefa Rangwala, Christopher Kauffman, George Karypis	A Kernel Framework for Protein Residue Annotation.	PAKDD	2009	DBLP DOI BibTeX RDF
44	Richard Chang 0001, Suresh Purini	Bounded Queries and the NP Machine Hypothesis.	CCC	2007	DBLP DOI BibTeX RDF
44	Miguel F. Anjos	An improved semidefinite programming relaxation for the satisfiability problem.	Math. Program.	2005	DBLP DOI BibTeX RDF	Satisfiability, Semidefinite programming, Discrete optimization
44	Ateet Bhalla, Inês Lynce, José T. de Sousa, João Marques-Silva 0001	Heuristic-Based Backtracking Relaxation for Propositional Satisfiability.	J. Autom. Reason.	2005	DBLP DOI BibTeX RDF
44	Zhaohui Fu, Yinlei Yu, Sharad Malik	Considering Circuit Observability Don't Cares in CNF Satisfiability.	DATE	2005	DBLP DOI BibTeX RDF
44	Zhao Xing, Weixiong Zhang	Efficient Strategies for (Weighted) Maximum Satisfiability.	CP	2004	DBLP DOI BibTeX RDF
44	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
44	Lars Engebretsen, Venkatesan Guruswami	Is Constraint Satisfaction Over Two Variables Always Easy?	RANDOM	2002	DBLP DOI BibTeX RDF
44	Amol Dattatraya Mali	On Temporal Planning as CSP.	ICTAI	2002	DBLP DOI BibTeX RDF
44	Inês Lynce, Luís Baptista, João Marques-Silva 0001	Towards Provably Complete Stochastic Search Algorithms for Satisfiability.	EPIA	2001	DBLP DOI BibTeX RDF
44	Richard Chang 0001, Jon S. Squire	Bounded Query Functions with Limited Output Bits.	CCC	2001	DBLP DOI BibTeX RDF
44	Daijue Tang, Sharad Malik	Solving Quantified Boolean Formulas with Circuit Observability Don't Cares.	SAT	2006	DBLP DOI BibTeX RDF
44	Ashish Sabharwal, Carlos Ansótegui, Carla P. Gomes, Justin W. Hart, Bart Selman	QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency.	SAT	2006	DBLP DOI BibTeX RDF
44	HoonSang Jin, Fabio Somenzi	CirCUs: A Hybrid Satisfiability Solver.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
44	Jinbo Huang, Adnan Darwiche	Using DPLL for Efficient OBDD Construction.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
44	Daniele Pretolani	Hypergraph Reductions and Satisfiability Problems.	SAT	2003	DBLP DOI BibTeX RDF
43	Dalila Boughaci, Habiba Drias	Solving weighted Max-Sat optimization problems using a Taboo Scatter Search metaheuristic.	SAC	2004	DBLP DOI BibTeX RDF	Max-W-Sat, Solution combination method, SAT, Scatter search, Hybrid metaheuristic, Taboo Search
42	Yung-Chih Chen, Chun-Yao Wang	Enhancing SAT-based sequential depth computation by pruning search space.	ACM Great Lakes Symposium on VLSI	2009	DBLP DOI BibTeX RDF	sequential depth, satisfiability(sat)
42	Teresa Alsinet, Felip Manyà, Jordi Planes	An efficient solver for weighted Max-SAT.	J. Glob. Optim.	2008	DBLP DOI BibTeX RDF	Weighted Branch and bound, Data structures, Heuristics, Lower bound, Max-SAT
42	Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà	Encoding Max-CSP into Partial Max-SAT.	ISMVL	2008	DBLP DOI BibTeX RDF	Minimal Support, Max-CSP, Partial Max-SAT, Encodings
42	Yannis Argyropoulos, Kostas Stergiou 0001	A Study of SAT-Based Branching Heuristics for the CSP.	SETN	2008	DBLP DOI BibTeX RDF	Branching Heuristics, CSP, SAT
42	Suchismita Roy, P. P. Chakrabarti 0001, Pallab Dasgupta	Event propagation for accurate circuit delay calculation using SAT.	ACM Trans. Design Autom. Electr. Syst.	2007	DBLP DOI BibTeX RDF	Critical delay, event propagation, SAT
42	Sylvain Darras, Gilles Dequen, Laure Devendeville, Chu Min Li	On Inconsistent Clause-Subsets for Max-SAT Solving.	CP	2007	DBLP DOI BibTeX RDF	Unit Propagation, Inconsistent Subset, Max-SAT
42	Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Marco Maratea	The SAT-based Approach to Separation Logic.	J. Autom. Reason.	2005	DBLP DOI BibTeX RDF	SAT-based decision procedures, separation logic
42	Shougo Ogata, Tatsuhiro Tsuchiya, Tohru Kikuno	SAT-Based Verification of Safe Petri Nets.	ATVA	2004	DBLP DOI BibTeX RDF	Petri nets, SAT, Bounded model checking
42	Teresa Alsinet, Felip Manyà, Jordi Planes	A Max-SAT Solver with Lazy Data Structures.	IBERAMIA	2004	DBLP DOI BibTeX RDF	data structures, heuristics, lower bound, branch and bound, Max-SAT
42	Pankaj Chauhan, Edmund M. Clarke, Daniel Kroening	A SAT-based algorithm for reparameterization in symbolic simulation.	DAC	2004	DBLP DOI BibTeX RDF	SAT checkers, safety property checking, bounded model checking, symbolic simulation, parametric representation
42	Xiaolong Jin, Jiming Liu 0001	Multiagent SAT (MASSAT): Autonomous Pattern Search in Constrained Domains.	IDEAL	2002	DBLP DOI BibTeX RDF	Autonomous Pattern Search, Satisfiability Problem (SAT), MASSAT, Multiagent System
42	Éric Grégoire, Bertrand Mazure, Lakhdar Sais	Using Failed Local Search for SAT as an Oracle for Tackling Harder A.I. Problems More Efficiently.	AIMSA	2002	DBLP DOI BibTeX RDF	logic and AI, local search, SAT, minimal models
42	Daniel Tille, Rolf Drechsler	A fast untestability proof for SAT-based ATPG.	DDECS	2009	DBLP DOI BibTeX RDF
42	Fabrizio Angiulli, Stefano Basta	Optimal Subset Selection for Classification through SAT Encodings.	IFIP AI	2008	DBLP DOI BibTeX RDF
42	Xiuqin Wang, Hao Wang, Guangsheng Ma	Hybrid SAT Solver Considering Circuit Observability.	ICYCS	2008	DBLP DOI BibTeX RDF
42	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
42	Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä	Incorporating Learning in Grid-Based Randomized SAT Solving.	AIMSA	2008	DBLP DOI BibTeX RDF
42	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
42	Lei Fang 0002, Michael S. Hsiao	A new hybrid solution to boost SAT solver performance.	DATE	2007	DBLP DOI BibTeX RDF
42	Yu Hu 0002, Victor Shih, Rupak Majumdar, Lei He 0001	Exploiting symmetry in SAT-based Boolean matching for heterogeneous FPGA technology mapping.	ICCAD	2007	DBLP DOI BibTeX RDF
42	Stephan Eggersglüß, Görschwin Fey, Rolf Drechsler	SAT-based ATPG for Path Delay Faults in Sequential Circuits.	ISCAS	2007	DBLP DOI BibTeX RDF
42	Jinbo Huang	A Case for Simple SAT Solvers.	CP	2007	DBLP DOI BibTeX RDF
42	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
42	Martin Fürer, Shiva Prasad Kasiviswanathan	Exact Max 2-Sat: Easier and Faster.	SOFSEM (1)	2007	DBLP DOI BibTeX RDF