메뉴 건너뛰기




Volumn 1617, Issue , 1999, Pages 19-23

DLP and FaCT

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84947445199     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48754-9_3     Document Type: Conference Paper
Times cited : (14)

References (7)
  • 1
    • 0030107173 scopus 로고    scopus 로고
    • Hard random 3-SAT problems and the Davis-Putnam procedure
    • J.W. Freeman. Hard random 3-SAT problems and the Davis-Putnam procedure. Artificial Intelligence, 81:183–198, 1996.
    • (1996) Artificial Intelligence , vol.81 , pp. 183-198
    • Freeman, J.W.1
  • 3
    • 84957645011 scopus 로고    scopus 로고
    • Building decision procedures for modal logics from propositional decision procedures—the case study of modal K
    • M. McRobbie and J. Slaney, editors, Lecture Notes in Artificial Intelligence, Springer-Verlag
    • F. Giunchiglia and R. Sebastiani. Building decision procedures for modal logics from propositional decision procedures—the case study of modal K. In M. McRobbie and J. Slaney, editors, Proceedings of the Thirteenth International Conference' on Automated Deduction (CADE-13), number 1104 in Lecture Notes in Artificial Intelligence, pages 583–597. Springer-Verlag, 1996.
    • (1996) Proceedings of the Thirteenth International Conference' on Automated Deduction (CADE-13) , Issue.1104 , pp. 583-597
    • Giunchiglia, F.1    Sebastiani, R.2
  • 6
    • 62649136732 scopus 로고    scopus 로고
    • Optimising propositional modal satisfiability for description logic subsumption
    • Lecture Notes in Artificial Intelligence. Springer-Verlag
    • I. Horrocks and P. F. Patel-Schneider. Optimising propositional modal satisfiability for description logic subsumption. In International Conference AISC’98, Lecture Notes in Artificial Intelligence. Springer-Verlag, 1998b.
    • (1998) International Conference AISC’98
    • Horrocks, I.1    Patel-Schneider, P.F.2


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