Search results for "3-SAT"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
36	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
36	Giuditta Franco	A Polymerase Based Algorithm for SAT.	ICTCS	2005	DBLP DOI BibTeX RDF	Polymerase, Restriction Enzymes, XPCR, SAT, DNA Computing
36	Héctor Sanvicente Sánchez, Juan Frausto Solís, Froilán Imperial-Valenzuela	Solving SAT Problems with TA Algorithms Using Constant and Dynamic Markov Chains Length.	AAIM	2005	DBLP DOI BibTeX RDF	Cooling Scheme, Dynamic Markov Chains, Simulated Annealing, Combinatorial Optimization, SAT problem, Heuristic Optimization, Threshold Accepting
36	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
36	Edmund M. Clarke, Daniel Kroening, Natasha Sharygina, Karen Yorav	Predicate Abstraction of ANSI-C Programs Using SAT.	Formal Methods Syst. Des.	2004	DBLP DOI BibTeX RDF	ANSI-C, SAT, predicate abstraction
36	Slawomir Pilarski, Gracia Hu	SAT with partial clauses and back-leaps.	DAC	2002	DBLP DOI BibTeX RDF	SAT, boolean satisfiability, design verification
36	Bernhard Beckert, Reiner Hähnle, Felip Manyà	The 2-SAT Problem of Regular Signed CNF Formulas.	ISMVL	2000	DBLP DOI BibTeX RDF	signed logic, NP-completeness, SAT, Many-valued logic
36	Uwe Schöning	A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems.	FOCS	1999	DBLP DOI BibTeX RDF	satisfiability, constraint satisfaction problem, local-search algorithm, k-SAT
36	Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy	On the Structure of Industrial SAT Instances.	CP	2009	DBLP DOI BibTeX RDF
36	Knot Pipatsrisawat, Adnan Darwiche	On the Power of Clause-Learning SAT Solvers with Restarts.	CP	2009	DBLP DOI BibTeX RDF
36	Miroslav N. Velev, Ping Gao 0002	Efficient SAT-based techniques for Design of Experiments by using static variable ordering.	ISQED	2009	DBLP DOI BibTeX RDF
36	Enrico Giunchiglia, Marco Maratea	Improving Plan Quality in SAT-Based Planning.	AI*IA	2009	DBLP DOI BibTeX RDF
36	Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä	Strategies for Solving SAT in Grids by Randomized Search.	AISC/MKM/Calculemus	2008	DBLP DOI BibTeX RDF
36	Su Yong Kim, Soohong Park	Estimation of Absolute Positioning of Mobile Robot Using U-SAT.	NPC	2007	DBLP DOI BibTeX RDF
36	Martin Lukasiewycz, Michael Glaß, Christian Haubelt, Jürgen Teich	SAT-decoding in evolutionary algorithms for discrete constrained optimization problems.	IEEE Congress on Evolutionary Computation	2007	DBLP DOI BibTeX RDF
36	Geng-Dian Huang, Bow-Yaw Wang	Complete SAT-Based Model Checking for Context-Free Processes.	ATVA	2007	DBLP DOI BibTeX RDF
36	Miroslav N. Velev	Exploiting hierarchy and structure to efficiently solve graph coloring as SAT.	ICCAD	2007	DBLP DOI BibTeX RDF
36	Olivier Fourdrinoy, Éric Grégoire, Bertrand Mazure, Lakhdar Sais	Reducing hard SAT instances to polynomial ones.	IRI	2007	DBLP DOI BibTeX RDF
36	Enrico Giunchiglia, Marco Maratea	SAT-Based Planning with Minimal-#actions Plans and "soft" Goals.	AI*IA	2007	DBLP DOI BibTeX RDF
36	Ryan Williams 0001	Inductive Time-Space Lower Bounds for Sat and Related Problems.	Comput. Complex.	2006	DBLP DOI BibTeX RDF	68Q17, Subject classification
36	Arist Kojevnikov, Alexander S. Kulikov	A new approach to proving upper bounds for MAX-2-SAT.	SODA	2006	DBLP DOI BibTeX RDF
36	Marco Cadoli, Toni Mancini, Fabio Patrizi	SAT as an Effective Solving Technology for Constraint Problems.	ISMIS	2006	DBLP DOI BibTeX RDF
36	Romanelli Lodron Zuim, José T. de Sousa, Claudionor José Nunes Coelho Jr.	A Fast SAT Solver Strategy Based on Negated Clauses.	VLSI-SoC	2006	DBLP DOI BibTeX RDF
36	Clifford R. Johnson	Automating the DNA Computer: Solving n-Variable 3-SAT Problems.	DNA	2006	DBLP DOI BibTeX RDF
36	Wenhui Zhang	SAT-Based Verification of LTL Formulas.	FMICS/PDMC	2006	DBLP DOI BibTeX RDF
36	Sagar Chaki	SAT-Based Software Certification.	TACAS	2006	DBLP DOI BibTeX RDF
36	James R. Ezick, Samuel B. Luckenbill, Donald Nguyen, Péter Szilágyi, John Starks, Richard A. Lethin	Poster reception - Alef parallel SAT solver for HPC hardware.	SC	2006	DBLP DOI BibTeX RDF
36	Raihan H. Kibria, You Li	Optimizing the Initialization of Dynamic Decision Heuristics in DPLL SAT Solvers Using Genetic Programming.	EuroGP	2006	DBLP DOI BibTeX RDF
36	Albert Atserias	Distinguishing SAT from Polynomial-Size Circuits, through Black-Box Queries.	CCC	2006	DBLP DOI BibTeX RDF
36	Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Peter van Rossum, Stephan Schulz 0001, Roberto Sebastiani	MathSAT: Tight Integration of SAT and Mathematical Decision Procedures.	J. Autom. Reason.	2005	DBLP DOI BibTeX RDF	Satisfiability module theory, Integrated decision procedures, Linear arithmetic logic, Propositional satisfiability
36	Daijue Tang, Sharad Malik, Aarti Gupta, C. Norris Ip	Symmetry Reduction in SAT-Based Model Checking.	CAV	2005	DBLP DOI BibTeX RDF
36	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
36	ShengYu Shen, Ying Qin, Sikun Li	A fast counterexample minimization approach with refutation analysis and incremental SAT.	ASP-DAC	2005	DBLP DOI BibTeX RDF
36	Zurab Khasidashvili, Alexander Nadel, Amit Palti, Ziyad Hanna	Simultaneous SAT-Based Model Checking of Safety Properties.	Haifa Verification Conference	2005	DBLP DOI BibTeX RDF
36	Daniel Singer, Alain Vagner	Parallel Resolution of the Satisfiability Problem (SAT) with OpenMP and MPI.	PPAM	2005	DBLP DOI BibTeX RDF
36	ShengYu Shen, Ying Qin, Sikun Li	Minimizing Counterexample with Unit Core Extraction and Incremental SAT.	VMCAI	2005	DBLP DOI BibTeX RDF
36	Ryan Williams 0001	Better Time-Space Lower Bounds for SAT and Related Problems.	CCC	2005	DBLP DOI BibTeX RDF
36	Hachemi Bennaceur	A Comparison between SAT and CSP Techniques.	Constraints An Int. J.	2004	DBLP DOI BibTeX RDF	constraint satisfaction, satisfiability
36	Jianzhou Zhao, Jinian Bian, Weimin Wu	PFGASAT- A Genetic SAT Solver Combining Partitioning and Fuzzy Strategie.	COMPSAC	2004	DBLP DOI BibTeX RDF
36	Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert	Algorithms for SAT Based on Search in Hamming Balls.	STACS	2004	DBLP DOI BibTeX RDF
36	Jinbo Huang, Adnan Darwiche	Toward Good Elimination Orders for Symbolic SAT Solving.	ICTAI	2004	DBLP DOI BibTeX RDF
36	Wei Li 0002, Peter van Beek	Guiding Real-World SAT Solving with Dynamic Hypergraph Separator Decomposition.	ICTAI	2004	DBLP DOI BibTeX RDF
36	Olivier Roussel	Another SAT to CSP Conversion.	ICTAI	2004	DBLP DOI BibTeX RDF
36	Orna Grumberg, Assaf Schuster, Avi Yadgar	Memory Efficient All-Solutions SAT Solver and Its Application for Reachability Analysis.	FMCAD	2004	DBLP DOI BibTeX RDF
36	Feng Lu 0002, Li-C. Wang, Kwang-Ting Cheng, Ric C.-Y. Huang	A Circuit SAT Solver With Signal Correlation Guided Learning.	DATE	2003	DBLP DOI BibTeX RDF
36	Gianpiero Cabodi, Sergio Nocco, Stefano Quer	Improving SAT-Based Bounded Model Checking by Means of BDD-Based Approximate Traversals.	DATE	2003	DBLP DOI BibTeX RDF
36	Aarti Gupta, Malay K. Ganai, Zijiang Yang 0006, Pranav Ashar	Iterative Abstraction using SAT-based BMC with Proof Analysis.	ICCAD	2003	DBLP DOI BibTeX RDF
36	Simon de Givry, Javier Larrosa, Pedro Meseguer, Thomas Schiex	Solving Max-SAT as Weighted CSP.	CP	2003	DBLP DOI BibTeX RDF
36	Tassos Dimitriou	A Wealth of SAT Distributions with Planted Assignments.	CP	2003	DBLP DOI BibTeX RDF
36	Wayne J. Pullan, Liang Zhao, John Thornton 0001	Estimating Problem Metrics for SAT Clause Weighting Local Search.	Australian Conference on Artificial Intelligence	2003	DBLP DOI BibTeX RDF	Search, Constraints
36	Uwe Schöning	A Probabilistic Algorithm for k -SAT Based on Limited Local Search and Restart.	Algorithmica	2002	DBLP DOI BibTeX RDF	NP-completeness, Satisfiability problem
36	Adi Avidor, Uri Zwick	Approximating MIN k-SAT.	ISAAC	2002	DBLP DOI BibTeX RDF
36	Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe 0001	A Probabilistic 3-SAT Algorithm Further Improved.	STACS	2002	DBLP DOI BibTeX RDF
36	Inês Lynce, João Marques-Silva 0001	Tuning Randomization in Backtrack Search SAT Algorithms.	CP	2002	DBLP DOI BibTeX RDF
36	Inês Lynce, João Marques-Silva 0001	The Effect of Nogood Recording in DPLL-CBJ SAT Algorithms.	International Workshop on Constraint Solving and Constraint Logic Programming	2002	DBLP DOI BibTeX RDF
36	Olena Kravchuk, Wayne J. Pullan, John Thornton 0001, Abdul Sattar 0001	An Investigation of Variable Relationships in 3-SAT Problems.	Australian Joint Conference on Artificial Intelligence	2002	DBLP DOI BibTeX RDF	Search, Constraints
36	Joel Friedman, Andreas Goerdt	Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently.	ICALP	2001	DBLP DOI BibTeX RDF
36	Viresh Paruthi, Andreas Kuehlmann	Equivalence Checking Combining a Structural SAT-Solver, BDDs, and Simulation.	ICCD	2000	DBLP DOI BibTeX RDF
36	Aarti Gupta, Zijiang Yang 0006, Pranav Ashar, Anubhav Gupta 0001	SAT-Based Image Computation with Application in Reachability Analysis.	FMCAD	2000	DBLP DOI BibTeX RDF
36	Roberto Sebastiani, Adolfo Villafiorita	SAT-Based Decision Procedures for Normal Modal Logics: A Theoretical Framework.	AIMSA	1998	DBLP DOI BibTeX RDF
36	Zenon Sadowski	On an Optimal Deterministic Algorithm for SAT.	CSL	1998	DBLP DOI BibTeX RDF
36	Matti Järvisalo, Daniel Le Berre (eds.)	Proceedings of the 14th International Workshop on Pragmatics of SAT co-located with the 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023), Alghero, Italy, July 4, 2023.	POS@SAT	2023	DBLP BibTeX RDF
36	Neng-Fa Zhou, Ruiwei Wang, Roland H. C. Yap	A Comparison of SAT Encodings for Acyclicity of Directed Graphs.	SAT	2023	DBLP DOI BibTeX RDF
36	Markus Kirchweger, Manfred Scheucher, Stefan Szeider	SAT-Based Generation of Planar Graphs.	SAT	2023	DBLP DOI BibTeX RDF
36	Alexander Nadel	Solving Huge Instances with Intel(R) SAT Solver.	SAT	2023	DBLP DOI BibTeX RDF
36	Jiong Yang 0002, Arijit Shaw, Teodora Baluta, Mate Soos, Kuldeep S. Meel	Explaining SAT Solving Using Causal Reasoning.	SAT	2023	DBLP DOI BibTeX RDF
36	Gabriele Masina, Giuseppe Spallitta, Roberto Sebastiani	On CNF Conversion for Disjoint SAT Enumeration.	SAT	2023	DBLP DOI BibTeX RDF
36	Anshujit Sharma, Matthew Burns, Michael C. Huang 0001	Combining Cubic Dynamical Solvers with Make/Break Heuristics to Solve SAT.	SAT	2023	DBLP DOI BibTeX RDF
36	Markus Kirchweger, Tomás Peitl, Stefan Szeider	A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture.	SAT	2023	DBLP DOI BibTeX RDF
36	Markus Anders, Pascal Schweitzer, Mate Soos	Algorithms Transcending the SAT-Symmetry Interface.	SAT	2023	DBLP DOI BibTeX RDF
36	Tobias Paxian, Armin Biere	Uncovering and Classifying Bugs in MaxSAT Solvers through Fuzzing and Delta Debugging.	POS@SAT	2023	DBLP BibTeX RDF
36	Benjamin Kaiser, Robert Clausecker, Michael Mavroskoufis	Prioritised Unit Propagation by Partitioning the Watch Lists.	POS@SAT	2023	DBLP BibTeX RDF
36	Alexander Nadel	Introducing Intel(R) SAT Solver.	SAT	2022	DBLP DOI BibTeX RDF
36	Jakob Bach, Markus Iser, Klemens Böhm	A Comprehensive Study of k-Portfolios of Recent SAT Solvers.	SAT	2022	DBLP DOI BibTeX RDF
36	Iván Garzón, Pablo Mesejo, Jesús Giráldez-Cru	On the Performance of Deep Generative Models of Realistic SAT Instances.	SAT	2022	DBLP DOI BibTeX RDF
36	Gilles Audemard, Jean-Marie Lagniez, Marie Miceli	A New Exact Solver for (Weighted) Max#SAT.	SAT	2022	DBLP DOI BibTeX RDF
36	Markus Anders	SAT Preprocessors and Symmetry.	SAT	2022	DBLP DOI BibTeX RDF
36	Miguel Cabral, Mikolás Janota, Vasco M. Manquinho	SAT-Based Leximax Optimisation Algorithms.	SAT	2022	DBLP DOI BibTeX RDF
36	Markus Kirchweger, Manfred Scheucher, Stefan Szeider	A SAT Attack on Rota's Basis Conjecture.	SAT	2022	DBLP DOI BibTeX RDF
36	Lucas Berent, Lukas Burgholzer, Robert Wille	Towards a SAT Encoding for Quantum Circuits: A Journey From Classical Circuits to Clifford Circuits and Beyond.	SAT	2022	DBLP DOI BibTeX RDF
36	Tobias Friedrich 0001, Frank Neumann 0001, Ralf Rothenberger, Andrew M. Sutton	Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily.	SAT	2021	DBLP DOI BibTeX RDF
36	Pei Huang 0002, Rundong Li, Minghao Liu 0001, Feifei Ma, Jian Zhang 0001	Efficient SAT-Based Minimal Model Generation Methods for Modal Logic S5.	SAT	2021	DBLP DOI BibTeX RDF
36	Nicolas Prevot, Mate Soos, Kuldeep S. Meel	Leveraging GPUs for Effective Clause Sharing in Parallel SAT Solving.	SAT	2021	DBLP DOI BibTeX RDF
36	Henrik E. C. Cao	Hash-Based Preprocessing and Inprocessing Techniques in SAT Solvers.	SAT	2021	DBLP DOI BibTeX RDF
36	Junqiang Peng 0001, Mingyu Xiao 0001	A Fast Algorithm for SAT in Terms of Formula Length.	SAT	2021	DBLP DOI BibTeX RDF
36	Matthieu Py, Mohamed Sami Cherif, Djamal Habet	A Proof Builder for Max-SAT.	SAT	2021	DBLP DOI BibTeX RDF
36	Dominik Schreiber, Peter Sanders 0001	Scalable SAT Solving in the Cloud.	SAT	2021	DBLP DOI BibTeX RDF
36	Carlos Ansótegui, Jesus Ojeda, António Pacheco 0004, Josep Pon, Josep M. Salvia, Eduard Torres	OptiLog: A Framework for SAT-based Systems.	SAT	2021	DBLP DOI BibTeX RDF
36	Alexey Ignatiev, João Marques-Silva 0001	SAT-Based Rigorous Explanations for Decision Lists.	SAT	2021	DBLP DOI BibTeX RDF
36	Shaowei Cai 0001, Xindi Zhang	Deep Cooperation of CDCL and Local Search for SAT.	SAT	2021	DBLP DOI BibTeX RDF
36	Hidetomo Nabeshima, Katsumi Inoue	Reproducible Efficient Parallel SAT Solving.	SAT	2020	DBLP DOI BibTeX RDF
36	Chunxiao Li 0002, Noah Fleming, Marc Vinyals, Toniann Pitassi, Vijay Ganesh	Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers.	SAT	2020	DBLP DOI BibTeX RDF
36	Vincent Vallade, Ludovic Le Frioux, Souheib Baarir, Julien Sopena, Vijay Ganesh, Fabrice Kordon	Community and LBD-Based Clause Sharing Policy for Parallel SAT Solving.	SAT	2020	DBLP DOI BibTeX RDF
36	Thomas Seed, Andy King, Neil Evans	Reducing Bit-Vector Polynomials to SAT Using Gröbner Bases.	SAT	2020	DBLP DOI BibTeX RDF
36	Mikolás Janota, António Morgado 0001	SAT-Based Encodings for Optimal Decision Trees with Explicit Paths.	SAT	2020	DBLP DOI BibTeX RDF
36	Rüdiger Ehlers, Kai Treutler, Volker Wesling	SAT Solving with Fragmented Hamiltonian Path Constraints for Wire Arc Additive Manufacturing.	SAT	2020	DBLP DOI BibTeX RDF
36	Stepan Kochemazov	Improving Implementation of SAT Competitions 2017-2019 Winners.	SAT	2020	DBLP DOI BibTeX RDF
36	Mikolás Janota, Inês Lynce (eds.)	Theory and Applications of Satisfiability Testing - SAT 2019 - 22nd International Conference, SAT 2019, Lisbon, Portugal, July 9-12, 2019, Proceedings	SAT	2019	DBLP DOI BibTeX RDF
36	Daniel Le Berre, Matti Järvisalo (eds.)	Proceedings of Pragmatics of SAT 2015, Austin, Texas, USA, September 23, 2015 / Pragmatics of SAT 2018, Oxford, UK, July 7, 2018.	POS@SAT	2019	DBLP BibTeX RDF
36	Joshua Blinkhorn, Olaf Beyersdorff	Proof Complexity of QBF Symmetry Recomputation.	SAT	2019	DBLP DOI BibTeX RDF