Search results for "Satisfiability"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
36	Vincenzo Cutello, Giuseppe Nicosia	A Clonal Selection Algorithm for Coloring, Hitting Set and Satisfiability Problems.	WIRN/NAIS	2005	DBLP DOI BibTeX RDF	Minimum Hitting Set problem, Evolutionary Computation, Combinatorial Optimization, Satisfiability, Immune Algorithms, Clonal Selection Algorithms, Information Gain, Graph coloring problem
36	Gilles Audemard, Lakhdar Sais	A Symbolic Search Based Approach for Quantified Boolean Formulas.	SAT	2005	DBLP DOI BibTeX RDF	Satisfiability, Binary decision diagram, Quantified boolean formula
36	Stefan Porschen, Ewald Speckenmeyer	Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF	(hidden) Horn formula, quadratic formula, minimal vertex cover, NP-completeness, satisfiability, fixed-parameter tractability
36	Robert F. Damiano, James H. Kukula	Checking satisfiability of a conjunction of BDDs.	DAC	2003	DBLP DOI BibTeX RDF	satisfiability, BDD
36	Anna Formica	Finite Satisfiability of Integrity Constraints in Object-Oriented Database Schemas.	IEEE Trans. Knowl. Data Eng.	2002	DBLP DOI BibTeX RDF	constraint satisfiability (consistency), recursive schemas, axioms of infinity, equality constraints, object-oriented databases
36	Luís Guerra e Silva, João Marques-Silva 0001, Luís Miguel Silveira, Karem A. Sakallah	Satisfiability models and algorithms for circuit delay computation.	ACM Trans. Design Autom. Electr. Syst.	2002	DBLP DOI BibTeX RDF	circuit delay computation, timing analysis, Boolean satisfiability, delay modeling, false path
36	Aarti Gupta, Pranav Ashar	Integrating a Boolean Satisfiability Checker and BDDs for Combinational Equivalence Checking.	VLSI Design	1998	DBLP DOI BibTeX RDF	ATPG techniques, circuit similarity, formal verification, combinational circuits, Boolean satisfiability (SAT), combinational equivalence checking, Binary Decision Diagrams (BDDs)
36	Alicia D'Anjou, Manuel Graña, Francisco Javier Torrealdea, M. C. Hernández 0001	Solving Satisfiability Via Boltzmann Machines.	IEEE Trans. Pattern Anal. Mach. Intell.	1993	DBLP DOI BibTeX RDF	consensus function maxima, simulated annealing, simulated annealing, satisfiability, computational model, set theory, calculus, Boltzmann machines, Boltzmann machines, propositional calculus
36	Sandeep Kumar Singla, Pradeep Kumar Jaswal	Hybrid Satisfiability Techniques.	ITNG	2010	DBLP DOI BibTeX RDF	HybridSAT, Satisfiability, SAT, Boolean Satisfiability, DPLL
35	Hossein M. Sheini, Karem A. Sakallah	A Progressive Simplifier for Satisfiability Modulo Theories.	SAT	2006	DBLP DOI BibTeX RDF
35	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
35	Sakari Seitz, Mikko Alava, Pekka Orponen	Threshold Behaviour of WalkSAT and Focused Metropolis Search on Random 3-Satisfiability.	SAT	2005	DBLP DOI BibTeX RDF
35	Daijue Tang, Yinlei Yu, Darsh Ranjan, Sharad Malik	Analysis of Search Based Algorithms for Satisfiability of Propositional and Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
35	Giorgio Parisi	On the Probabilistic Approach to the Random Satisfiability Problem.	SAT	2003	DBLP DOI BibTeX RDF
34	Carla P. Gomes, Ashish Sabharwal, Bart Selman	Model Counting.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Henry A. Kautz, Ashish Sabharwal, Bart Selman	Incomplete Algorithms.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Fahiem Bacchus, Matti Järvisalo, Ruben Martins	Maximum Satisfiabiliy.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Dimitris Achlioptas	Random Satisfiabiliy.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Marijn J. H. Heule	Proofs of Unsatisfiability.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Olivier Roussel, Vasco M. Manquinho	Pseudo-Boolean and Cardinality Constraints.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Hans Kleine Büning, Uwe Bubeck	Theory of Quantified Boolean Formulas.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Oliver Kullmann	Fundaments of Branching Heuristics.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Steven D. Prestwich	CNF Encodings.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Adnan Darwiche, Knot Pipatsrisawat	Complete Algorithms.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Marijn J. H. Heule, Hans van Maaren	Look-Ahead Based SAT Solvers.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Jussi Rintanen	Planning and SAT.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Armin Biere, Matti Järvisalo, Benjamin Kiesl	Preprocessing in SAT Solving.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	João Marques-Silva 0001, Inês Lynce, Sharad Malik	Conflict-Driven Clause Learning SAT Solvers.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Carla P. Gomes, Ashish Sabharwal	Exploiting Runtime Variation in Complete Solvers.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Chu Min Li, Felip Manyà	MaxSAT, Hard and Soft Constraints.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Roberto Sebastiani, Armando Tacchella	SAT Techniques for Modal and Description Logics.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Rolf Drechsler, Tommi A. Junttila, Ilkka Niemelä	Non-Clausal SAT and ATPG.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Marko Samer, Stefan Szeider	Fixed-Parameter Tractability.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Hans Kleine Büning, Oliver Kullmann	Minimal Unsatisfiability and Autarkies.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Evgeny Dantsin, Edward A. Hirsch	Worst-Case Upper Bounds.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Daniel Kroening	Software Verification.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Hantao Zhang	Combinatorial Designs by SAT Solvers.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Holger H. Hoos, Frank Hutter, Kevin Leyton-Brown	Automated Configuration and Selection of SAT Solvers.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Olaf Beyersdorff, Mikolás Janota, Florian Lonsing, Martina Seidl	Quantified Boolean Formulas.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi	Approximate Model Counting.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Armin Biere	Bounded Model Checking.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Sam Buss, Jakob Nordström	Proof Complexity and SAT Solving.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Enrico Giunchiglia, Paolo Marin, Massimo Narizzano	Reasoning with Quantified Boolean Formulas.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Fabrizio Altarelli, Rémi Monasson, Guilhem Semerjian, Francesco Zamponi	Connections to Statistical Physics.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
34	Armin Biere	Bounded Model Checking.	Handbook of Satisfiability	2009	DBLP DOI BibTeX RDF
34	Hantao Zhang	Combinatorial Designs by SAT Solvers.	Handbook of Satisfiability	2009	DBLP DOI BibTeX RDF
34	Carla P. Gomes, Ashish Sabharwal, Bart Selman	Model Counting.	Handbook of Satisfiability	2009	DBLP DOI BibTeX RDF
34	Jussi Rintanen	Planning and SAT.	Handbook of Satisfiability	2009	DBLP DOI BibTeX RDF
34	Marko Samer, Stefan Szeider	Fixed-Parameter Tractability.	Handbook of Satisfiability	2009	DBLP DOI BibTeX RDF
34	Enrico Giunchiglia, Paolo Marin, Massimo Narizzano	Reasoning with Quantified Boolean Formulas.	Handbook of Satisfiability	2009	DBLP DOI BibTeX RDF
34	Olivier Roussel, Vasco M. Manquinho	Pseudo-Boolean and Cardinality Constraints.	Handbook of Satisfiability	2009	DBLP DOI BibTeX RDF
34	Hans Kleine Büning, Uwe Bubeck	Theory of Quantified Boolean Formulas.	Handbook of Satisfiability	2009	DBLP DOI BibTeX RDF
34	Marijn Heule, Hans van Maaren	Look-Ahead Based SAT Solvers.	Handbook of Satisfiability	2009	DBLP DOI BibTeX RDF
34	Henry A. Kautz, Ashish Sabharwal, Bart Selman	Incomplete Algorithms.	Handbook of Satisfiability	2009	DBLP DOI BibTeX RDF
34	Carla P. Gomes, Ashish Sabharwal	Exploiting Runtime Variation in Complete Solvers.	Handbook of Satisfiability	2009	DBLP DOI BibTeX RDF
34	Oliver Kullmann	Fundaments of Branching Heuristics.	Handbook of Satisfiability	2009	DBLP DOI BibTeX RDF
34	João Marques-Silva 0001, Inês Lynce, Sharad Malik	Conflict-Driven Clause Learning SAT Solvers.	Handbook of Satisfiability	2009	DBLP DOI BibTeX RDF
34	Daniel Kroening	Software Verification.	Handbook of Satisfiability	2009	DBLP DOI BibTeX RDF
34	Steven D. Prestwich	CNF Encodings.	Handbook of Satisfiability	2009	DBLP DOI BibTeX RDF
34	Hans Kleine Büning, Oliver Kullmann	Minimal Unsatisfiability and Autarkies.	Handbook of Satisfiability	2009	DBLP DOI BibTeX RDF
34	Roberto Sebastiani, Armando Tacchella	SAT Techniques for Modal and Description Logics.	Handbook of Satisfiability	2009	DBLP DOI BibTeX RDF
34	Evgeny Dantsin, Edward A. Hirsch	Worst-Case Upper Bounds.	Handbook of Satisfiability	2009	DBLP DOI BibTeX RDF
34	Adnan Darwiche, Knot Pipatsrisawat	Complete Algorithms.	Handbook of Satisfiability	2009	DBLP DOI BibTeX RDF
34	Fabrizio Altarelli, Rémi Monasson, Guilhem Semerjian, Francesco Zamponi	Connections to Statistical Physics.	Handbook of Satisfiability	2009	DBLP DOI BibTeX RDF
34	Chu Min Li, Felip Manyà	MaxSAT, Hard and Soft Constraints.	Handbook of Satisfiability	2009	DBLP DOI BibTeX RDF
34	Rolf Drechsler, Tommi A. Junttila, Ilkka Niemelä	Non-Clausal SAT and ATPG.	Handbook of Satisfiability	2009	DBLP DOI BibTeX RDF
34	Ding-Zhu Du, Jun Gu, Panos M. Pardalos (eds.)	Satisfiability Problem: Theory and Applications, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, March 11-13, 1996	Satisfiability Problem: Theory and Applications	1997	DBLP DOI BibTeX RDF
34	David S. Johnson, Michael A. Trick (eds.)	Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993	Cliques, Coloring, and Satisfiability	1996	DBLP DOI BibTeX RDF
34	Craig K. Rushforth, Wei Wang	Local search for channel assignment in cellular mobile networks.	Satisfiability Problem: Theory and Applications	1996	DBLP DOI BibTeX RDF
34	David A. Plaisted, Geoffrey D. Alexander	Propositional search efficiency and first-order theorem proving.	Satisfiability Problem: Theory and Applications	1996	DBLP DOI BibTeX RDF
34	Roberto Battiti, Marco Protasi	Solving MAX-SAT with non-oblivious functions and history-based heuristics.	Satisfiability Problem: Theory and Applications	1996	DBLP DOI BibTeX RDF
34	Mauricio G. C. Resende, Leonidas S. Pitsoulis, Panos M. Pardalos	Approximate solution of weighted MAX-SAT problems using GRASP.	Satisfiability Problem: Theory and Applications	1996	DBLP DOI BibTeX RDF
34	Paul Walton Purdom Jr., G. Neil Haven	Backtracking and probing.	Satisfiability Problem: Theory and Applications	1996	DBLP DOI BibTeX RDF
34	Sandeep K. Shukla, Daniel J. Rosenkrantz, Harry B. Hunt III, Richard Edwin Stearns	The polynomial time decidability of simulation relations for finite processes: A HORNSAT based approach.	Satisfiability Problem: Theory and Applications	1996	DBLP DOI BibTeX RDF
34	Shawki Areibi, Anthony Vannelli	A GRASP clustering technique for circuit partitioning.	Satisfiability Problem: Theory and Applications	1996	DBLP DOI BibTeX RDF
34	Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan	Complexity of hierarchically and 1-dimensional periodically specified problems I: Hardness results.	Satisfiability Problem: Theory and Applications	1996	DBLP DOI BibTeX RDF
34	Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc	A better upper bound for the unsatisfiability threshold.	Satisfiability Problem: Theory and Applications	1996	DBLP DOI BibTeX RDF
34		Foreword.	Satisfiability Problem: Theory and Applications	1996	DBLP BibTeX RDF
34	Oliver Kullman	Worst-case analysis, 3-SAT decision and lower bounds: Approaches for improved SAT algorithms.	Satisfiability Problem: Theory and Applications	1996	DBLP DOI BibTeX RDF
34	Steve Joy, John E. Mitchell 0001, Brian Borchers	A branch and cut algorithm for MAX-SAT and weighted MAX-SAT.	Satisfiability Problem: Theory and Applications	1996	DBLP DOI BibTeX RDF
34		Preface.	Satisfiability Problem: Theory and Applications	1996	DBLP BibTeX RDF
34	Jieh Hsiang, Guan-Shieng Huang	Some fundamental properties of Boolean ring normal forms.	Satisfiability Problem: Theory and Applications	1996	DBLP DOI BibTeX RDF
34	Henry A. Kautz, Bart Selman, YueYen Jiang	A general stochastic approach to solving problems with hard and soft constraints.	Satisfiability Problem: Theory and Applications	1996	DBLP DOI BibTeX RDF
34	Michael A. Trick	Appendix: Second DIMACS Challenge test problems.	Cliques, Coloring, and Satisfiability	1993	DBLP DOI BibTeX RDF
34	Arun Jagota, Laura A. Sanchis, Ravikanth Ganesan	Approximately solving Maximum Clique using neural network and related heuristics.	Cliques, Coloring, and Satisfiability	1993	DBLP DOI BibTeX RDF
34	Mark Brockington, Joseph C. Culberson	Camouflaging independent sets in quasi-random graphs.	Cliques, Coloring, and Satisfiability	1993	DBLP DOI BibTeX RDF
34	Craig A. Morgenstern	Distributed coloration neighborhood search.	Cliques, Coloring, and Satisfiability	1993	DBLP DOI BibTeX RDF
34	Joseph C. Culberson, Feng Luo	Exploring the k-colorable landscape with Iterated Greedy.	Cliques, Coloring, and Satisfiability	1993	DBLP DOI BibTeX RDF
34	Luana E. Gibbons, Donald W. Hearn, Panos M. Pardalos	A continuous based heuristic for the maximum clique problem.	Cliques, Coloring, and Satisfiability	1993	DBLP DOI BibTeX RDF
34	Joseph Cheriyan, William H. Cunningham, Levent Tunçel, Yaoguang Wang	A linear programming and rounding approach to max 2-sat.	Cliques, Coloring, and Satisfiability	1993	DBLP DOI BibTeX RDF
34	Tal Grossman	Applying the INN model to the Maximum Clique problem.	Cliques, Coloring, and Satisfiability	1993	DBLP DOI BibTeX RDF
34	Egon Balas, William Niehaus	Finding large cliques in arbitrary graphs by bipartite matching.	Cliques, Coloring, and Satisfiability	1993	DBLP DOI BibTeX RDF
34	Daniele Pretolani	Efficiency and stability of hypergraph SAT algorithms.	Cliques, Coloring, and Satisfiability	1993	DBLP DOI BibTeX RDF
34	Edward C. Sewell	An improved algorithm for exact graph coloring.	Cliques, Coloring, and Satisfiability	1993	DBLP DOI BibTeX RDF
34	Mark K. Goldberg, Reid D. Rivenburgh	Constructing cliques using restricted backtracking.	Cliques, Coloring, and Satisfiability	1993	DBLP DOI BibTeX RDF
34	Patrick Soriano, Michel Gendreau	Tabu search algorithms for the maximum clique problem.	Cliques, Coloring, and Satisfiability	1993	DBLP DOI BibTeX RDF
34	Carlo Mannino, Antonio Sassano	Edge projection and the maximum cardinality stable set problem.	Cliques, Coloring, and Satisfiability	1993	DBLP DOI BibTeX RDF
34	Jean-Marie Bourjolly, Paul Gill, Gilbert Laporte, Hélène Mercure	An exact quadratic 0-1 algorithm for the stable set problem.	Cliques, Coloring, and Satisfiability	1993	DBLP DOI BibTeX RDF
34	Steven Homer, Marcus Peinado	Experiments with polynomial-time CLIQUE approximation algorithms on very large graphs.	Cliques, Coloring, and Satisfiability	1993	DBLP DOI BibTeX RDF
34	Fred W. Glover, Mark Parker, Jennifer Ryan	Coloring by tabu branch and bound.	Cliques, Coloring, and Satisfiability	1993	DBLP DOI BibTeX RDF