A minimal-state processing search algorithm for satisfiability problems
暂无分享,去创建一个
Teruo Higashino | Nobuo Funabiki | Shigeto Tajima | Tokumi Yokohira | Tom Nakanishi | T. Higashino | N. Funabiki | T. Yokohira | Tom Nakanishi | Shigeto Tajima
[1] Roberto J. Bayardo,et al. Using CSP Look-Back Techniques to Solve Real-World SAT Instances , 1997, AAAI/IAAI.
[2] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.
[3] Wei Sun,et al. Solving satisfiability and implication problems in database systems , 1996, TODS.
[4] Bart Selman,et al. Domain-Independent Extensions to GSAT : Solving Large StructuredSatis ability , 1993 .
[5] Joao Marques-Silva,et al. Dynamic Search-Space Pruning Techniques in Path Sensitization , 1994, 31st Design Automation Conference.
[6] Johan de Kleer,et al. An Assumption-Based TMS , 1987, Artif. Intell..
[7] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[8] Vishwani D. Agrawal,et al. A transitive closure algorithm for test generation , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[10] Brigitte Jaumard,et al. Tabu search and a quadratic relaxation for the Satisfiability problem , 1993, Cliques, Coloring, and Satisfiability.
[11] Jun Gu,et al. Algorithms for the satisfiability (SAT) problem: A survey , 1996, Satisfiability Problem: Theory and Applications.
[12] Benjamin W. Wah,et al. A Discrete Lagrangian-Based Global-Search Method for Solving Satisfiability Problems , 1996, J. Glob. Optim..
[13] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[14] Mark Allen Weiss,et al. On Satisfiability, Equivalence, and Impication Problems Involving Conjunctive Queries in Database Systems , 1996, IEEE Trans. Knowl. Data Eng..
[15] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[16] Benjamin W. Wah,et al. A discrete Lagrangian-based global-search method for solving satisfiability problems , 1996, Satisfiability Problem: Theory and Applications.
[17] Tracy Larrabee,et al. Test pattern generation using Boolean satisfiability , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[18] William M. Spears,et al. Simulated annealing for hard satisfiability problems , 1993, Cliques, Coloring, and Satisfiability.
[19] Bart Selman,et al. Local search strategies for satisfiability testing , 1993, Cliques, Coloring, and Satisfiability.
[20] Michael H. Schulz,et al. Improved deterministic test pattern generation with applications to redundancy identification , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[21] Teruo Higashino,et al. A Minimal-State Processing Search Algorithm for Graph Coloring Problems , 2000 .
[22] Nobuo Funabiki,et al. A Two-Stage Discrete Optimization Method for Largest Common Subgraph Problems , 1999 .
[23] Kurt Keutzer,et al. Estimation of power dissipation in CMOS combinational circuits using Boolean function manipulation , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[24] Joao Marques-Silva,et al. GRASP: A Search Algorithm for Propositional Satisfiability , 1999, IEEE Trans. Computers.
[25] Steven E. Hampson,et al. Large plateaus and plateau search in Boolean Satisfiability problems: When to give up searching and start again , 1993, Cliques, Coloring, and Satisfiability.