ACM SIGMOD Anthology TKDE dblp.uni-trier.de

Global Optimization for Satisfiability (SAT) Problem.

Jun Gu: Global Optimization for Satisfiability (SAT) Problem. IEEE Trans. Knowl. Data Eng. 6(3): 361-381(1994)
@article{DBLP:journals/tkde/Gu94,
  author    = {Jun Gu},
  title     = {Global Optimization for Satisfiability (SAT) Problem},
  journal   = {IEEE Trans. Knowl. Data Eng.},
  volume    = {6},
  number    = {3},
  year      = {1994},
  pages     = {361-381},
  ee        = {db/journals/tkde/Gu94.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

Abstract

Copyright © 1994 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

Correction

TKDE 7(1): 192 (1995)

Joint ACM SIGMOD / IEEE Computer Society Anthology

CDROM Version: Load the CDROM "Volume 3 Issue 3, TKDE 1993-1995" and ... DVD Version: Load ACM SIGMOD Anthology DVD 2" and ... BibTeX

References

[1]
Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley 1974, ISBN 0-201-00029-6
BibTeX
[2]
...
[3]
Bengt Aspvall, Michael F. Plass, Robert Endre Tarjan: A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas. Inf. Process. Lett. 8(3): 121-123(1979) BibTeX
[4]
James R. Bitner, Edward M. Reingold: Backtrack Programming Techniques. Commun. ACM 18(11): 651-656(1975) BibTeX
[5]
...
[6]
Andrei Z. Broder, Alan M. Frieze, Eli Upfal: On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas. SODA 1993: 322-330 BibTeX
[7]
Cynthia A. Brown, Paul Walton Purdom Jr.: An Average Time Analysis of Backtracking. SIAM J. Comput. 10(3): 583-593(1981) BibTeX
[8]
Randal E. Bryant: Graph-Based Algorithms for Boolean Function Manipulation. IEEE Trans. Computers 35(8): 677-691(1986) BibTeX
[9]
...
[10]
...
[11]
M. B. Clowes: On Seeing Things. Artif. Intell. 2(1): 79-116(1971) BibTeX
[12]
Jacques Cohen: First Specialize, Then Generalize (Indroduction to the Special Section on Logic Programming). Commun. ACM 35(3): 34-39(1992) BibTeX
[13]
...
[14]
Stephen A. Cook: The Complexity of Theorem-Proving Procedures. STOC 1971: 151-158 BibTeX
[15]
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest: Introduction to Algorithms. The MIT Press and McGraw-Hill Book Company 1989, ISBN 0-262-03141-8,0-07-013143-0
BibTeX
[16]
...
[17]
...
[18]
Martin Davis, Hilary Putnam: A Computing Procedure for Quantification Theory. J. ACM 7(3): 201-215(1960) BibTeX
[19]
Johan de Kleer: Exploiting Locality in a TMS. AAAI 1990: 264-271 BibTeX
[20]
Nachum Dershowitz, Jieh Hsiang, N. Alan Josephson, David A. Plaisted: Associative-Commutative Rewriting. IJCAI 1983: 940-944 BibTeX
[21]
...
[22]
...
[23]
Olivier Dubois: Counting the Number of Solutions for Instances of Satisfiability. Theor. Comput. Sci. 81(1): 49-64(1991) BibTeX
[24]
Olivier Dubois, Jacques Carlier: Probabilistic approach to the Satisfiability Problem. Theor. Comput. Sci. 81(1): 65-75(1991) BibTeX
[25]
Shimon Even, Alon Itai, Adi Shamir: On the Complexity of Timetable and Multicommodity Flow Problems. SIAM J. Comput. 5(4): 691-703(1976) BibTeX
[26]
...
[27]
Zvi Galil: On the Complexity of Regular Resolution and the Davis-Putnam Procedure. Theor. Comput. Sci. 4(1): 23-46(1977) BibTeX
[28]
M. R. Garey, David S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman 1979, ISBN 0-7167-1044-7
BibTeX
[29]
Allen Van Gelder: A Satisfiability Tester for Non-clausal Propositional Calculus. Inf. Comput. 79(1): 1-21(1988) BibTeX
[30]
...
[31]
Allen Goldberg, Paul Walton Purdom Jr., Cynthia A. Brown: Average Time Analyses of Simplified Davis-Putnam Procedures. Inf. Process. Lett. 15(2): 72-75(1982) BibTeX
[32]
David E. Goldberg: Genetic Algorithms in Search Optimization and Machine Learning. Addison-Wesley 1989, ISBN 0-201-15767-5
BibTeX
[33]
...
[34]
...
[35]
...
[36]
...
[37]
...
[38]
...
[39]
Jun Gu: Design Efficient Local Search Algorithms. IEA/AIE 1992: 651-654 BibTeX
[40]
...
[41]
...
[42]
...
[43]
Jun Gu: Multispace Search: A New Optimization Approach. ISAAC 1994: 252-260 BibTeX
[44]
...
[45]
...
[46]
...
[47]
...
[48]
...
[49]
...
[50]
...
[51]
...
[52]
...
[53]
...
[54]
...
[55]
...
[56]
...
[57]
...
[58]
...
[59]
...
[60]
Jieh Hsiang: Refutational Theorem Proving Using Term-Rewriting Systems. Artif. Intell. 25(3): 255-300(1985) BibTeX
[61]
...
[62]
Juan Gu, Xiaofei Huang, Bin Du: A Quantitative Solution to Constraint Satisfaction Problem (CSP). New Generation Comput. 13(1): 99-115(1994) BibTeX
[63]
...
[64]
Kazuo Iwama: CNF Satisfiability Test by Counting and Polynomial Average Time. SIAM J. Comput. 18(2): 385-391(1989) BibTeX
[65]
Robert G. Jeroslow, Jinchang Wang: Solving Propositional Satisfiability Problems. Ann. Math. Artif. Intell. 1: 167-187(1990) BibTeX
[66]
...
[67]
...
[68]
...
[69]
...
[70]
Scott Kirkpatrick, D. Gelatt Jr., Mario P. Vecchi: Optimization by Simmulated Annealing. Science 220(4598): 671-680(1983) BibTeX
[71]
...
[72]
...
[73]
...
[74]
...
[75]
...
[76]
Alan K. Mackworth: Consistency in Networks of Relations. Artif. Intell. 8(1): 99-118(1977) BibTeX
[77]
David A. McAllester: Truth Maintenance. AAAI 1990: 1109-1116 BibTeX
[78]
Roger Mohr, Thomas C. Henderson: Arc and Path Consistency Revisited. Artif. Intell. 28(2): 225-233(1986) BibTeX
[79]
...
[80]
Christos H. Papadimitriou: On Selecting a Satisfying Truth Assignment (Extended Abstract). FOCS 1991: 163-169 BibTeX
[81]
Christos H. Papadimitriou, Kenneth Steiglitz: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall 1982, ISBN 0-13-152462-3
BibTeX
[82]
...
[83]
Paul Walton Purdom Jr.: Search Rearrangement Backtracking and Polynomial Average Time. Artif. Intell. 21(1-2): 117-133(1983) BibTeX
[84]
...
[85]
Paul Walton Purdom Jr., Cynthia A. Brown: The Pure Literal Rule and Polynomial Average Time. SIAM J. Comput. 14(4): 943-953(1985) BibTeX
[86]
...
[87]
...
[88]
John Alan Robinson: A Machine-Oriented Logic Based on the Resolution Principle. J. ACM 12(1): 23-41(1965) BibTeX
[89]
...
[90]
Thomas J. Schaefer: The Complexity of Satisfiability Problems. STOC 1978: 216-226 BibTeX
[91]
...
[92]
...
[93]
Bart Selman, Hector J. Levesque, David G. Mitchell: A New Method for Solving Hard Satisfiability Problems. AAAI 1992: 440-446 BibTeX
[94]
M. J. Shensa: A Computational Structure for the Propositional Calculus. IJCAI 1989: 384-388 BibTeX
[95]
...
[96]
...
[97]
...
[98]
...
[99]
...
[100]
Rok Sosic, Jun Gu: Efficient Local Search with Conflict Minimization: A Case Study of the n-Queens Problem. IEEE Trans. Knowl. Data Eng. 6(5): 661-668(1994) BibTeX
[101]
...
[102]
...
[103]
...
[104]
...
[105]
...
[106]
...
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
IEEE Transactions on Data and Knowledge Engineering: Copyright © by IEEE,
Joint ACM SIGMOD / IEEE Computer Society Anthology: Copyright © by ACM (info@acm.org) and IEEE, Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sun May 17 00:28:03 2009