Boolean Satisfiability -- From Theoretical . . .

Boolean Satisfiability -- From Theoretical . . . (2009)

Cached

Download Links

[www.eng.auburn.edu]

by Harad Malik, et al.

BibTeX

@MISC{Malik09booleansatisfiability,
    author = {Harad Malik and et al.},
    title = {Boolean Satisfiability -- From Theoretical . . .},
    year = {2009}
}

Bookmark

OpenURL

Abstract

Citations

8881	D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness - Garey, Johnson - 1979
2605	Graph-based algorithms for Boolean function manipulation - Bryant - 1986
2026	Model Checking - Clarke, Grumberg, et al. - 2000
926	A computing procedure for quantification theory - Davis, Putnam - 1960
909	Chaff: Engineering an efficient SAT solver - Moskewicz, Madigan, et al. - 2001
636	The complexity of theorem-proving procedures - Cook - 1971
636	A machine program for theorem proving - Davis, Logemann, et al. - 1962
620	A New Method for Solving Hard Satisfiability Problems - Selman, Levesque, et al. - 1992
362	Planning as satisfiability - Kautz, Selman - 1992
318	Noise strategies for improving local search - Selman, Kautz, et al. - 1994
269	Boosting combinatorial search through randomization - Gomes, Selman, et al. - 1998
250	On the Complexity of Derivation in Propositional Calculus - Tseitin - 1968
227	Test pattern generation using Boolean satisfiability - Larrabee - 1992
187	Logic in Computer Science. Modelling and reasoning about systems - Huth, Ryan - 2000
182	Using CSP look-back techniques to solve real-world SAT instances - Bayardo, Schrag - 1997
167	Remote agent: To boldly go where no AI system has gone before - Muscettola, Nayak, et al. - 1998
106	Applying SAT methods in unbounded symbolic model checking - McMillan - 2002
95	Finding bugs with a constraint solver - Jackson, Vaziri - 2000
86	A.: Effective preprocessing in SAT through variable and clause elimination - Eén, Biere - 2005
73	Benefits of bounded model checking at an industrial setting - Copty, Fix, et al. - 2001
72	Backdoors to typical case complexity - Williams, Gomes, et al. - 2003
60	Survey propagation: an algorithm for satisfiability. Random Struct - Braunstein, Mézard, et al. - 2005
49	Symbolic model checking without BDDs. Tools and Algorithms for the Analysis and Construction of Systems - Biere, Cimatti, et al. - 1999
46	SATzilla: Portfolio-based algorithm selection for SAT - Xu, Hutter, et al.
45	Conflict analysis in search algorithms for propositional satisfiability - Marques-Silva, Sakallah - 1996
39	Tabu search for SAT - Mazure, Sas, et al. - 1997
38	A hybrid SAT-based decision procedure for separation logic with uninterpreted functions - Seshia, Lahiri, et al. - 2003
29	Satisfiability modulo theories - Barrett, Sebastiani, et al.
29	Boosting verification by automatic tuning of decision procedures - Hutter, Babic, et al. - 2007
21	Satisfiability-based layout revisited: Detailed routing of complex FPGAs via search-based - Nam, Sakallah, et al. - 1999
9	A flipping genetic algorithm for hard 3-SAT problems - Marchiori, Rossi - 1999
9	Generating college conference basketball schedules by a SAT solver - Zhang - 2002
6	On the connections between heavy-tails, backdoors, and restarts in combinatorial search - Williams, Gomes, et al. - 2003
3	A system for determining prepositional logic theorems by applying values and rules to triplets that are generated from a formula. U.S. Patent Number 5276897 - Stålmarck - 1994
2	Verification using satisfiability checking, predicate abstraction, and Craig interpolation - Jain - 2008
2	A NN algorithm for Boolean satisfiability problems - Spears
1	Preface: Special issue on computational methods for graph coloring and its generalizations. Discrete Applied Mathematics 156, 2; Computational Methods for Graph Coloring and its Generalizations - Johnson, Mehrotra, et al.
1	Declarative infrastructure configuration and debugging - Narain, Levin, et al. - 2008
1	Simulated annealing for hard satisfiability problems. Cliques, Coloring and Satisfiability - Spears - 1993