Search results for "SAT"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Fadi A. Aloul, Nagarajan Kandasamy	Sensor Deployment for Failure Diagnosis in Networked Aerial Robots: A Satisfiability-Based Approach.	SAT	2007	DBLP DOI BibTeX RDF	0-1 ILP, UAV networks, distributed systems, fault diagnosis, SAT
1	Amir Aavani	Translating Pseudo-Boolean Constraints into CNF.	SAT	2011	DBLP DOI BibTeX RDF
1	Justyna Petke, Peter Jeavons	The Order Encoding: From Tractable CSP to Tractable SAT.	SAT	2011	DBLP DOI BibTeX RDF
1	Tomoya Tanjo, Naoyuki Tamura, Mutsunori Banbara	A Compact and Efficient SAT-Encoding of Finite Domain CSP.	SAT	2011	DBLP DOI BibTeX RDF
1	Florian Lonsing, Armin Biere	Failed Literal Detection for QBF.	SAT	2011	DBLP DOI BibTeX RDF
1	Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais	On Freezing and Reactivating Learnt Clauses.	SAT	2011	DBLP DOI BibTeX RDF
1	João P. Marques Silva, Inês Lynce	On Improving MUS Extraction Algorithms.	SAT	2011	DBLP DOI BibTeX RDF
1	Hadi Katebi, Karem A. Sakallah, João P. Marques Silva	Empirical Study of the Anatomy of Modern Sat Solvers.	SAT	2011	DBLP DOI BibTeX RDF
1	Ignasi Abío, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell	BDDs for Pseudo-Boolean Constraints - Revisited.	SAT	2011	DBLP DOI BibTeX RDF
1	Huxley Bennett, Sriram Sankaranarayanan	Model Counting Using the Inclusion-Exclusion Principle.	SAT	2011	DBLP DOI BibTeX RDF
1	Vadim Ryvchin, Ofer Strichman	Faster Extraction of High-Level Minimal Unsatisfiable Cores.	SAT	2011	DBLP DOI BibTeX RDF
1	Alessandro Previti, Raghuram Ramanujan, Marco Schaerf, Bart Selman	Applying UCT to Boolean Satisfiability.	SAT	2011	DBLP DOI BibTeX RDF
1	Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann	Non-Model-Based Algorithm Portfolios for SAT.	SAT	2011	DBLP DOI BibTeX RDF
1	Jian Gao, Minghao Yin, Ke Xu	Phase Transitions in Knowledge Compilation: An Experimental Study.	SAT	2011	DBLP DOI BibTeX RDF
1	Ignasi Abío, Morgan Deters, Robert Nieuwenhuis, Peter J. Stuckey	Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One.	SAT	2011	DBLP DOI BibTeX RDF
1	Nadia Creignou, Frédéric Olive, Johannes Schmidt	Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight.	SAT	2011	DBLP DOI BibTeX RDF
1	Shin-ichi Minato	πDD: A New Decision Diagram for Efficient Problem Solving in Permutation Space.	SAT	2011	DBLP DOI BibTeX RDF
1	Allen Van Gelder	Generalized Conflict-Clause Strengthening for Satisfiability Solvers.	SAT	2011	DBLP DOI BibTeX RDF
1	Mikolás Janota, João P. Marques Silva	Abstraction-Based Algorithm for 2QBF.	SAT	2011	DBLP DOI BibTeX RDF
1	Oliver Kullmann, Xishun Zhao	On Variables with Few Occurrences in Conjunctive Normal Forms.	SAT	2011	DBLP DOI BibTeX RDF
1	Dave A. D. Tompkins, Adrian Balint, Holger H. Hoos	Captain Jack: New Variable Selection Heuristics in Local Search for SAT.	SAT	2011	DBLP DOI BibTeX RDF
1	Karem A. Sakallah, Laurent Simon (eds.)	Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings	SAT	2011	DBLP DOI BibTeX RDF
1	Allen Van Gelder	Careful Ranking of Multiple Solvers with Timeouts and Ties.	SAT	2011	DBLP DOI BibTeX RDF
1	Anton Belov, João P. Marques Silva	Minimally Unsatisfiable Boolean Circuits.	SAT	2011	DBLP DOI BibTeX RDF
1	Hans Kleine Büning, Xishun Zhao, Uwe Bubeck	Transformations into Normal Forms for Quantified Circuits.	SAT	2011	DBLP DOI BibTeX RDF
1	Antonio Ramos, Peter van der Tak, Marijn Heule	Between Restarts and Backjumps.	SAT	2011	DBLP DOI BibTeX RDF
1	Oliver Gableske, Marijn Heule	EagleUP: Solving Random 3-SAT Using SLS with Unit Propagation.	SAT	2011	DBLP DOI BibTeX RDF
1	Olaf Beyersdorff, Nicola Galesi, Massimo Lauria	Parameterized Complexity of DPLL Search Procedures.	SAT	2011	DBLP DOI BibTeX RDF
1	Alexander Nadel	Generating Diverse Solutions in SAT.	SAT	2011	DBLP DOI BibTeX RDF
1	Alexey Ignatiev, Alexander Semenov	DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions.	SAT	2011	DBLP DOI BibTeX RDF
1	Marijn Heule, Matti Järvisalo, Armin Biere	Efficient CNF Simplification Based on Binary Implication Graphs.	SAT	2011	DBLP DOI BibTeX RDF
1	Bryan Silverthorn, Risto Miikkulainen	Learning Polarity from Structure in SAT.	SAT	2011	DBLP DOI BibTeX RDF
1	Evgeny Dantsin, Edward A. Hirsch	Satisfiability Certificates Verifiable in Subexponential Time.	SAT	2011	DBLP DOI BibTeX RDF
1	Martin Mundhenk, Robert Zeranski	How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms.	SAT	2011	DBLP DOI BibTeX RDF
1	Ewald Speckenmeyer, Andreas Wotzlaw, Stefan Porschen	A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs.	SAT	2011	DBLP DOI BibTeX RDF
1	Ryan Williams	Connecting SAT Algorithms and Complexity Lower Bounds.	SAT	2011	DBLP DOI BibTeX RDF
1	Koushik Sen	Concolic Testing and Constraint Satisfaction.	SAT	2011	DBLP DOI BibTeX RDF
1	Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider	Satisfiability of Acyclic and almost Acyclic CNF Formulas (II).	SAT	2011	DBLP DOI BibTeX RDF
1	Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes	Analyzing the Instances of the MaxSAT Evaluation.	SAT	2011	DBLP DOI BibTeX RDF
1	Marcel Gort, Jason Helge Anderson	Reducing FPGA Router Run-Time through Algorithm and Architecture.	FPL	2011	DBLP DOI BibTeX RDF	fast CAD, scalable CAD, fast routing, FPGA, routing, CAD, SAT, Boolean Satisfiability, run-time, runtime, PathFinder
1	Rüdiger Ehlers	Minimising Deterministic Büchi Automata Precisely Using SAT Solving.	SAT	2010	DBLP DOI BibTeX RDF
1	Allen Van Gelder, Ivor Spence	Zero-One Designs Produce Small Hard SAT Instances.	SAT	2010	DBLP DOI BibTeX RDF
1	Anton Belov, Zbigniew Stachniak	Improved Local Search for Circuit Satisfiability.	SAT	2010	DBLP DOI BibTeX RDF
1	Hadi Katebi, Karem A. Sakallah, Igor L. Markov	Symmetry and Satisfiability: An Update.	SAT	2010	DBLP DOI BibTeX RDF
1	Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer	Proof Complexity of Propositional Default Logic.	SAT	2010	DBLP DOI BibTeX RDF
1	Vishwambhar Rathi, Erik Aurell, Lars K. Rasmussen, Mikael Skoglund	Bounds on Threshold of Regular Random k-SAT.	SAT	2010	DBLP DOI BibTeX RDF
1	Alexander Nadel, Vadim Ryvchin	Assignment Stack Shrinking.	SAT	2010	DBLP DOI BibTeX RDF
1	Adrian Balint, Andreas Fröhlich	Improving Stochastic Local Search for SAT with a New Probability Distribution.	SAT	2010	DBLP DOI BibTeX RDF
1	Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto	An Exact Algorithm for the Boolean Connectivity Problem for k-CNF.	SAT	2010	DBLP DOI BibTeX RDF
1	Ofer Strichman, Stefan Szeider (eds.)	Theory and Applications of Satisfiability Testing - SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings	SAT	2010	DBLP DOI BibTeX RDF
1	Ramamohan Paturi	Exact Algorithms and Complexity.	SAT	2010	DBLP DOI BibTeX RDF
1	Matti Järvisalo, Armin Biere	Reconstructing Solutions after Blocked Clause Elimination.	SAT	2010	DBLP DOI BibTeX RDF
1	Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer	Complexity Results for Linear XSAT-Problems.	SAT	2010	DBLP DOI BibTeX RDF
1	Florian Lonsing, Armin Biere	Integrating Dependency Schemes in Search-Based QBF Solvers.	SAT	2010	DBLP DOI BibTeX RDF
1	Alexandra Goultiaeva, Fahiem Bacchus	Exploiting Circuit Representations in QBF Solving.	SAT	2010	DBLP DOI BibTeX RDF
1	Enrico Giunchiglia, Paolo Marin, Massimo Narizzano	sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning.	SAT	2010	DBLP DOI BibTeX RDF
1	Christian Miller, Stefan Kupferschmid, Matthew D. T. Lewis, Bernd Becker	Encoding Techniques, Craig Interpolants and Bounded Model Checking for Incomplete Designs.	SAT	2010	DBLP DOI BibTeX RDF
1	Mladen Nikolic	Statistical Methodology for Comparison of SAT Solvers.	SAT	2010	DBLP DOI BibTeX RDF
1	William Klieber, Samir Sapra, Sicun Gao, Edmund M. Clarke	A Non-prenex, Non-clausal QBF Solver with Game-State Learning.	SAT	2010	DBLP DOI BibTeX RDF
1	Yehuda Naveh	The Big Deal: Applying Constraint Satisfaction Technologies Where It Makes the Difference.	SAT	2010	DBLP DOI BibTeX RDF
1	Dave A. D. Tompkins, Holger H. Hoos	Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT.	SAT	2010	DBLP DOI BibTeX RDF
1	Scott Cotton	Two Techniques for Minimizing Resolution Proofs.	SAT	2010	DBLP DOI BibTeX RDF
1	Claudia Peschiera, Luca Pulina, Armando Tacchella, Uwe Bubeck, Oliver Kullmann, Inês Lynce	The Seventh QBF Solvers Evaluation (QBFEVAL'10).	SAT	2010	DBLP DOI BibTeX RDF
1	Eli Ben-Sasson, Jan Johannsen	Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas.	SAT	2010	DBLP DOI BibTeX RDF
1	Evgeny Dantsin, Alexander Wolpert	On Moderately Exponential Time for SAT.	SAT	2010	DBLP DOI BibTeX RDF
1	Uwe Bubeck, Hans Kleine Büning	Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN.	SAT	2010	DBLP DOI BibTeX RDF
1	Denis Pankratov, Allan Borodin	On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem.	SAT	2010	DBLP DOI BibTeX RDF
1	Miquel Bofill, Josep Suy, Mateu Villaret	A System for Solving Constraint Satisfaction Problems with SMT.	SAT	2010	DBLP DOI BibTeX RDF
1	Stephan Kottler	SAT Solving with Reference Points.	SAT	2010	DBLP DOI BibTeX RDF
1	Lukas Kroc, Ashish Sabharwal, Bart Selman	An Empirical Study of Optimal Noise and Runtime Distributions in Local Search.	SAT	2010	DBLP DOI BibTeX RDF
1	Chu Min Li, Felip Manyà, Zhe Quan, Zhu Zhu	Exact MinSAT Solving.	SAT	2010	DBLP DOI BibTeX RDF
1	William Matthews, Ramamohan Paturi	Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable.	SAT	2010	DBLP DOI BibTeX RDF
1	Gayathri Namasivayam, Miroslaw Truszczynski	Simple but Hard Mixed Horn Formulas.	SAT	2010	DBLP DOI BibTeX RDF
1	Carsten Fuhs, Peter Schneider-Kamp	Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT.	SAT	2010	DBLP DOI BibTeX RDF
1	Vasco M. Manquinho, Ruben Martins, Inês Lynce	Improving Unsatisfiability-Based Algorithms for Boolean Optimization.	SAT	2010	DBLP DOI BibTeX RDF
1	Oliver Kullmann	Green-Tao Numbers and SAT.	SAT	2010	DBLP DOI BibTeX RDF
1	Robert Brummayer, Florian Lonsing, Armin Biere	Automated Testing and Debugging of SAT and QBF Solvers.	SAT	2010	DBLP DOI BibTeX RDF
1	Yacine Boufkhad, Thomas Hugel	Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold.	SAT	2010	DBLP DOI BibTeX RDF
1	Emina Torlak, Mandana Vaziri, Julian Dolby	MemSAT: checking axiomatic specifications of memory models.	PLDI	2010	DBLP DOI BibTeX RDF	sat, bounded model checking, memory models, axiomatic specifications
1	Anthony Monnet, Roger Villemaire	Scalable formula decomposition for propositional satisfiability.	C3S2E	2010	DBLP DOI BibTeX RDF	scalability, SAT, tree decomposition, propositional satisfiability, DPLL
1	Olivier Coudert	An efficient algorithm to verify generalized false paths.	DAC	2010	DBLP DOI BibTeX RDF	co-sensitization, generalized false path, timing exception, formal verification, correctness, SAT, sensitization, false path, SDC
1	Chun Zhang, Yu Hu, Lingli Wang, Lei He, Jiarong Tong	Building a faster boolean matcher using bloom filter.	FPGA	2010	DBLP DOI BibTeX RDF	FPGA, SAT, bloom filter, boolean matching, re-synthesis
1	Susmit Jha, Sumit Gulwani, Sanjit A. Seshia, Ashish Tiwari	Oracle-guided component-based program synthesis.	ICSE	2010	DBLP DOI BibTeX RDF	oracle-based learning, SAT, program synthesis, SMT
1	Michele Lombardi, Luca Benini, Abhishek Garg, Giovanni De Micheli	Methods for Designing Reliable Probe Arrays.	BIBE	2010	DBLP DOI BibTeX RDF	Probe based sensors, Optimization, Microarrays, SAT, ILP
1	Yangdong Steve Deng	GPU Accelerated VLSI Design Verification.	CIT	2010	DBLP DOI BibTeX RDF	Simulation, Verification, VLSI, GPU, Timing analysis, SAT
1	Elena Dubrova, Maxim Teslenko, Liu Ming	Finding Attractors in Synchronous Multiple-Valued Networks Using SAT-Based Bounded Model Checking.	ISMVL	2010	DBLP DOI BibTeX RDF	multiple-valued network, SAT, bounded model checking, gene regulatory network, attractor
1	Sandeep Kumar Singla, Pradeep Kumar Jaswal	Hybrid Satisfiability Techniques.	ITNG	2010	DBLP DOI BibTeX RDF	HybridSAT, Satisfiability, SAT, Boolean Satisfiability, DPLL
1	Hratch Mangassarian, Andreas G. Veneris, Marco Benedetti	Robust QBF Encodings for Sequential Circuits with Applications to Verification, Debug, and Test.	IEEE Trans. Computers	2010	DBLP DOI BibTeX RDF	k-induction, sequential ATPG, SAT, QBF, design debugging, BMC
1	Eric I. Hsu, Sheila A. McIlraith	VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search.	SAT	2009	DBLP DOI BibTeX RDF	Survey Propagation/EMBP, Variable/Value Ordering Heuristics, Probabilistic Inference
1	HyoJung Han, Fabio Somenzi	On-the-Fly Clause Improvement.	SAT	2009	DBLP DOI BibTeX RDF
1	Adrian Balint, Michael Henn, Oliver Gableske	A Novel Approach to Combine a SLS- and a DPLL-Solver for the Satisfiability Problem.	SAT	2009	DBLP DOI BibTeX RDF
1	Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà	Sequential Encodings from Max-CSP into Partial Max-SAT.	SAT	2009	DBLP DOI BibTeX RDF
1	Olivier Bailleux, Yacine Boufkhad, Olivier Roussel	New Encodings of Pseudo-Boolean Constraints into CNF.	SAT	2009	DBLP DOI BibTeX RDF	Pseudo-Boolean, SAT translation
1	Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer	The Complexity of Reasoning for Fragments of Default Logic.	SAT	2009	DBLP DOI BibTeX RDF
1	Roberto Asín, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell	Cardinality Networks and Their Applications.	SAT	2009	DBLP DOI BibTeX RDF
1	Anton Belov, Zbigniew Stachniak	Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability.	SAT	2009	DBLP DOI BibTeX RDF
1	Bas Schaafsma, Marijn Heule, Hans van Maaren	Dynamic Symmetry Breaking by Simulating Zykov Contraction.	SAT	2009	DBLP DOI BibTeX RDF
1	Lukas Kroc, Ashish Sabharwal, Bart Selman	Relaxed DPLL Search for MaxSAT.	SAT	2009	DBLP DOI BibTeX RDF
1	Alexandra Goultiaeva, Vicki Iverson, Fahiem Bacchus	Beyond CNF: A Circuit-Based QBF Solver.	SAT	2009	DBLP DOI BibTeX RDF
1	Albert Atserias, Johannes Klaus Fichte, Marc Thurley	Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution.	SAT	2009	DBLP DOI BibTeX RDF