An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF

Annals of Mathematics and Artificial Intelligence

Volumn 23, Issue 3-4, 1998, Pages 229-245

  Davydov, Gennady ^a  

^a Solomenko Institute of Transport Problems of the Russian Academy of Sciences   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 22444455509     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1018924526592     Document Type: Article

References (6)

1. M. Davis and H. Putnam, A computing procedure for quantification theory, Journal of ACM 7 (1960) 201-215.
2. G. Davydov and I. Davydova, Solvable matrices, Vestnik St. Petersburg University, Mathematics 26(1) (1993) 1-6
3. (see also Mathematical Reviews (1996)).
4. W.F. Dowling and J.H. Gallier, Linear-time algorithms for testing the satisfiability of propositional Horn formulae, Journal of Logic Programming 1 (1984) 267-284.
5. C.H. Papadimitriou and D. Wolfe, The complexity of facets resolved, Journal of Computer and System Sciences 37 (1988) 2-13.
6. C.H. Papadimitriou and M. Yannakakis, The complexity of facets (and some facets of complexity), Journal of Computer and System Sciences 28 (1984) 244-259.