Search results for "2-SAT"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
104	Malay K. Ganai, Aarti Gupta, Zijiang Yang 0006, Pranav Ashar	Efficient distributed SAT and SAT-based distributed Bounded Model Checking.	Int. J. Softw. Tools Technol. Transf.	2006	DBLP DOI BibTeX RDF	Distributed-SAT, Parallel SAT, Model Checking, Formal Verification, SAT, BMC
103	Weixiong Zhang	Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT.	CP	2001	DBLP DOI BibTeX RDF
101	Kei Ohmura, Kazunori Ueda	c-sat: A Parallel SAT Solver for Clusters.	SAT	2009	DBLP DOI BibTeX RDF
97	Konstantinos Georgiou, Periklis A. Papakonstantinou	Complexity and Algorithms for Well-Structured k-SAT Instances.	SAT	2008	DBLP DOI BibTeX RDF
92	Zhaohui Fu, Sharad Malik	On Solving the Partial MAX-SAT Problem.	SAT	2006	DBLP DOI BibTeX RDF
90	Tianyan Deng, Daoyun Xu	Hardness of Approximation Algorithms on k-SAT and (k, s)-SAT Problems.	ICYCS	2008	DBLP DOI BibTeX RDF
89	Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà, Carla P. Gomes	Capturing Structure with Satisfiability.	CP	2001	DBLP DOI BibTeX RDF
84	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)
84	Florian Letombe, João Marques-Silva 0001	Improvements to Hybrid Incremental SAT Algorithms.	SAT	2008	DBLP DOI BibTeX RDF
81	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
80	Jinshu Li, Heyong Wang, Jing Liu 0006, Licheng Jiao	Solving SAT problem with a multiagent evolutionary algorithm.	IEEE Congress on Evolutionary Computation	2007	DBLP DOI BibTeX RDF
78	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
77	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)
75	Robert Nieuwenhuis	SAT Modulo Theories: Enhancing SAT with Special-Purpose Algorithms.	SAT	2009	DBLP DOI BibTeX RDF
74	Yacine Boufkhad, Olivier Dubois 0002, Yannet Interian, Bart Selman	Regular Random k-SAT: Properties of Balanced Formulas.	J. Autom. Reason.	2005	DBLP DOI BibTeX RDF	regular, satisfiability, phase transition, Boolean formulae, k-SAT
74	Louise Leenen, Anbulagan, Thomas Meyer 0002, Aditya K. Ghose	Modeling and Solving Semiring Constraint Satisfaction Problems by Transformation to Weighted Semiring Max-SAT.	Australian Conference on Artificial Intelligence	2007	DBLP DOI BibTeX RDF
74	Josep Argelich, Felip Manyà	Partial Max-SAT Solvers with Clause Learning.	SAT	2007	DBLP DOI BibTeX RDF
74	Yogesh S. Mahajan, Zhaohui Fu, Sharad Malik	Zchaff2004: An Efficient SAT Solver.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
74	Daniel Le Berre, Laurent Simon	Fifty-Five Solvers in Vancouver: The SAT 2004 Competition.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
72	Tseren-Onolt Ishdorj, Alberto Leporati	Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources.	Nat. Comput.	2008	DBLP DOI BibTeX RDF	Pre-computed resourses, SAT, Membrane computing, Spiking neural P systems, 3-SAT
72	Federico Heras, Javier Larrosa	A Max-SAT Inference-Based Pre-processing for Max-Clique.	SAT	2008	DBLP DOI BibTeX RDF	Max-clique, Inference, Max-SAT
71	Mate Soos, Karsten Nohl, Claude Castelluccia	Extending SAT Solvers to Cryptographic Problems.	SAT	2009	DBLP DOI BibTeX RDF
71	Mark H. Liffiton, Karem A. Sakallah	Generalizing Core-Guided Max-SAT.	SAT	2009	DBLP DOI BibTeX RDF
71	Maarten Mariën, Johan Wittocx, Marc Denecker, Maurice Bruynooghe	SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions.	SAT	2008	DBLP DOI BibTeX RDF
71	Dave A. D. Tompkins, Holger H. Hoos	UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
69	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
69	Stefan Szeider	The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT.	SAT	2009	DBLP DOI BibTeX RDF
68	Pavel Surynek	Solving Difficult SAT Instances Using Greedy Clique Decomposition.	SARA	2007	DBLP DOI BibTeX RDF	difficult instances, search, consistency, SAT, clique
68	Bernard Jurkowiak, Chu Min Li, Gil Utard	A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers.	J. Autom. Reason.	2005	DBLP DOI BibTeX RDF	parallelism, automated theorem proving, SAT problem
67	Stefan Porschen, Tatjana Schmidt	On Some SAT-Variants over Linear Formulas.	SOFSEM	2009	DBLP DOI BibTeX RDF	not-all-equal satisfiability, exact satisfiability, linear formula, linear hypergraph, bicolorability
67	Richard Chang 0001, Suresh Purini	Amplifying ZPP^SAT[1] and the Two Queries Problem.	CCC	2008	DBLP DOI BibTeX RDF	ZPP, amplification, bounded queries
67	Olivier Bailleux, Pierre Marquis	Some Computational Aspects of distance-sat.	J. Autom. Reason.	2006	DBLP DOI BibTeX RDF	computational complexity, satisfiability
67	Andreas Goerdt, André Lanka	On the Hardness and Easiness of Random 4-SAT Formulas.	ISAAC	2004	DBLP DOI BibTeX RDF
67	Eran Halperin, Uri Zwick	Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs.	IPCO	1999	DBLP DOI BibTeX RDF
67	Niklas Eén, Alan Mishchenko, Niklas Sörensson	Applying Logic Synthesis for Speeding Up SAT.	SAT	2007	DBLP DOI BibTeX RDF
67	Federico Heras, Javier Larrosa, Albert Oliveras	MiniMaxSat: A New Weighted Max-SAT Solver.	SAT	2007	DBLP DOI BibTeX RDF
67	Sathiamoorthy Subbarayan, Dhiraj K. Pradhan	NiVER: Non-increasing Variable Elimination Resolution for Preprocessing SAT Instances.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
67	Lintao Zhang, Sharad Malik	Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms.	SAT	2003	DBLP DOI BibTeX RDF
67	Niklas Eén, Niklas Sörensson	An Extensible SAT-solver.	SAT	2003	DBLP DOI BibTeX RDF
65	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
65	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
65	Malay K. Ganai, Aarti Gupta, Zijiang Yang 0006, Pranav Ashar	Efficient Distributed SAT and SAT-Based Distributed Bounded Model Checking.	CHARME	2003	DBLP DOI BibTeX RDF
65	Maria Luisa Bonet, Katherine St. John	Efficiently Calculating Evolutionary Tree Measures Using SAT.	SAT	2009	DBLP DOI BibTeX RDF
65	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
65	Stephan Kottler, Michael Kaufmann 0001, Carsten Sinz	A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors.	SAT	2008	DBLP DOI BibTeX RDF
65	Armin Biere	Adaptive Restart Strategies for Conflict Driven SAT Solvers.	SAT	2008	DBLP DOI BibTeX RDF
65	Josep Argelich, Chu Min Li, Felip Manyà	A Preprocessor for Max-SAT Solvers.	SAT	2008	DBLP DOI BibTeX RDF
65	Eugene Goldberg	A Decision-Making Procedure for Resolution-Based SAT-Solvers.	SAT	2008	DBLP DOI BibTeX RDF
65	Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà	Modelling Max-CSP as Partial Max-SAT.	SAT	2008	DBLP DOI BibTeX RDF
65	Elizabeth Broering, Satyanarayana V. Lokam	Width-Based Algorithms for SAT and CIRCUIT-SAT: (Extended Abstract).	SAT	2003	DBLP DOI BibTeX RDF
64	Juan Frausto Solís, Marco Antonio Cruz-Chavez	A Reduced Codification for the Logical Representation of Job Shop Scheduling Problems.	ICCSA (4)	2004	DBLP DOI BibTeX RDF	the propositional satisfiability problem (SAT), Latest starting time, SAT formula, Job shop scheduling
63	Dominik Scheder, Philipp Zumstein	Satisfiability with Exponential Families.	SAT	2007	DBLP DOI BibTeX RDF	polynomial circuits, NP-hardness, satisfiability, context-free grammars, VC-dimension
63	António Morgado 0001, Paulo J. Matos, Vasco M. Manquinho, João Marques-Silva 0001	Counting Models in Integer Domains.	SAT	2006	DBLP DOI BibTeX RDF
63	Yinlei Yu, Sharad Malik	Lemma Learning in SMT on Linear Constraints.	SAT	2006	DBLP DOI BibTeX RDF
63	Roman Gershman, Ofer Strichman	Cost-Effective Hyper-Resolution for Preprocessing CNF Formulas.	SAT	2005	DBLP DOI BibTeX RDF
63	Hossein M. Sheini, Karem A. Sakallah	A Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic.	SAT	2005	DBLP DOI BibTeX RDF
62	Gábor Kusper	Solving the resolution-free SAT problem by submodel propagation in linear time.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF	resolution-free SAT, submodel propagation, Unicorn-SAT, SAT
62	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
61	Qi Zhu 0002, Nathan Kitchen, Andreas Kuehlmann, Alberto L. Sangiovanni-Vincentelli	SAT sweeping with local observability don't-cares.	DAC	2006	DBLP DOI BibTeX RDF	SAT sweeping, and/inverter graphs, observability
61	Eugene Goldberg	Boundary Points and Resolution.	SAT	2009	DBLP DOI BibTeX RDF	proof quality, resolution, SAT-solver, boundary points
61	Hans van Maaren, Linda van Norden	Hidden Threshold Phenomena for Fixed-Density SAT-formulae.	SAT	2003	DBLP DOI BibTeX RDF	Horn, graph-3-coloring, satisfiability, thresholds, 3-SAT
61	Pablo San Segundo, Cristóbal Tapia, Julio Puente, Diego Rodríguez-Losada	A New Exact Bit-Parallel Algorithm for SAT.	ICTAI (2)	2008	DBLP DOI BibTeX RDF
61	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
61	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
61	Dave A. D. Tompkins, Holger H. Hoos	Scaling and Probabilistic Smoothing: Dynamic Local Search for Unweighted MAX-SAT.	AI	2003	DBLP DOI BibTeX RDF
61	Moshe Y. Vardi	Symbolic Techniques in Propositional Satisfiability Solving.	SAT	2009	DBLP DOI BibTeX RDF
61	Alexander Hertel, Philipp Hertel, Alasdair Urquhart	Formalizing Dangerous SAT Encodings.	SAT	2007	DBLP DOI BibTeX RDF
61	Robert Nieuwenhuis, Albert Oliveras	On SAT Modulo Theories and Optimization Problems.	SAT	2006	DBLP DOI BibTeX RDF
61	Ilya Mironov, Lintao Zhang	Applications of SAT Solvers to Cryptanalysis of Hash Functions.	SAT	2006	DBLP DOI BibTeX RDF
61	Stefan Porschen, Ewald Speckenmeyer	Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF	(hidden) Horn formula, quadratic formula, minimal vertex cover, NP-completeness, satisfiability, fixed-parameter tractability
61	Gilles Dequen, Olivier Dubois 0002	kcnfs: An Efficient Solver for Random k-SAT Formulae.	SAT	2003	DBLP DOI BibTeX RDF
61	Edmund M. Clarke, Muralidhar Talupur, Helmut Veith, Dong Wang	SAT Based Predicate Abstraction for Hardware Verification.	SAT	2003	DBLP DOI BibTeX RDF
59	Adi Avidor, Ido Berkovitch, Uri Zwick	Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT.	WAOA	2005	DBLP DOI BibTeX RDF
59	Habiba Drias, Mohamed Khabzaoui	Scatter Search with Random Walk Strategy for SAT and MAX-W-SAT Problems.	IEA/AIE	2001	DBLP DOI BibTeX RDF	Weighted maximum satisfiability problem, genetic algorithm, heuristic search, optimization problem, scatter search, evolutionary approach
59	Marko Samer, Helmut Veith	Encoding Treewidth into SAT.	SAT	2009	DBLP DOI BibTeX RDF
59	Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà	Sequential Encodings from Max-CSP into Partial Max-SAT.	SAT	2009	DBLP DOI BibTeX RDF
59	Mladen Nikolic, Filip Maric, Predrag Janicic	Instance-Based Selection of Policies for SAT Solvers.	SAT	2009	DBLP DOI BibTeX RDF
59	Shai Haim, Toby Walsh	Online Estimation of SAT Solving Runtime.	SAT	2008	DBLP DOI BibTeX RDF
57	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
57	Ryan Williams 0001	Time-Space Tradeoffs for Counting NP Solutions Modulo Integers.	CCC	2007	DBLP DOI BibTeX RDF
57	Per Bjesse	Industrial Model Checking Based on Satisfiability Solvers.	SPIN	2002	DBLP DOI BibTeX RDF
57	Gi-Joon Nam, Karem A. Sakallah, Rob A. Rutenbar	Hybrid Routing for FPGAs by Integrating Boolean Satisfiability with Geometric Search.	FPL	2002	DBLP DOI BibTeX RDF
57	Himanshu Jain, Constantinos Bartzis, Edmund M. Clarke	Satisfiability Checking of Non-clausal Formulas Using General Matings.	SAT	2006	DBLP DOI BibTeX RDF
57	Hantao Zhang 0001	A Complete Random Jump Strategy with Guiding Paths.	SAT	2006	DBLP DOI BibTeX RDF
57	Marc Thurley	sharpSAT - Counting Models with Advanced Component Caching and Implicit BCP.	SAT	2006	DBLP DOI BibTeX RDF
57	Daijue 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.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
57	Ryan Williams 0001	On Computing k-CNF Formula Properties.	SAT	2003	DBLP DOI BibTeX RDF
55	Marco Antonio Cruz-Chavez, Rafael Rivera-López	A Local Search Algorithm for a SAT Representation of Scheduling Problems.	ICCSA (3)	2007	DBLP DOI BibTeX RDF	SAT formula, disjunctive graph, Reduced SAT Codification of JSSP, satisfiability, Job shop
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	Carsten Sinz	Visualizing SAT Instances and Runs of the DPLL Algorithm.	J. Autom. Reason.	2007	DBLP DOI BibTeX RDF	SAT instance, DPLL procedure
55	Jason Cong, Kirill Minkovich	Improved SAT-based Boolean matching using implicants for LUT-based FPGAs.	FPGA	2007	DBLP DOI BibTeX RDF	logic synthesis, SAT, implicant, boolean matching, FPGA lookup table
55	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
55	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
55	Malay K. Ganai, Aarti Gupta, Pranav Ashar	Beyond safety: customized SAT-based model checking.	DAC	2005	DBLP DOI BibTeX RDF	circuit cofactoring, unbounded model checking, formal verification, SAT, liveness, bounded model checking, LTL
55	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
55	Takao Asano	An Improved Analysis of Goemans and Williamson's LP-Relaxation for MAX SAT.	FCT	2003	DBLP DOI BibTeX RDF	Approximation algorithm, LP-relaxation, MAX SAT
55	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
55	Gianpiero Cabodi, Paolo Camurati, Stefano Quer	Can BDDs compete with SAT solvers on bounded model checking?	DAC	2002	DBLP DOI BibTeX RDF	model checking, formal verification, SAT, BDDs
55	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
55	Armin Biere	SAT, SMT and Applications.	LPNMR	2009	DBLP DOI BibTeX RDF