THE SATISFIABILITY PROBLEM FOR A CLASS CONSISTING OF HORN SENTENCES AND SOME NON-HORN SENTENCES IN PROPORTIONAL LOGIC

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2] [Anonymous], SYMBOLIC LOGIC MECHA

[3] [Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[4] Galil Z., 1977, Theoretical Computer Science, V4, P23, DOI 10.1016/0304-3975(77)90054-8

[5] Garey Michael R., 1979, COMPUTERS INTRACTABI

[6] UNIT REFUTATIONS AND HORN SETS [J]. JOURNAL OF THE ACM, 1974, 21 (04) : 590 - 605

[7] Jones N. D., 1976, Theoretical Computer Science, V3, P105, DOI 10.1016/0304-3975(76)90068-2

[8] JOYNER WH, 1976, J ACM, V23, P398, DOI 10.1145/321958.321960

[9] Karp R.M., 1972, COMPLEXITY COMPUTER

[10] Kowalski R., 1974, INFORM PROCESS LETT, V74, P569

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2] [Anonymous], SYMBOLIC LOGIC MECHA

[3] [Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[4] Galil Z., 1977, Theoretical Computer Science, V4, P23, DOI 10.1016/0304-3975(77)90054-8

[5] Garey Michael R., 1979, COMPUTERS INTRACTABI

[6] UNIT REFUTATIONS AND HORN SETS [J]. JOURNAL OF THE ACM, 1974, 21 (04) : 590 - 605

[7] Jones N. D., 1976, Theoretical Computer Science, V3, P105, DOI 10.1016/0304-3975(76)90068-2

[8] JOYNER WH, 1976, J ACM, V23, P398, DOI 10.1145/321958.321960

[9] Karp R.M., 1972, COMPLEXITY COMPUTER

[10] Kowalski R., 1974, INFORM PROCESS LETT, V74, P569