|
 REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
ANDREWS, P B Reutations by matmgs IEEE Trans. on Comput 25 (1976), 801-807
|
 |
1a
|
|
| |
1b
|
|
| |
2
|
|
| |
3
|
BIBEL, W.Tautology testing with a generalized matrix reduction method. Theoret Comput. Sct 8 (1979), 31-44
|
| |
4
|
BIBEL, W A comparative study of several proof procedures To appear in Art~ lntelL
|
| |
5
|
|
| |
6
|
BIBEL, W A strong completeness result for the connection graph proof procedure. Ber ATP-3-IV- 80, Techmsche Umv Munchen, Munchen, W. Germany, 1980 Submitted to SIAM J Comput
|
| |
7
|
BIBEL, W, AND SCHREIBER, J Proof search m a Gentzen-hke system of first-order logic Proc Int Computing Symposium, North-Holland, Amsterdam, 1975, pp 205-212
|
| |
8
|
BLEDSOE, W.W. Non-resolution theorem proving Amf Intell. 9 (1977), 1-35
|
| |
9
|
BROWN, F Notes on chains and connection graphs Personal Notes, Dep of Computation and Logic, Edinburgh Umv, Edinburgh, Scotland, 1976
|
| |
10
|
DAVIS, M Ehmmatmg the irrelevant from mechanical proofs In Expertmental Amhmenc, Htgh Speed Computmg and Mathemaucs, Proc of Symp m Applied Mathematics 15, American Mathematlcal Society, New York, 1963, pp. 15-30.
|
| |
11
|
DUNHAM, B , AND WANG, H Toward feasible solutions of the tautology problem Ann. Math Logic 10 (1976), 117-154
|
| |
12
|
GOLDBERG, A Average case complexity of the satisfiabdity problem 4th Workshop on Automated Deduction, Austin, Texas, 1979, pp. 1-16
|
| |
13
|
KNUTH, D.E, MORRIS, J H, AND PRATT, V R Fast pattern matching in strings SIAM J Comput 6 (1977), 323-350.
|
| |
14
|
|
| |
15
|
MATETI, P, AND DEO, N. On algorithms for enumerating all circuits of a graph SlAM J Comput 5 (1976), 90--99
|
| |
16
|
PRAWiTZ, D An improved proof procedure Theona 26 (1960), 102-139.
|
| |
17
|
PRAWITZ, D A proof procedure with matrix reduction Symp on Automatic Demonstration, Lecture Notes in Mathematics 125, M. Laudet, Ed, Springer Verlag, Berlin, 1970, pp 207-213.
|
| |
18
|
|
| |
19
|
SCHREIBER, J Vergleichende qualitative und quantitative Untersuchungen von Bewelsverfahren Ber Nr 7411, Mathematics Dep, Techmsche Unlv Munchen, Munchen, W. Germany, 1974
|
| |
20
|
SICKEL, S. A search technique for clause lnterconnectivity graphs IEEE Tram Comput 25 (1976), 823-835
|
| |
21
|
SHOSTAK, R E Refutation graphs, Arttf Intell 7 (1976), 51-64
|
| |
22
|
SMULLYAN, R M F~rst-Order Logic Sprmger Verlag, Berlin, 1968
|
| |
23
|
STEPHAN, W, AND SIEKMANN, J Completeness and soundness of the connection graph proof procedure In AISB/GI Conference on Amfictal Intelhgence, D Sleeman, Ed., Leeds University Press, 1978, pp 340--344 Full version as. Int Ber 7/76, InstltUt fur Informatlk, Umv Karlsruhe, Karlsruhe, W Germany, 1976
|
| |
24
|
WILKINS, D.E QUEST. A non-clausal theorem proving system Master Thesis, Umv of Essex, Essex, England, 1973
|
CITED BY 21
|
|
|
|
|
|
|
|
|
|
|
Allen Goldberg , T. C. Wang , David Zimmerman, Applications of feasible path analysis to program testing, Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis, p.80-94, August 17-19, 1994, Seattle, Washington, United States
|
|
|
Robert Jasper , Mike Brennan , Keith Williamson , Bill Currier , David Zimmerman, Test data generation and feasible path analysis, Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis, p.95-107, August 17-19, 1994, Seattle, Washington, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
F.2