Search results for "SAT"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
43	Per Bjesse, James H. Kukula, Robert F. Damiano, Ted Stanion, Yunshan Zhu	Guiding SAT Diagnosis with Tree Decompositions.	SAT	2003	DBLP DOI BibTeX RDF
43	Renato Bruni	Solving Error Correction for Large Data Sets by Means of a SAT Solver.	SAT	2003	DBLP DOI BibTeX RDF
43	Stefan Szeider	On Fixed-Parameter Tractable Parameterizations of SAT.	SAT	2003	DBLP DOI BibTeX RDF
43	Eugene Goldberg, Yakov Novikov	How Good Can a Resolution Based SAT-solver Be?	SAT	2003	DBLP DOI BibTeX RDF
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	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	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	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
42	Abdelraouf Ishtaiwi, John Thornton 0001, Abdul Sattar 0001	Weight Redistribution for Unweighted MAX-SAT.	Australian Conference on Artificial Intelligence	2007	DBLP DOI BibTeX RDF
42	Peter Hawkins, Peter J. Stuckey	A Hybrid BDD and SAT Finite Domain Constraint Solver.	PADL	2006	DBLP DOI BibTeX RDF
42	Zhaohui Fu, Sharad Malik	Solving the minimum-cost satisfiability problem using SAT based branch-and-bound search.	ICCAD	2006	DBLP DOI BibTeX RDF	MinCostSAT, optimization, branch-and-bound, Boolean satisfiability
42	Sean Safarpour, Andreas G. Veneris, Rolf Drechsler	Integrating observability don't cares in all-solution SAT solvers.	ISCAS	2006	DBLP DOI BibTeX RDF
42	Enrico Giunchiglia, Marco Maratea	optsat: A Tool for Solving SAT Related Optimization Problems.	JELIA	2006	DBLP DOI BibTeX RDF
42	Duc Nghia Pham, John Thornton 0001, Abdul Sattar 0001	Towards an Efficient SAT Encoding for Temporal Reasoning.	CP	2006	DBLP DOI BibTeX RDF
42	Inês Lynce, João Marques-Silva 0001	Efficient data structures for backtrack search SAT solvers.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF	backtrack search, propositional satisfiability
42	Karima Benatchba, Lotfi Admane, Mouloud Koudil	Using Bees to Solve a Data-Mining Problem Expressed as a Max-Sat One.	IWINAC (2)	2005	DBLP DOI BibTeX RDF	Optimisation using bees, MBO algorithm, Data-Mining, Optimization, Satisfiability, Maximum-Satisfiability
42	Hossein M. Sheini, Karem A. Sakallah	A SAT-Based Decision Procedure for Mixed Logical/Integer Linear Problems.	CPAIOR	2005	DBLP DOI BibTeX RDF
42	Seung-Won Shin, Ki-Young Kim, Jong-Soo Jang	D-SAT: Detecting SYN Flooding Attack by Two-Stage Statistical Approach.	SAINT	2005	DBLP DOI BibTeX RDF
42	Kameshwar Chandrasekar, Michael S. Hsiao	State Set Management for SAT-based Unbounded Model Checking.	ICCD	2005	DBLP DOI BibTeX RDF
42	Horst Samulowitz, Fahiem Bacchus	Using SAT in QBF.	CP	2005	DBLP DOI BibTeX RDF
42	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
42	Aarti Gupta, Malay K. Ganai, Pranav Ashar	Lazy Constraints and SAT Heuristics for Proof-Based Abstraction.	VLSI Design	2005	DBLP DOI BibTeX RDF
42	Malay K. Ganai, Aarti Gupta, Pranav Ashar	Efficient SAT-based unbounded symbolic model checking using circuit cofactoring.	ICCAD	2004	DBLP DOI BibTeX RDF
42	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
42	Vijay Durairaj, Priyank Kalla	Guiding CNF-SAT search via efficient constraint partitioning.	ICCAD	2004	DBLP DOI BibTeX RDF
42	Eugene Nudelman, Kevin Leyton-Brown, Holger H. Hoos, Alex Devkar, Yoav Shoham	Understanding Random SAT: Beyond the Clauses-to-Variables Ratio.	CP	2004	DBLP DOI BibTeX RDF
42	Andreas Dandalis, Viktor K. Prasanna	Run-time performance optimization of an FPGA-based deduction engine for SAT solvers.	ACM Trans. Design Autom. Electr. Syst.	2002	DBLP DOI BibTeX RDF	reconfigurable components, reconfigurable computing, configurable, high performance, Boolean satisfiability, reconfigurable systems, Adaptive computing, performance trade-offs
42	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	Zenon Sadowski	On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT).	MCU	2001	DBLP DOI BibTeX RDF
42	Andreas Dandalis, Viktor K. Prasanna, Bharani Thiruvengadam	Run-Time Performance Optimization of an FPGA-Based Deduction Engine for SAT Solvers.	FPL	2001	DBLP DOI BibTeX RDF
42	Ofer Strichman	Pruning Techniques for the SAT-Based Bounded Model Checking Problem.	CHARME	2001	DBLP DOI BibTeX RDF
42	Enrico Giunchiglia, Armando Tacchella	System Description: *SAT: A Platform for the Development of Modal Decision Procedures.	CADE	2000	DBLP DOI BibTeX RDF
42	Toby Walsh	SAT v CSP.	CP	2000	DBLP DOI BibTeX RDF
42	Cristian Coarfa, Demetrios D. Demopoulos, Alfonso San Miguel Aguirre, Devika Subramanian, Moshe Y. Vardi	Random 3-SAT: The Plot Thickens.	CP	2000	DBLP DOI BibTeX RDF
42	Per Bjesse, Koen Claessen	SAT-Based Verification without State Space Traversal.	FMCAD	2000	DBLP DOI BibTeX RDF
42	Iannis Tourlakis	Time-Space Lower Bounds for SAT on Uniform and Non-Uniform Machines.	CCC	2000	DBLP DOI BibTeX RDF
42	Holger H. Hoos, Thomas Stützle	Systematic vs. Local Search for SAT.	KI	1999	DBLP DOI BibTeX RDF
42	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
42	Asheesh Khare, Nicolae Savoiu, Ashok Halambi, Peter Grun, Nikil D. Dutt, Alexandru Nicolau	V-SAT: A Visual Specification and Analysis Tool for System-On-Chip Exploration.	EUROMICRO	1999	DBLP DOI BibTeX RDF
42	Takao Ono, Tomio Hirata, Takao Asano	An Approximation Algorithm for MAX 3-SAT.	ISAAC	1995	DBLP DOI BibTeX RDF
42	Marijn Heule, Mark Dufour, Joris E. van Zwieten, Hans van Maaren	March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
41	Frédéric Lardeux	Approches Hybrides pour les problèmes de Satisfiabilité (SAT et MAX-SAT). (Hybrid approaches for the satisfiability problems (SAT and MAX-SAT)).		2005	RDF
40	Daniel Tille, Rolf Drechsler	Incremental SAT Instance Generation for SAT-based ATPG.	DDECS	2008	DBLP DOI BibTeX RDF
39	Peng Guo, Wenjian Luo, Zhifang Li, Houjun Liang, Xufa Wang	Hybridizing Evolutionary Negative Selection Algorithm and Local Search for Large-Scale Satisfiability Problems.	ISICA	2009	DBLP DOI BibTeX RDF	Evolutionary Negative Selection Algorithm, Flip Heuristic, SAT
39	Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah	Shatter: efficient symmetry-breaking for boolean satisfiability.	DAC	2003	DBLP DOI BibTeX RDF	clause learning, logic simplification, routing, symmetries, SAT, CNF, backtrack search, graph automorphism
39	Richard Ostrowski, Éric Grégoire, Bertrand Mazure, Lakhdar Sais	Recovering and Exploiting Structural Knowledge from CNF Formulas.	CP	2002	DBLP DOI BibTeX RDF	propositional reasoning and search, SAT, Boolean logic
39	Mohamed Tounsi 0002	A Genetic-Based Approach for Satisfiability Problems.	AISC	2002	DBLP DOI BibTeX RDF	Genetic Algorithm, SAT, NP-complete Problem, Hamiltonian Circuit
39	Horst Samulowitz, Fahiem Bacchus	Dynamically Partitioning for Solving QBF.	SAT	2007	DBLP DOI BibTeX RDF
39	Steven D. Prestwich	Variable Dependency in Local Search: Prevention Is Better Than Cure.	SAT	2007	DBLP DOI BibTeX RDF
39	Gilles Audemard, Lakhdar Sais	Circuit Based Encoding of CNF Formula.	SAT	2007	DBLP DOI BibTeX RDF
39	Panagiotis Manolios, Daron Vroon 0001	Efficient Circuit to CNF Conversion.	SAT	2007	DBLP DOI BibTeX RDF
39	Toni Jussila, Armin Biere, Carsten Sinz, Daniel Kröning, Christoph M. Wintersteiger	A First Step Towards a Unified Proof Checker for QBF.	SAT	2007	DBLP DOI BibTeX RDF
39	Debapratim De, Abishek Kumarasubramanian, Ramarathnam Venkatesan	Inversion Attacks on Secure Hash Functions Using satSolvers.	SAT	2007	DBLP DOI BibTeX RDF
39	Horst Samulowitz, Fahiem Bacchus	Binary Clause Reasoning in QBF.	SAT	2006	DBLP DOI BibTeX RDF
39	Eric I. Hsu, Sheila A. McIlraith	Characterizing Propagation Methods for Boolean Satisfiability.	SAT	2006	DBLP DOI BibTeX RDF
39	Hossein M. Sheini, Karem A. Sakallah	A Progressive Simplifier for Satisfiability Modulo Theories.	SAT	2006	DBLP DOI BibTeX RDF
39	Stefan Porschen, Ewald Speckenmeyer, Bert Randerath	On Linear CNF Formulas.	SAT	2006	DBLP DOI BibTeX RDF	linear CNF formula, edge colouring, linear hypergraph, NP-completeness, satisfiability, latin square
39	Ian P. Gent, Andrew G. D. Rowley	Local and Global Complete Solution Learning Methods for QBF.	SAT	2005	DBLP DOI BibTeX RDF
39	Hans van Maaren, Linda van Norden	Sums of Squares, Satisfiability and Maximum Satisfiability.	SAT	2005	DBLP DOI BibTeX RDF
39	Finnegan Southey	Constraint Metrics for Local Search.	SAT	2005	DBLP DOI BibTeX RDF
39	Lyndon Drake, Alan M. Frisch	The Interaction Between Inference and Branching Heuristics.	SAT	2003	DBLP DOI BibTeX RDF
39	Guilhem Semerjian, Rémi Monasson	A Study of Pure Random Walk on Random Satisfiability Problems with "Physical" Methods.	SAT	2003	DBLP DOI BibTeX RDF
39	John V. Franco, Michal Kouril, John S. Schlipf, Jeffrey Ward, Sean A. Weaver, Michael R. Dransfield, W. Mark Vanfleet	SBSAT: a State-Based, BDD-Based Satisfiability Solver.	SAT	2003	DBLP DOI BibTeX RDF
39	Youichi Hanatani, Takashi Horiyama, Kazuo Iwama	Density Condensation of Boolean Formulas.	SAT	2003	DBLP DOI BibTeX RDF
38	Elitza N. Maneva, Elchanan Mossel, Martin J. Wainwright	A new look at survey propagation and its generalizations.	J. ACM	2007	DBLP DOI BibTeX RDF	sum-product, survey propagation, message-passing, Markov random field, belief propagation, Gibbs sampling, Satisfiability problems, factor graph, k-SAT
38	Thibaut Feydy, Peter J. Stuckey	Lazy Clause Generation Reengineered.	CP	2009	DBLP DOI BibTeX RDF
38	R. Ryan Williams	Time-Space Tradeoffs for Counting NP Solutions Modulo Integers.	Comput. Complex.	2008	DBLP DOI BibTeX RDF	68Q17, Subject classification. 68Q15
38	Inês Lynce, Ana Graça, João Marques-Silva 0001, Arlindo L. Oliveira	Haplotype Inference with Boolean Constraint Solving: An Overview.	ICTAI (1)	2008	DBLP DOI BibTeX RDF
38	Ido Roll, Eunjeong Ryu, Jonathan Sewall, Brett Leber, Bruce M. McLaren, Vincent Aleven, Kenneth R. Koedinger	Towards Teaching Metacognition: Supporting Spontaneous Self-Assessment.	Intelligent Tutoring Systems	2006	DBLP DOI BibTeX RDF
38	Gregory B. Sorkin	Some Notes on Random Satisfiability.	SAGA	2001	DBLP DOI BibTeX RDF
38	Priyank Kalla, Zhihong Zeng, Maciej J. Ciesielski, ChiLai Huang	A BDD-Based Satisfiability Infrastructure Using the Unate Recursive Paradigm.	DATE	2000	DBLP DOI BibTeX RDF
38	Gonzalo Escalada-Imaz, Rodolfo Torres-Velázquez	Complexity Issues in the Davis and Putnam Scheme.	AIMSA	2000	DBLP DOI BibTeX RDF	Computational Complexity, Search, Theorem Proving, Automated Reasoning
38	Toby Walsh	Reformulating Propositional Satisfiability as Constraint Satisfaction.	SARA	2000	DBLP DOI BibTeX RDF
38	Marco Baioletti, Stefano Marcugini, Alfredo Milani	An Extension of SATPLAN for Planning with Constraints.	AIMSA	1998	DBLP DOI BibTeX RDF
38	E. Thomas Richards, Barry Richards	Non-systematic Search and Learning: An Empirical Study.	CP	1998	DBLP DOI BibTeX RDF
38	Harry Buhrman, Lance Fortnow, Leen Torenvliet	Six Hypotheses in Search of a Theorem.	CCC	1997	DBLP DOI BibTeX RDF
38	Ernst-Rüdiger Olderog	Correctness of Concurrent Processes.	MFCS	1989	DBLP DOI BibTeX RDF
38	Yannet Interian	Approximation Algorithm for Random MAX- kSAT.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
38	Carlos Ansótegui, Felip Manyà	Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
37	Aarti Gupta, Malay K. Ganai, Chao Wang 0001, Zijiang Yang 0006, Pranav Ashar	Learning from BDDs in SAT-based bounded model checking.	DAC	2003	DBLP DOI BibTeX RDF	BDD learning, learning, SAT, BDDs, bounded model checking, boolean satisfiability, SAT solvers, property checking
37	Yexin Zheng, Michael S. Hsiao, Chao Huang	SAT-based equivalence checking of threshold logic designs for nanotechnologies.	ACM Great Lakes Symposium on VLSI	2008	DBLP DOI BibTeX RDF	SAT, nanotechnology, equivalence checking, threshold logic
37	Kaile Su, Qingliang Chen, Abdul Sattar 0001, Weiya Yue, Guanfeng Lv, Xizhong Zheng	Verification of Authentication Protocols for Epistemic Goals via SAT Compilation.	J. Comput. Sci. Technol.	2006	DBLP DOI BibTeX RDF	formal verification, SAT, authentication protocol, knowledge structure
37	Giuditta Franco	A Polymerase Based Algorithm for SAT.	ICTCS	2005	DBLP DOI BibTeX RDF	Polymerase, Restriction Enzymes, XPCR, SAT, DNA Computing
37	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