Search results for "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	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
27	É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
27	Conghua Zhou	A compositional symbolic verification framework for concurrent software.	Infoscale	2007	DBLP DOI BibTeX RDF	model checking, composition, abstract, SAT
27	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
27	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
27	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	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
26	Jacobo Torán, Florian Wörz	Cutting Planes Width and the Complexity of Graph Isomorphism Refutations.	SAT	2023	DBLP DOI BibTeX RDF
26		Front Matter, Table of Contents, Preface, Conference Organization.	SAT	2023	DBLP DOI BibTeX RDF
26	Andrew Haberlandt, Harrison Green, Marijn J. H. Heule	Effective Auxiliary Variables via Structured Reencoding.	SAT	2023	DBLP DOI BibTeX RDF
26	George Katsirelos	An Analysis of Core-Guided Maximum Satisfiability Solvers Using Linear Programming.	SAT	2023	DBLP DOI BibTeX RDF
26	Dror Fried, Alexander Nadel, Yogev Shalmon	AllSAT for Combinational Circuits.	SAT	2023	DBLP DOI BibTeX RDF
26	Albert Oliveras, Chunxiao Li 0002, Darryl Wu, Jonathan Chung 0003, Vijay Ganesh	Learning Shorter Redundant Clauses in SDCL Using MaxSAT.	SAT	2023	DBLP DOI BibTeX RDF
26	Benjamin Böhm 0001, Olaf Beyersdorff	QCDCL vs QBF Resolution: Further Insights.	SAT	2023	DBLP DOI BibTeX RDF
26	Pedro Orvalho, Vasco M. Manquinho, Ruben Martins	UpMax: User Partitioning for MaxSAT.	SAT	2023	DBLP DOI BibTeX RDF
26	Irfansha Shaik, Maximilian Heisinger, Martina Seidl, Jaco van de Pol	Validation of QBF Encodings with Winning Strategies.	SAT	2023	DBLP DOI BibTeX RDF
26	Florian Pollitt, Mathias Fleury, Armin Biere	Faster LRAT Checking Than Solving with CaDiCaL.	SAT	2023	DBLP DOI BibTeX RDF
26	Randal E. Bryant, Wojciech Nawrocki, Jeremy Avigad, Marijn J. H. Heule	Certified Knowledge Compilation with Application to Verified Model Counting.	SAT	2023	DBLP DOI BibTeX RDF
26	Long-Hin Fung, Tony Tan	On the Complexity of k-DQBF.	SAT	2023	DBLP DOI BibTeX RDF
26	Ilario Bonacina, Maria Luisa Bonet, Jordi Levy	Polynomial Calculus for MaxSAT.	SAT	2023	DBLP DOI BibTeX RDF
26	Tereza Schwarzová, Jan Strejcek, Juraj Major	Reducing Acceptance Marks in Emerson-Lei Automata by QBF Solving.	SAT	2023	DBLP DOI BibTeX RDF
26	Katalin Fazekas, Aina Niemetz, Mathias Preiner, Markus Kirchweger, Stefan Szeider, Armin Biere	IPASIR-UP: User Propagators for CDCL.	SAT	2023	DBLP DOI BibTeX RDF
26	Junping Zhou, Jiaxin Liang, Minghao Yin, Bo He	LS-DTKMS: A Local Search Algorithm for Diversified Top-k MaxSAT Problem.	SAT	2023	DBLP DOI BibTeX RDF
26	Armin Biere, Nils Froleyks, Wenxi Wang	CadiBack: Extracting Backbones with CaDiCaL.	SAT	2023	DBLP DOI BibTeX RDF
26	Marc Vinyals, Chunxiao Li 0002, Noah Fleming, Antonina Kolokolova, Vijay Ganesh	Limits of CDCL Learning via Merge Resolution.	SAT	2023	DBLP DOI BibTeX RDF
26	Adrián Rebola-Pardo	Even Shorter Proofs Without New Variables.	SAT	2023	DBLP DOI BibTeX RDF
26	Andreas Plank, Martina Seidl	QMusExt: A Minimal (Un)satisfiable Core Extractor for Quantified Boolean Formulas.	SAT	2023	DBLP DOI BibTeX RDF
26	Stefan Mengel	Bounds on BDD-Based Bucket Elimination.	SAT	2023	DBLP DOI BibTeX RDF
26	Olaf Beyersdorff, Tim Hoffmann, Luc Nicolas Spachmann	Proof Complexity of Propositional Model Counting.	SAT	2023	DBLP DOI BibTeX RDF
26	Alexis de Colnet	Separating Incremental and Non-Incremental Bottom-Up Compilation.	SAT	2023	DBLP DOI BibTeX RDF
26	Kuldeep S. Meel, Ofer Strichman (eds.)	25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel.	SAT	2022	DBLP BibTeX RDF
26	Dmitry Itsykson, Artur Riazanov, Petr Smirnov	Tight Bounds for Tseitin Formulas.	SAT	2022	DBLP DOI BibTeX RDF
26	Jean Christoph Jung, Valentin Mayer-Eichberger, Abdallah Saffidine	QBF Programming with the Modeling Language Bule.	SAT	2022	DBLP DOI BibTeX RDF
26	Friedrich Slivovsky	Quantified CDCL with Universal Resolution.	SAT	2022	DBLP DOI BibTeX RDF
26	Meena Mahajan, Gaurav Sood 0001	QBF Merge Resolution Is Powerful but Unnatural.	SAT	2022	DBLP DOI BibTeX RDF
26	Bernardo Subercaseaux, Marijn J. H. Heule	The Packing Chromatic Number of the Infinite Square Grid Is at Least 14.	SAT	2022	DBLP DOI BibTeX RDF
26	Benjamin Böhm 0001, Tomás Peitl, Olaf Beyersdorff	Should Decisions in QCDCL Follow Prefix Order?	SAT	2022	DBLP DOI BibTeX RDF
26	Stefan Mengel	Changing Partitions in Rectangle Decision Lists.	SAT	2022	DBLP DOI BibTeX RDF
26	Agnes Schleitzer, Olaf Beyersdorff	Classes of Hard Formulas for QBF Resolution.	SAT	2022	DBLP DOI BibTeX RDF
26	Pavel Smirnov 0003, Jeremias Berg, Matti Järvisalo	Improvements to the Implicit Hitting Set Approach to Pseudo-Boolean Optimization.	SAT	2022	DBLP DOI BibTeX RDF
26	Nina Narodytska, Nikolaj S. Bjørner	Analysis of Core-Guided MaxSat Using Cores and Correction Sets.	SAT	2022	DBLP DOI BibTeX RDF
26	Franz-Xaver Reichl, Friedrich Slivovsky	Pedant: A Certifying DQBF Solver.	SAT	2022	DBLP DOI BibTeX RDF
26	Leroy Chew, Marijn J. H. Heule	Relating Existing Powerful Proof Systems for QBF.	SAT	2022	DBLP DOI BibTeX RDF
26	Johannes Klaus Fichte, Markus Hecher, Valentin Roland	Proofs for Propositional Model Counting.	SAT	2022	DBLP DOI BibTeX RDF
26	Christoph Jabs, Jeremias Berg, Andreas Niskanen, Matti Järvisalo	MaxSAT-Based Bi-Objective Boolean Optimization.	SAT	2022	DBLP DOI BibTeX RDF
26	Hao-Ren Wang, Kuan-Hua Tu, Jie-Hong Roland Jiang, Christoph Scholl 0001	Quantifier Elimination in Stochastic Boolean Satisfiability.	SAT	2022	DBLP DOI BibTeX RDF
26	Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider	Weighted Model Counting with Twin-Width.	SAT	2022	DBLP DOI BibTeX RDF
26	Josep Alos, Carlos Ansótegui, Josep M. Salvia, Eduard Torres	OptiLog V2: Model, Solve, Tune and Run.	SAT	2022	DBLP DOI BibTeX RDF
26	Stephan Gocht, Ruben Martins, Jakob Nordström, Andy Oertel	Certified CNF Translations for Pseudo-Boolean Solving.	SAT	2022	DBLP DOI BibTeX RDF
26	Milan Mossé, Harry Sha, Li-Yang Tan	A Generalization of the Satisfiability Coding Lemma and Its Applications.	SAT	2022	DBLP DOI BibTeX RDF
26	Andreas Niskanen, Jeremias Berg, Matti Järvisalo	Incremental Maximum Satisfiability.	SAT	2022	DBLP DOI BibTeX RDF
26		Front Matter, Table of Contents, Preface, Conference Organization.	SAT	2022	DBLP DOI BibTeX RDF
26	Max Bannach, Malte Skambath, Till Tantau	On the Parallel Parameterized Complexity of MaxSAT Variants.	SAT	2022	DBLP DOI BibTeX RDF
26	Mikolás Janota, Jelle Piepenbrock, Bartosz Piotrowski	Towards Learning Quantifier Instantiation in SMT.	SAT	2022	DBLP DOI BibTeX RDF
26	Armin Biere, Md. Solimul Chowdhury, Marijn J. H. Heule, Benjamin Kiesl, Michael W. Whalen	Migrating Solver State.	SAT	2022	DBLP DOI BibTeX RDF
26	Chu-Min Li, Felip Manyà (eds.)	Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings	SAT	2021	DBLP DOI BibTeX RDF
26	Miki Hermann, Gernot Salzer	MCP: Capturing Big Data by Satisfiability (Tool Description).	SAT	2021	DBLP DOI BibTeX RDF
26	Makai Mann, Amalee Wilson, Yoni Zohar, Lindsey Stuntz, Ahmed Irfan, Kristopher Brown, Caleb Donovick, Allison Guman, Cesare Tinelli, Clark W. Barrett	Smt-Switch: A Solver-Agnostic C++ API for SMT Solving.	SAT	2021	DBLP DOI BibTeX RDF
26	Martin Mariusz Lester	Scheduling Reach Mahjong Tournaments Using Pseudoboolean Constraints.	SAT	2021	DBLP DOI BibTeX RDF
26	Benjamin Böhm 0001, Olaf Beyersdorff	Lower Bounds for QCDCL via Formula Gauge.	SAT	2021	DBLP DOI BibTeX RDF
26	Zhendong Lei, Shaowei Cai 0001, Chuan Luo 0002, Holger H. Hoos	Efficient Local Search for Pseudo Boolean Optimization.	SAT	2021	DBLP DOI BibTeX RDF
26	Marijn J. H. Heule	Chinese Remainder Encoding for Hamiltonian Cycles.	SAT	2021	DBLP DOI BibTeX RDF
26	Daniel Le Berre, Romain Wallon	On Dedicated CDCL Strategies for PB Solvers.	SAT	2021	DBLP DOI BibTeX RDF
26	Stefan Mengel, Friedrich Slivovsky	Proof Complexity of Symbolic QBF Reasoning.	SAT	2021	DBLP DOI BibTeX RDF
26	Mathias Fleury, Armin Biere	Efficient All-UIP Learned Clause Minimization.	SAT	2021	DBLP DOI BibTeX RDF
26	Carlos Ansótegui, Josep Pon, Meinolf Sellmann, Kevin Tierney	PyDGGA: Distributed GGA for Automatic Configuration.	SAT	2021	DBLP DOI BibTeX RDF
26	Paulius Dilkas, Vaishak Belle	Weighted Model Counting Without Parameter Variables.	SAT	2021	DBLP DOI BibTeX RDF
26	Oliver Kullmann, Oleg Zaikin 0002	Projection Heuristics for Binary Branchings Between Sum and Product.	SAT	2021	DBLP DOI BibTeX RDF
26	Jeffrey M. Dudek, Vu H. N. Phan, Moshe Y. Vardi	ProCount: Weighted Projected Model Counting with Graded Project-Join Trees.	SAT	2021	DBLP DOI BibTeX RDF
26	Alexis de Colnet, Stefan Mengel	Characterizing Tseitin-Formulas with Short Regular Resolution Refutations.	SAT	2021	DBLP DOI BibTeX RDF