메뉴 건너뛰기
Discrete Applied Mathematics
Volumn 107, Issue 1-3, 2000, Pages 83-98
On subclasses of minimal unsatisfiable formulas
Author keywords

Minimal unsatisfiability; Propositional formulas
Indexed keywords

EID: 0000781361     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00245-6     Document Type: Article
Times cited : (57)
References (10)
  • 1
    • 0040072443 scopus 로고
    • Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
    • Aharoni R., Linial N. Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas. J. Combin. Theory. 43:1986;196-204.
    • (1986) J. Combin. Theory , vol.43 , pp. 196-204
    • Aharoni, R.1    Linial, N.2
  • 2
    • 0001548856 scopus 로고
    • A linear-time algorithm for testing the truth of certain quantified Boolean formulas
    • Aspvall B., Plass M.F., Tarjan R.E. A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Inform. Process. Lett. 8:1979;121-123.
    • (1979) Inform. Process. Lett. , vol.8 , pp. 121-123
    • Aspvall, B.1    Plass, M.F.2    Tarjan, R.E.3
  • 3
    • 22444455509 scopus 로고    scopus 로고
    • An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
    • Davydov G., Davydova I., Kleine Büning H. An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF. Ann. Math. Artif. Intell. 23:1998;229-245.
    • (1998) Ann. Math. Artif. Intell. , vol.23 , pp. 229-245
    • Davydov, G.1    Davydova, I.2    Kleine Büning, H.3
  • 4
    • 0021509216 scopus 로고
    • Linear-time algorithms for testing the satisfiability of propositional horn formulae
    • Dowling W.F., Gallier J.H. Linear-time algorithms for testing the satisfiability of propositional horn formulae. J. Logic Programming. 1:1984;267-284.
    • (1984) J. Logic Programming , vol.1 , pp. 267-284
    • Dowling, W.F.1    Gallier, J.H.2
  • 5
    • 0019346375 scopus 로고
    • Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
    • Franco J., Paull M. Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem. Discrete Appl. Math. 5:1983;77-87.
    • (1983) Discrete Appl. Math. , vol.5 , pp. 77-87
    • Franco, J.1    Paull, M.2
  • 6
    • 0000076101 scopus 로고
    • The intractibility of resolution
    • Haken A. The intractibility of resolution. Theoret. Comput. Sci. 39:1985;297-308.
    • (1985) Theoret. Comput. Sci. , vol.39 , pp. 297-308
    • Haken, A.1
  • 9
    • 0021406238 scopus 로고
    • The complexity of facets (and some facets of complexity)
    • Papadimitriou C.H., Yannakakis M. The complexity of facets (and some facets of complexity). J. Comput. System Sci. 28:1984;244-259.
    • (1984) J. Comput. System Sci. , vol.28 , pp. 244-259
    • Papadimitriou, C.H.1    Yannakakis, M.2
  • 10
    • 0023250297 scopus 로고
    • Hard examples for resolution
    • Urquhart A. Hard examples for resolution. J. ACM. 34:1987;209-219.
    • (1987) J. ACM , vol.34 , pp. 209-219
    • Urquhart, A.1

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.