메뉴 건너뛰기




Volumn 2002-January, Issue , 2002, Pages 282-294

A logic for reasoning about digital rights

Author keywords

Authorization; Computer languages; Computer science; Computer security; Conferences; Licenses; Loans and mortgages; Logic; Resource management; Writing

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER RESOURCE MANAGEMENT; COMPUTER SCIENCE; SECURITY OF DATA; SECURITY SYSTEMS; SEMANTICS; SPECIFICATIONS; TECHNICAL WRITING;

EID: 84948751138     PISSN: 10636900     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSFW.2002.1021822     Document Type: Conference Paper
Times cited : (45)

References (25)
  • 1
    • 84945709734 scopus 로고
    • Derivatives of regular expressions
    • J. A. Brzozowski. Derivatives of regular expressions. Journal of the ACM, 11(4):481-494, 1964.
    • (1964) Journal of the ACM , vol.11 , Issue.4 , pp. 481-494
    • Brzozowski, J.A.1
  • 6
    • 0003198753 scopus 로고
    • Logics of Time and Computation
    • CSLI
    • R. Goldblatt. Logics of Time and Computation. CSLI Lecture Notes, No. 7. CSLI, 1992.
    • (1992) CSLI Lecture Notes , Issue.7
    • Goldblatt, R.1
  • 12
    • 84945708698 scopus 로고
    • An axiomatic basis for computer programming
    • C. A. R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12:576-580, 583, 1969.
    • (1969) Communications of the ACM , vol.12
    • Hoare, C.A.R.1
  • 14
    • 84949673542 scopus 로고    scopus 로고
    • Translating regular expressions into small epsilon-free nondeterministic finite automata
    • Symposium on Theoretical Aspects of Computer Science
    • J. Hromkovic, S. Seibert, and T. Wilke. Translating regular expressions into small epsilon-free nondeterministic finite automata. In Symposium on Theoretical Aspects of Computer Science, volume 1200 of Lecture Notes in Computer Science, pages 55-66, 1997.
    • (1997) Lecture Notes in Computer Science , vol.1200 , pp. 55-66
    • Hromkovic, J.1    Seibert, S.2    Wilke, T.3
  • 15
    • 84948833765 scopus 로고    scopus 로고
    • IPR Systems Pty Ltd. Open Digital Rights Language (ODRL). Available from http://odrl.net, 2001.
    • (2001)
    • IPR Systems Pty Ltd.1
  • 16
    • 85032212524 scopus 로고
    • The prescription of description of state based systems
    • B. Banieqbal, H. Barringer, and A. Pnueli, editors, Temporal Logic in Specification, Springer
    • S. Khosla and T. S. E. Maibaum. The prescription of description of state based systems. In B. Banieqbal, H. Barringer, and A. Pnueli, editors, Temporal Logic in Specification, volume 398 of Lecture Notes in Computer Science, pages 243-294. Springer, 1987.
    • (1987) Lecture Notes in Computer Science , vol.398 , pp. 243-294
    • Khosla, S.1    Maibaum, T.S.E.2
  • 17
    • 0008688014 scopus 로고
    • A logic model for electronic contracting
    • R. M. Lee. A logic model for electronic contracting. Decision Support Systems, 4:27-44, 1988.
    • (1988) Decision Support Systems , vol.4 , pp. 27-44
    • Lee, R.M.1
  • 18
    • 84972542053 scopus 로고
    • A different approach to deontic logic: Deontic logic viewed as a variant of dynamic logic
    • J.-J. C. Meyer. A different approach to deontic logic: Deontic logic viewed as a variant of dynamic logic. Notre Dame Journal of Formal Logic, 29(1):109-136, 1988.
    • (1988) Notre Dame Journal of Formal Logic , vol.29 , Issue.1 , pp. 109-136
    • Meyer, J.-J.C.1
  • 21
    • 0003369934 scopus 로고    scopus 로고
    • Digital content and intellectual property rights
    • A. Ramanujapuram and P. Ram. Digital content and intellectual property rights. Dr. Dobb's Journal, 23(12):20-27, 1998.
    • (1998) Dr. Dobb's Journal , vol.23 , Issue.12 , pp. 20-27
    • Ramanujapuram, A.1    Ram, P.2
  • 22
    • 0022092438 scopus 로고
    • The complexity of propositional linear temporal logic
    • A. Sistla and E. Clarke. The complexity of propositional linear temporal logic. Journal of the ACM, 32:733-749, 1985.
    • (1985) Journal of the ACM , vol.32 , pp. 733-749
    • Sistla, A.1    Clarke, E.2
  • 24
    • 84957046895 scopus 로고    scopus 로고
    • Alternating automata: Checking truth and validity for temporal logics
    • Proceedings of the 14th International Conference on Automated Deduction, Springer
    • M. Y. Vardi. Alternating automata: Checking truth and validity for temporal logics. In Proceedings of the 14th International Conference on Automated Deduction, volume 1249 of Lecture Notes in Computer Science, pages 191-206. Springer, 1997.
    • (1997) Lecture Notes in Computer Science , vol.1249 , pp. 191-206
    • Vardi, M.Y.1
  • 25
    • 0002374223 scopus 로고
    • Applications of deontic logic in computer science: A concise overview
    • J.-J. C. Meyer and R. J. Wieringa, editors, chapter 2, John Wiley & Sons
    • R. J. Wieringa and J.-J. C. Meyer. Applications of deontic logic in computer science: A concise overview. In J.-J. C. Meyer and R. J. Wieringa, editors, Deontic Logic in Computer Science: Normative System Specification, chapter 2, pages 17-40. John Wiley & Sons, 1993.
    • (1993) Deontic Logic in Computer Science: Normative System Specification , pp. 17-40
    • Wieringa, R.J.1    Meyer, J.-J.C.2


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