메뉴 건너뛰기




Volumn 42, Issue 7, 1999, Pages 720-731

Two tractable subclasses of minimal unsatisfiable formulas

Author keywords

Collapsing; Minimal unsatisfiability; Satisfaibility test; Simplification procedure; Splitting

Indexed keywords


EID: 0010598232     PISSN: 10069283     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02878991     Document Type: Article
Times cited : (7)

References (6)
  • 3
    • 0001548856 scopus 로고
    • A linear algorithm for testing the truth of certain quantified boolean formulas
    • Aspvall, B., Plass, M. F., Tarjan, R. E., A linear algorithm for testing the truth of certain quantified boolean formulas, Information Processing Letters, 1979, 8: 121.
    • (1979) Information Processing Letters , vol.8 , pp. 121
    • Aspvall, B.1    Plass, M.F.2    Tarjan, R.E.3
  • 4
    • 0021509216 scopus 로고
    • Linear-time algorithm for testing the satisfiability of prepositional horn formulae
    • Dowling, W. F., Gallier, J. H., Linear-time algorithm for testing the satisfiability of prepositional horn formulae, Journal of Logic Programming, 1984, 1: 267.
    • (1984) Journal of Logic Programming , vol.1 , pp. 267
    • Dowling, W.F.1    Gallier, J.H.2
  • 6
    • 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 Applied Mathematics , 1983, 5: 77.
    • (1983) Discrete Applied Mathematics , vol.5 , pp. 77
    • Franco, J.1    Paull, M.2


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