Search results for "SAT"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
37	Hans Kleine Büning, Xishun Zhao, Uwe Bubeck	Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits.	SAT	2009	DBLP DOI BibTeX RDF
37	Matthew Lewis 0004, Paolo Marin, Tobias Schubert 0001, Massimo Narizzano, Bernd Becker 0001, Enrico Giunchiglia	PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing.	SAT	2009	DBLP DOI BibTeX RDF	Parallel QBF Solving, Master/Slave Architecture, MPI, Message Passing
37	Patrick Traxler	Variable Influences in Conjunctive Normal Forms.	SAT	2009	DBLP DOI BibTeX RDF
37	Roberto Asín, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell	Cardinality Networks and Their Applications.	SAT	2009	DBLP DOI BibTeX RDF
37	Florian Lonsing, Armin Biere	A Compact Representation for Syntactic Dependencies in QBFs.	SAT	2009	DBLP DOI BibTeX RDF
37	Timo Berthold, Stefan Heinz 0001, Marc E. Pfetsch	Nonlinear Pseudo-Boolean Optimization: Relaxation or Propagation?.	SAT	2009	DBLP DOI BibTeX RDF
37	Hyondeuk Kim, Fabio Somenzi, HoonSang Jin	Efficient Term-ITE Conversion for Satisfiability Modulo Theories.	SAT	2009	DBLP DOI BibTeX RDF
37	Jan Johannsen	An Exponential Lower Bound for Width-Restricted Clause Learning.	SAT	2009	DBLP DOI BibTeX RDF
37	Bas Schaafsma, Marijn Heule, Hans van Maaren	Dynamic Symmetry Breaking by Simulating Zykov Contraction.	SAT	2009	DBLP DOI BibTeX RDF
37	Olaf Beyersdorff, Arne Meier, Michael Thomas 0001, Heribert Vollmer	The Complexity of Reasoning for Fragments of Default Logic.	SAT	2009	DBLP DOI BibTeX RDF
37	Javier Larrosa, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell	Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates.	SAT	2009	DBLP DOI BibTeX RDF
37	Hans Kleine Büning, Xishun Zhao (eds.)	Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings	SAT	2008	DBLP DOI BibTeX RDF
37	Yong Gao 0001	Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms.	SAT	2008	DBLP DOI BibTeX RDF
37	Mark H. Liffiton, Karem A. Sakallah	Searching for Autarkies to Trim Unsatisfiable Clause Sets.	SAT	2008	DBLP DOI BibTeX RDF
37	João Marques-Silva 0001, Vasco M. Manquinho	Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms.	SAT	2008	DBLP DOI BibTeX RDF
37	Florian Lonsing, Armin Biere	Nenofex: Expanding NNF for QBF Solving.	SAT	2008	DBLP DOI BibTeX RDF
37	Gilles Audemard, Lucas Bordeaux, Youssef Hamadi, Saïd Jabbour, Lakhdar Sais	A Generalized Framework for Conflict Analysis.	SAT	2008	DBLP DOI BibTeX RDF
37	Zbigniew Stachniak, Anton Belov	Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning.	SAT	2008	DBLP DOI BibTeX RDF
37	Hans van Maaren, Siert Wieringa	Finding Guaranteed MUSes Fast.	SAT	2008	DBLP DOI BibTeX RDF
37	Dominik Scheder, Philipp Zumstein	How Many Conflicts Does It Need to Be Unsatisfiable?	SAT	2008	DBLP DOI BibTeX RDF	unsatisfiable formulas, Lovász Local Lemma, satisfiability, conflict graph
37	Alasdair Urquhart	Regular and General Resolution: An Improved Separation.	SAT	2008	DBLP DOI BibTeX RDF
37	Martin Davis	SAT: Past and Future.	SAT	2007	DBLP DOI BibTeX RDF
37	Chu Min Li, Wanxia Wei, Harry Zhang	Combining Adaptive Noise and Look-Ahead in Local Search for SAT.	SAT	2007	DBLP DOI BibTeX RDF
37	Naomi Nishimura, Prabhakar Ragde, Stefan Szeider	Solving #SAT Using Vertex Covers.	SAT	2006	DBLP DOI BibTeX RDF
37	Roberto Sebastiani, Michele Vescovi	Encoding the Satisfiability of Modal and Description Logics into SAT: The Case Study of K(m)/ALC.	SAT	2006	DBLP DOI BibTeX RDF
37	Magnus Wahlström	Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable.	SAT	2005	DBLP DOI BibTeX RDF
37	Nicola Galesi, Oliver Kullmann	Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank.	SAT	2004	DBLP BibTeX RDF
37	Danila A. Sinopalnikov	Satisfiability Threshold of the Skewed Random k-SAT.	SAT	2004	DBLP BibTeX RDF
37	Vasco M. Manquinho, João Marques-Silva 0001	Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization.	SAT	2004	DBLP BibTeX RDF
37	Matthew D. T. Lewis, Tobias Schubert 0001, Bernd Becker 0001	Early Conflict Detection Based BCP for SAT Solving.	SAT	2004	DBLP BibTeX RDF
37	Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Marco Maratea	A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints.	SAT	2004	DBLP BibTeX RDF
37	Carsten Sinz	Visualizing the Internal Structure of SAT Instances (Preliminary Report)	SAT	2004	DBLP BibTeX RDF
37	Steven D. Prestwich, Colin Quirke	Local Search for Very Large SAT Problems.	SAT	2004	DBLP BibTeX RDF
37	Renato Bruni, Andrea Santori	Adding a New Conflict Based Branching Heuristic in two Evolved DPLL SAT Solvers.	SAT	2004	DBLP BibTeX RDF
37	Ling Zhao, Martin Müller 0003	Game-SAT: A Preliminary Report.	SAT	2004	DBLP BibTeX RDF
37	Miroslav N. Velev	Encoding Global Unobservability for Efficient Translation to SAT.	SAT	2004	DBLP BibTeX RDF
37	Evgeny Dantsin, Alexander Wolpert	Derandomization of Schuler's Algorithm for SAT.	SAT	2004	DBLP BibTeX RDF
37	Shlomo Hoory, Stefan Szeider	Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable.	SAT	2004	DBLP BibTeX RDF
37	Carsten Sinz, Wolfgang Küchlin	Verifying the On-Line Help System of SIEMENS Magnetic Resonance Tomographs using SAT (Extended Abstract)	SAT	2004	DBLP BibTeX RDF
37	Alex S. Fukunaga	Efficient Implementations of SAT Local Search.	SAT	2004	DBLP BibTeX RDF
37	Sathiamoorthy Subbarayan, Dhiraj K. Pradhan	NiVER: Non Increasing Variable Elimination Resolution for Preprocessing SAT instances.	SAT	2004	DBLP BibTeX RDF
37	Marco Benedetti, Sara Bernardini	Incremental Compilation-to-SAT Procedures.	SAT	2004	DBLP BibTeX RDF
37	Hantao Zhang 0001, Dapeng Li, Haiou Shen	A SAT Based Scheduler for Tournament Schedules.	SAT	2004	DBLP BibTeX RDF
37	Stefan Porschen, Ewald Speckenmeyer	Worst Case Bounds for some NP-Complete Modified Horn-SAT Problems.	SAT	2004	DBLP BibTeX RDF
37	Daniel Sheridan	The Optimality of a Fast CNF Conversion and its Use with SAT.	SAT	2004	DBLP BibTeX RDF
37	Alfredo Braunstein, Riccardo Zecchina	Survey and Belief Propagation on Random K-SAT.	SAT	2003	DBLP DOI BibTeX RDF
37	Christian Bessière, Emmanuel Hebrard, Toby Walsh	Local Consistencies in SAT.	SAT	2003	DBLP DOI BibTeX RDF
36	Cristina Borralleras, Salvador Lucas, Rafael Navarro-Marset, Enric Rodríguez-Carbonell, Albert Rubio	Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic.	CADE	2009	DBLP DOI BibTeX RDF	polynomial constraints, SAT modulo theories, program analysis, termination, Constraint solving
36	Murthy Palla, Jens Bargfrede, Klaus Koch, Walter Anheier, Rolf Drechsler	Adaptive Branch and Bound Using SAT to Estimate False Crosstalk.	ISQED	2008	DBLP DOI BibTeX RDF	Crosstalk Analysis, False Noise, STA, SAT Solver
36	Nicolas G. Fournier	Modelling the dynamics of stochastic local search on k-sat.	J. Heuristics	2007	DBLP DOI BibTeX RDF	k-sat, Local search, Experimental evaluation, Algorithm analysis, Stochastic algorithms
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	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