A Simple Test Improves Checking Satisfiability
暂无分享,去创建一个
[1] Jean H. Gallier,et al. Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..
[2] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[3] Maria Grazia Scutellà,et al. A Note on Dowling and Gallier's Top-Down Algorithm for Propositional Horn Satisfiability , 1990, J. Log. Program..
[4] Donald W. Loveland,et al. Automated theorem proving: a logical basis , 1978, Fundamental studies in computer science.
[5] Cynthia A. Brown,et al. On the average case analysis of some satisfiability model problems , 1986, Inf. Sci..
[6] Paul Walton Purdom,et al. The Pure Literal Rule and Polynomial Average Time , 1985, SIAM J. Comput..
[7] Toniann Pitassi,et al. A Feasibly Constructive Lower Bound for Resolution Proofs , 1990, Inf. Process. Lett..
[8] Ewald Speckenmeyer,et al. Solving satisfiability in less than 2n steps , 1985, Discret. Appl. Math..
[9] Zvi Galil,et al. On the Complexity of Regular Resolution and the Davis-Putnam Procedure , 1977, Theor. Comput. Sci..
[10] Paul Walton Purdom,et al. Exponential Average Time for the Pure Literal Rule , 1989, SIAM J. Comput..
[11] Paul Walton Purdom,et al. Average Time Analyses of Simplified Davis-Putnam Procedures , 1982, Inf. Process. Lett..
[12] Giorgio Gallo,et al. Algorithms for Testing the Satisfiability of Propositional Formulae , 1989, J. Log. Program..
[13] Kazuo Iwama,et al. CNF Satisfiability Test by Counting and Polynomial Average Time , 1989, SIAM J. Comput..
[14] Paul W. Purdom,et al. Solving Satisfiability with Less Searching , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[15] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[16] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[17] Endre Szemerédi,et al. Many hard examples for resolution , 1988, JACM.
[18] Richard C. T. Lee,et al. Symbolic logic and mechanical theorem proving , 1973, Computer science classics.