Search results for "3-SAT"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
29	Massimo D'Antonio, Giorgio Delzanno	SAT-Based Analysis of Cellular Automata.	ACRI	2004	DBLP DOI BibTeX RDF
29	Cristian Coarfa, Demetrios D. Demopoulos, Alfonso San Miguel Aguirre, Devika Subramanian, Moshe Y. Vardi	Random 3-SAT: The Plot Thickens.	Constraints An Int. J.	2003	DBLP DOI BibTeX RDF
29	Kenneth L. McMillan	Methods for exploiting SAT solvers in unbounded model checking.	MEMOCODE	2003	DBLP DOI BibTeX RDF
29	Lintao Zhang, Sharad Malik	Validating SAT Solvers Using an Independent Resolution-Based Checker: Practical Implementations and Other Applications.	DATE	2003	DBLP DOI BibTeX RDF
29	Ming Shao, Guanghui Li 0001, Xiaowei Li 0001	SAT-Based Algorithm of Verification for Port Order Fault.	Asian Test Symposium	2003	DBLP DOI BibTeX RDF
29	Edmund M. Clarke	SAT-Based Counterexample Guided Abstraction Refinement in Model Checking.	CADE	2003	DBLP DOI BibTeX RDF
29	Madhu K. Iyer, Ganapathy Parthasarathy, Kwang-Ting Cheng	SATORI - A Fast Sequential SAT Engine for Circuits.	ICCAD	2003	DBLP DOI BibTeX RDF
29	Eduardo Rodriguez-Tello, Jose Torres-Jimenez	ERA: An Algorithm for Reducing the Epistasis of SAT Problems.	GECCO	2003	DBLP DOI BibTeX RDF
29	Carlos Ansótegui, Felip Manyà	New Logical and Complexity Results for Signed-SAT.	ISMVL	2003	DBLP DOI BibTeX RDF
29	Amol Dattatraya Mali, Yevgeny Lipen	MFSAT: A SAT Solver Using Multi-Flip Local Search.	ICTAI	2003	DBLP DOI BibTeX RDF
29	Samir Sapra, Michael Theobald, Edmund M. Clarke	SAT-Based Algorithms for Logic Minimization.	ICCD	2003	DBLP DOI BibTeX RDF
29	Daniel G. Saab, Jacob A. Abraham, Vivekananda M. Vedula	Formal Verification Using Bounded Model Checking: SAT versus Sequential ATPG Engines.	VLSI Design	2003	DBLP DOI BibTeX RDF
29	Hyeong-Ju Kang, In-Cheol Park	SAT-based unbounded symbolic model checking.	DAC	2003	DBLP DOI BibTeX RDF	boolean satisfiability checking, unbounded symbolic model checking, formal verification, symbolic model checking
29	Anbulagan, John Thornton 0001, Abdul Sattar 0001	Dynamic Variable Filtering for Hard Random 3-SAT Problems.	Australian Conference on Artificial Intelligence	2003	DBLP DOI BibTeX RDF	Search, Constraints, Problem Solving
29	Michael Lewin, Dror Livnat, Uri Zwick	Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems.	IPCO	2002	DBLP DOI BibTeX RDF
29	Teresa Alsinet, Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà	Minimal and Redundant SAT Encodings for the All-Interval-Series Problem.	CCIA	2002	DBLP DOI BibTeX RDF
29	Seda Ogrenci Memik, Farzan Fallah	Accelerated SAT-based Scheduling of Control/Data Flow Graphs.	ICCD	2002	DBLP DOI BibTeX RDF
29	Carlos Ansótegui, Felip Manyà	Bridging the Gap between SAT and CSP.	CP	2002	DBLP DOI BibTeX RDF
29	Frank Hutter, Dave A. D. Tompkins, Holger H. Hoos	Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT.	CP	2002	DBLP DOI BibTeX RDF
29	Alessandro Armando, Luca Compagna	Automatic SAT-Compilation of Protocol Insecurity Problems via Reduction to Planning.	FORTE	2002	DBLP DOI BibTeX RDF	Verification, Network security
29	Pankaj Chauhan, Edmund M. Clarke, James H. Kukula, Samir Sapra, Helmut Veith, Dong Wang	Automated Abstraction Refinement for Model Checking Large State Spaces Using SAT Based Conflict Analysis.	FMCAD	2002	DBLP DOI BibTeX RDF
29	Malay K. Ganai, Adnan Aziz	Improved SAT-Based Bounded Reachability Analysis.	ASP-DAC/VLSI Design	2002	DBLP DOI BibTeX RDF
29	Uwe Schöning	New Algorithms for k -SAT Based on the Local Search Principle.	MFCS	2001	DBLP DOI BibTeX RDF
29	Andreas Goerdt, Michael Krivelevich	Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods.	STACS	2001	DBLP DOI BibTeX RDF
29	Alfonso San Miguel Aguirre, Moshe Y. Vardi	Random 3-SAT and BDDs: The Plot Thickens Further.	CP	2001	DBLP DOI BibTeX RDF
29	Kevin Chen, Vijay Ramachandran	A Space-Efficient Randomized DNA Algorithm for k-SAT.	DNA Computing	2000	DBLP DOI BibTeX RDF
29	Parosh Aziz Abdulla, Per Bjesse, Niklas Eén	Symbolic Reachability Analysis Based on SAT-Solvers.	TACAS	2000	DBLP DOI BibTeX RDF
29	Johannes Köbler, Jochen Messner	Is the Standard Proof System for SAT P-Optimal?	FSTTCS	2000	DBLP DOI BibTeX RDF
29	Paul Tafertshofer, Andreas Ganz	SAT based ATPG using fast justification and propagation in the implication graph.	ICCAD	1999	DBLP DOI BibTeX RDF
27	Daniel Singer, Anthony Monnet	JaCk-SAT: A New Parallel Scheme to Solve the Satisfiability Problem (SAT) Based on Join-and-Check.	PPAM	2007	DBLP DOI BibTeX RDF
27	Francis Y. L. Chin, Zeyu Guo 0001, He Sun 0001	Minimum Manhattan network is NP-complete.	SCG	2009	DBLP DOI BibTeX RDF	3-sat, minimum Manhattan network, NP-complete
26	Andris Ambainis, Julia Kempe, Or Sattath	A quantum lovász local lemma.	STOC	2010	DBLP DOI BibTeX RDF	local lemma, quanum SAT, random quantum sat, quantum computation, probabilistic method
26	Oliver Kullmann	Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems.	Ann. Math. Artif. Intell.	2004	DBLP DOI BibTeX RDF	satisfiability problem (SAT), systems with partial instantiation, generalised resolution, lower bounds for resolution, upper bounds for SAT algorithms, automatisation of proof systems, generalised input resolution, generalised width restricted resolution, induced width of constraint satisfaction problems, constraint satisfaction problems, propositional logic, polynomial time hierarchies
26	Ashish Sabharwal	SymChaff: exploiting symmetry in a structure-aware satisfiability solver.	Constraints An Int. J.	2009	DBLP DOI BibTeX RDF	SymChaff, Complete multi-class symmetry, Global symmetry, High-level representation, Planning, SAT, Boolean satisfiability
26	Nicolas T. Courtois, Sean O'Neil, Jean-Jacques Quisquater	Practical Algebraic Attacks on the Hitag2 Stream Cipher.	ISC	2009	DBLP DOI BibTeX RDF	Hitag 2 algorithm, MiFare Crypto-1 cipher, Gröbner bases, Boolean functions, stream ciphers, RFID tags, SAT solvers, algebraic cryptanalysis
26	Hidde de Jong, Michel Page	Search for Steady States of Piecewise-Linear Differential Equation Models of Genetic Regulatory Networks.	IEEE ACM Trans. Comput. Biol. Bioinform.	2008	DBLP DOI BibTeX RDF	piecewise-linear differential equations, large-scale systems, steady states, Genetic regulatory networks, SAT problem
26	Hasan Amjad	Data Compression for Proof Replay.	J. Autom. Reason.	2008	DBLP DOI BibTeX RDF	Proof translation, Interactive theorem proving, SAT solvers
26	Yang Liu 0003, Jun Sun 0001, Jin Song Dong	An analyzer for extended compositional process algebras.	ICSE Companion	2008	DBLP DOI BibTeX RDF	simulation, model checking, fairness, sat solvers
26	Éric Grégoire, Bertrand Mazure, Cédric Piette	Local-search Extraction of MUSes.	Constraints An Int. J.	2007	DBLP DOI BibTeX RDF	Minimally unsatisfiable subformulas, Local search, SAT
26	Yu-Shen Yang, Subarnarekha Sinha, Andreas G. Veneris, Robert K. Brayton	Automating Logic Rectification by Approximate SPFDs.	ASP-DAC	2007	DBLP DOI BibTeX RDF	SAT-based algorithm, approximate SPFD, digital VLSI cycle, incremental rewiring-based optimization operations, automated logic rectification tools, predefined logic transformations, memory/time explosion problem, design errors
26	Conghua Zhou	A compositional symbolic verification framework for concurrent software.	Infoscale	2007	DBLP DOI BibTeX RDF	model checking, composition, abstract, SAT
26	Lucas Bordeaux, Youssef Hamadi, Lintao Zhang	Propositional Satisfiability and Constraint Programming: A comparative survey.	ACM Comput. Surv.	2006	DBLP DOI BibTeX RDF	Search, constraint satisfaction, SAT
26	Jerome L. Paul, Michal Kouril, Kenneth A. Berman	A template library to facilitate teaching message passing parallel computing.	SIGCSE	2006	DBLP DOI BibTeX RDF	teaching aid, template library, parallel processing, MPI, SAT, beowulf clusters
26	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
26	Laurent Simon, Daniel Le Berre, Edward A. Hirsch	The SAT2002 competition.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF	empirical evaluation, Boolean satisfiability (SAT)
26	Orna Grumberg, Flavio Lerda, Ofer Strichman, Michael Theobald	Proof-guided underapproximation-widening for multi-process systems.	POPL	2005	DBLP DOI BibTeX RDF	SAT proofs, underapproximation-widening, abstraction, software verification, bounded model checking
26	Michal Kouril, Jerome L. Paul	A parallel backtracking framework (BkFr) for single and multiple clusters.	Conf. Computing Frontiers	2004	DBLP DOI BibTeX RDF	inter-cluster communication, intra-cluster communication, MPI, SAT, backtracking, ICI
26	Pilar de la Torre	How efficiently can room at the bottom be traded away for speed at the top?	Nat. Comput.	2003	DBLP DOI BibTeX RDF	bio-molecular and classical algorithms, Covering Code Creation, randomized bio-molecular computing model, sub-exponential space and time product efficiency, k-SAT
26	Johan Håstad	Some optimal inapproximability results.	J. ACM	2001	DBLP DOI BibTeX RDF	NP-hard optimization problems, max-sat, linear equations, Inapproximability, probabilistically checkable proofs
26	Paulo F. Flores, Horácio C. Neto, João P. Marques Silva	An exact solution to the minimum size test pattern problem.	ACM Trans. Design Autom. Electr. Syst.	2001	DBLP DOI BibTeX RDF	propositional satisfiability (SAT), verification and test, built-in self-test (BIST), Automatic test pattern generation (ATPG), integer linear programming (ILP)
25	Mohsen Bayati, David Gamarnik, Prasad Tetali	Combinatorial approach to the interpolation method and scaling limits in sparse random graphs.	STOC	2010	DBLP DOI BibTeX RDF	scaling limit, constraint satisfaction problems, random graphs, partition function
25	Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley	A Theoretical Analysis of the k-Satisfiability Search Space.	SLS	2009	DBLP DOI BibTeX RDF
25	Yakir Vizel, Orna Grumberg	Interpolation-sequence based model checking.	FMCAD	2009	DBLP DOI BibTeX RDF
25	Enrico Giunchiglia, Nicola Leone, Marco Maratea	On the relation among answer set solvers.	Ann. Math. Artif. Intell.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 68N17, 68T27, 68T20
25	João Marques-Silva 0001, Inês Lynce, Vasco M. Manquinho	Symmetry Breaking for Maximum Satisfiability.	LPAR	2008	DBLP DOI BibTeX RDF
25	Pascal Vander-Swalmen, Gilles Dequen, Michaël Krajecki	On Multi-threaded Satisfiability Solving with OpenMP.	IWOMP	2008	DBLP DOI BibTeX RDF	collaborative, parallel, combinatorial optimization, satisfiability, OpenMP, dll
25	Miroslav N. Velev, Ping Gao 0002	Comparison of Boolean Satisfiability Encodings on FPGA Detailed Routing Problems.	DATE	2008	DBLP DOI BibTeX RDF
25	Omer Bar-Ilan, Oded Fuhrmann, Shlomo Hoory, Ohad Shacham, Ofer Strichman	Linear-Time Reductions of Resolution Proofs.	Haifa Verification Conference	2008	DBLP DOI BibTeX RDF
25	Cédric Piette	Let the Solver Deal with Redundancy.	ICTAI (1)	2008	DBLP DOI BibTeX RDF
25	Jinbo Huang	Universal Booleanization of Constraint Models.	CP	2008	DBLP DOI BibTeX RDF
25	Loganathan Lingappan, Niraj K. Jha	Satisfiability-Based Automatic Test Program Generation and Design for Testability for Microprocessors.	IEEE Trans. Very Large Scale Integr. Syst.	2007	DBLP DOI BibTeX RDF
25	Fernando Brizzolari, Igor Melatti, Enrico Tronci, Giuseppe Della Penna	Disk Based Software Verification via Bounded Model Checking.	APSEC	2007	DBLP DOI BibTeX RDF
25	Ana Graça, João Marques-Silva 0001, Inês Lynce, Arlindo L. Oliveira	Efficient Haplotype Inference with Pseudo-boolean Optimization.	AB	2007	DBLP DOI BibTeX RDF	pure parsimony, pseudo-Boolean optimization, haplotype inference
25	Miquel Ramírez, Hector Geffner	Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT.	CP	2007	DBLP DOI BibTeX RDF
25	Sayak Ray, Pallab Dasgupta, P. P. Chakrabarti 0001	A New Pseudo-Boolean Satisfiability based approach to Power Mode Schedulability Analysis.	VLSI Design	2007	DBLP DOI BibTeX RDF
25	Alan Mishchenko, Jin S. Zhang, Subarnarekha Sinha, Jerry R. Burch, Robert K. Brayton, Malgorzata Chrzanowska-Jeske	Using simulation and satisfiability to compute flexibilities in Boolean networks.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2006	DBLP DOI BibTeX RDF
25	Gilles Dequen, Olivier Dubois 0002	An Efficient Approach to Solving Random k-satProblems.	J. Autom. Reason.	2006	DBLP DOI BibTeX RDF	solving, heuristic, satisfiability
25	Enrico Giunchiglia, Yuliya Lierler, Marco Maratea	Answer Set Programming Based on Propositional Satisfiability.	J. Autom. Reason.	2006	DBLP DOI BibTeX RDF	answer set programming, propositional satisfiability
25	DoRon B. Motter, Jarrod A. Roy, Igor L. Markov	Resolution cannot polynomially simulate compressed-BFS.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF
25	Gianpiero Cabodi, Alex Kondratyev, Luciano Lavagno, Sergio Nocco, Stefano Quer, Yosinori Watanabe	A BMC-based formulation for the scheduling problem of hardware systems.	Int. J. Softw. Tools Technol. Transf.	2005	DBLP DOI BibTeX RDF	Hardware scheduling, Binary decision diagrams, Bounded model checking, Satisfiability solvers
25	Habiba Drias, Souhila Sadeg, Safa Yahi	Cooperative Bees Swarm for Solving the Maximum Weighted Satisfiability Problem.	IWANN	2005	DBLP DOI BibTeX RDF
25	Kameshwar Chandrasekar, Michael S. Hsiao	Integration of Learning Techniques into Incremental Satisfiability for Efficient Path-Delay Fault Test Generation.	DATE	2005	DBLP DOI BibTeX RDF
25	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
25	Nikolay Pelov, Eugenia Ternovska	Reducing Inductive Definitions to Propositional Satisfiability.	ICLP	2005	DBLP DOI BibTeX RDF
25	Babita Sharma, Paritosh K. Pandya, Supratik Chakraborty	Bounded Validity Checking of Interval Duration Logic.	TACAS	2005	DBLP DOI BibTeX RDF
25	K. Rustan M. Leino, Madan Musuvathi, Xinming Ou	A Two-Tier Technique for Supporting Quantifiers in a Lazily Proof-Explicating Theorem Prover.	TACAS	2005	DBLP DOI BibTeX RDF
25	Honglei Zeng, Sheila A. McIlraith	The Role of Redundant Clauses in Solving Satisfiability Problems.	CP	2005	DBLP DOI BibTeX RDF
25	Gi-Joon Nam, Fadi A. Aloul, Karem A. Sakallah, Rob A. Rutenbar	A Comparative Study of Two Boolean Formulations of FPGA Detailed Routing Constraints.	IEEE Trans. Computers	2004	DBLP DOI BibTeX RDF
25	Jennifer L. Wong, Gang Qu 0001, Miodrag Potkonjak	Optimization-intensive watermarking techniques for decision problems.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2004	DBLP DOI BibTeX RDF
25	Daniel Kroening, Joël Ouaknine, Sanjit A. Seshia, Ofer Strichman	Abstraction-Based Satisfiability Solving of Presburger Arithmetic.	CAV	2004	DBLP DOI BibTeX RDF
25	Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah	Breaking Instance-Independent Symmetries in Exact Graph Coloring.	DATE	2004	DBLP DOI BibTeX RDF
25	Ruiming Li, Dian Zhou, Donglei Du	Satisfiability and integer programming as complementary tools.	ASP-DAC	2004	DBLP DOI BibTeX RDF
25	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
25	Tetsuya Iizuka, Makoto Ikeda, Kunihiro Asada	High speed layout synthesis for minimum-width CMOS logic cells via Boolean satisfiability.	ASP-DAC	2004	DBLP DOI BibTeX RDF
25	Christian Thiffault, Fahiem Bacchus, Toby Walsh	Solving Non-clausal Formulas with DPLL Search.	CP	2004	DBLP DOI BibTeX RDF
25	Mohammad Awedh, Fabio Somenzi	Increasing the Robustness of Bounded Model Checking by Computing Lower Bounds on the Reachable States.	FMCAD	2004	DBLP DOI BibTeX RDF
25	Malek Mouhoub, Samira Sadaoui	Systematic versus Non-systematic Methods for Solving Incremental Satisfiability.	IEA/AIE	2004	DBLP DOI BibTeX RDF	Genetic Algorithms, Local Search, Branch and Bound, Propositional Satisfiability
25	Olga Tveretina, Hans Zantema	A Proof System and a Decision Procedure for Equality Logic.	LATIN	2004	DBLP DOI BibTeX RDF	Equality logic, satisfiability, resolution
25	Arathi Ramani, Igor L. Markov	Automatically Exploiting Symmetries in Constraint Programming.	CSCLP	2004	DBLP DOI BibTeX RDF
25	Evguenii I. Goldberg, Yakov Novikov	Verification of Proofs of Unsatisfiability for CNF Formulas.	DATE	2003	DBLP DOI BibTeX RDF
25	Ian P. Gent, Holger H. Hoos, Andrew G. D. Rowley, Kevin Smyth	Using Stochastic Local Search to Solve Quantified Boolean Formulae.	CP	2003	DBLP DOI BibTeX RDF
25	Gi-Joon Nam, Karem A. Sakallah, Rob A. Rutenbar	A new FPGA detailed routing approach via search-based Booleansatisfiability.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2002	DBLP DOI BibTeX RDF
25	Per Bjesse, Tim Leonard, Abdel Mokkedem	Finding Bugs in an Alpha Microprocessor Using Satisfiability Solvers.	CAV	2001	DBLP DOI BibTeX RDF
25	Masahiro Nagamatu, Torao Yanaru	Test generation by Lagrange programming neural network.	KES (1)	1998	DBLP DOI BibTeX RDF
25	Scott A. Moore	Testing Speech Act Theory and Its Applicability to EDI and Other Computer-Processable Messages.	HICSS (2)	1996	DBLP DOI BibTeX RDF
25	Ashraful A. Chowdhury, C. Van Nelson, Clinton P. Fuelling, Roy L. McCormick	Predicting success of a beginning computer course using logistic regression (abstract only).	ACM Conference on Computer Science	1987	DBLP DOI BibTeX RDF
25	Maanak Gupta, Mahmoud Abdelsalam, Mohammad Nur Nobi (eds.)	Sat-CPS@CODASPY 2023: Proceedings of the 2023 ACM Workshop on Secure and Trustworthy Cyber-Physical Systems, Charlotte, NC, USA, 26 April 2023	SaT-CPS@ODASPY	2023	DBLP DOI BibTeX RDF
25	Meena Mahajan, Friedrich Slivovsky (eds.)	26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy	SAT	2023	DBLP BibTeX RDF
25	Abhijith Sharma, Yijun Bian, Vatsal Nanda, Phil Munz, Apurva Narayan	Vulnerability of CNNs against Multi-Patch Attacks.	SAT-CPS@CODASPY	2023	DBLP DOI BibTeX RDF
25	Bharath K. Samanthula, Hemadri Patel	Privacy-Preserving and Outsourced Computation Framework for Power Usage Control in Smart Grids.	SAT-CPS@CODASPY	2023	DBLP DOI BibTeX RDF