Number of models and satisfiability of sets of clauses

Theoretical Computer Science

Volumn 155, Issue 1, 1996, Pages 277-288

  Zhang, Wenhui ^a,b  

^a UNIVERSITY OF SOUTH EASTERN NORWAY   (Norway)

^b NONE   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS;

CLAUSES; PROPOSITIONAL FORMULAS; SATISFIABILITY PROBLEMS;

COMPUTATIONAL METHODS;

EID: 0030087227     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00144-1     Document Type: Article

References (5)

1. C. Chang and R. Lee, Symbolic Logic and Mechanical Theorem Proving (Academic Press, New York, 1973).
2. S.A. Cook and R.A. Reckhow, The relative efficiency of propositional proof systems, The J. Symbolic Logic 44 (1979) 36-50.
3. Michael R. Garey and David S. Johnson, Computers and Intractability - A Guide to the Theory of NP-completeness (W. H. Freeman and Company, New York, 1979).
4. n steps, Discrete Appl. Math. 10 (1985) 287-295.
5. n steps, in: Computer Science Logic, Lecture Notes in Computer Science, Vol. 702 (Springer, Berlin, 1993) 379-394.