Number representations of satisfiability

Journal of Mathematical Sciences

Volumn 98, Issue 4, 2000, Pages 464-478

  Davydov, G V ^a   Davydova I M ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 52849131817     PISSN: 10723374     EISSN: 15738795     Source Type: Journal    
DOI: 10.1007/BF02362267     Document Type: Article

References (21)

1. G. V. Davydov and I. M. Davydova, "On solvability of the system Ax = 0, x ≥ 0, with unknown coefficients," Izv. VUZ, Mat., 9, 85-88 (1990).
2. G. Davydov and I. Davydova "Tautologies and positive solvability of homogeneous systems," Ann. Pure Appl. Logic, 57, 27-43 (1992).
3. D. Gale, The Theory of Linear Economic Models, McGraw-Hill, New York (1960).
4. G. V. Davydov and I. M. Davydova, "Solvable matrices," Vestn. SPbGU, Ser. 1, 3-9 (1993).
5. G. V. Davydov and I. M. Davydova, "A flow interpretation of NP-complete problems," Izv. VUZ, Mat., 32, 96-101 (1988).
6. L. Lovász, An Algorithmic Theory of Numbers, Graphs, and Convexity, Philadelphia (1986).
7. G. V. Davydov and I. M. Davydova, "Solvability of linear systems and satisfiability." Vestn. SPbGU, Ser. 1, 14-17 (1995).
8. M. I. Zakharevich, "Solvable formulas and systems of linear inequalities," in: Semiotic Aspects of Formalization of Intellectual Activity [in Russian], Moscow (1988), pp. 14-15.
9. L. R. Ford and D. R. Fulkerson, Flows in Networks, Princeton (1962).
10. P. Barth, A Davis-Putnam Based Enumeration Algorithm for Linear Pseudo-Boolean Optimization, Tech. Report of MPI Informatik, MPI-I-95-2-003 (1995).
11. G. V. Davydov, "Synthesis of resolution and the inverse method," Zap. Nauchn. Semin. LOMI, 20, 24-35 (1971).
12. I. M. Davydova, Search Schemes in Placement Problems [in Russian], Leningrad (1985).
13. G. V. Davydov and I. M. Davydova, "Dual criterium of optimality in discrete problems," Izv. VUZ, Mat., 57-59 (1985).
14. G. V. Davydov and I. M. Davydova, "Dual algorithms in discrete optimization," Vopr. Kibern., 131. 90-117 (1987).
15. G. V. Davydov and I. M. Davydova, "Duality and nontree-like search in discrete optimization," Izv. Akad. Nauk SSSR, Tekh. Kibern., 86-93 (1987).
16. G. V. Davydov and I. M. Davydova, "Nontree-like coverings in discrete optimization," Izv. VUZ, Mat., 66-69 (1988).
17. G. V. Davydov and I. M. Davydova, "The branch-and-bound method," in: Operations Research and Statistical Models [in Russian], 6 (1994), pp. 14-30.
18. P. B. Andrews, "Refutations by matings," IEEE Transact. Comp., 25, 801-807 (1976).
19. W. Bibel. Automated Theorem Proving, Braunschweig (1982).
20. J. A. Robinson, "On automatic deduction," Rice Univ. Studies, 50 (1), 69-89 (1964).
21. S. Yu. Maslov, "The inverse method of checking derivability in classical predicate calculus," Dokl. Akad. Nauk SSSR, 159, 17-20 (1964).