메뉴 건너뛰기




Volumn , Issue , 2008, Pages 225-227

A demonstration of formal policy reasoning using an extended version of BaseVISor

Author keywords

[No Author keywords available]

Indexed keywords


EID: 51849165065     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/POLICY.2008.34     Document Type: Conference Paper
Times cited : (4)

References (11)
  • 1
    • 38949163266 scopus 로고    scopus 로고
    • C. Matheus, K. Baclawski and M.. Kokar. BaseVISor: A Triples-Based Inference Engine Outfitted to Process RuleML and R-Entailment Rules. In Proceedings of the 2nd International Conference on Rules and Rule Languages for the Semantic Web, Athens, GA, Nov. 2006.
    • C. Matheus, K. Baclawski and M.. Kokar. BaseVISor: A Triples-Based Inference Engine Outfitted to Process RuleML and R-Entailment Rules. In Proceedings of the 2nd International Conference on Rules and Rule Languages for the Semantic Web, Athens, GA, Nov. 2006.
  • 2
    • 34748908154 scopus 로고    scopus 로고
    • Rein : Where policies meet rules in the semantic web
    • Technical report, MIT, 2005
    • L. Kagal and T. Berners-Lee. Rein : Where policies meet rules in the semantic web. Technical report, MIT, 2005.
    • Kagal, L.1    Berners-Lee, T.2
  • 3
    • 33750907119 scopus 로고    scopus 로고
    • Methods and Limitations of Security Policy Reconciliation. ACM Transactions on Information and System Security (TISSEC)
    • August
    • P. McDaniel and A. Prakash. Methods and Limitations of Security Policy Reconciliation. ACM Transactions on Information and System Security (TISSEC), Association for Computing Machinery, 9(3):259-291, August 2006.
    • (2006) Association for Computing Machinery , vol.9 , Issue.3 , pp. 259-291
    • McDaniel, P.1    Prakash, A.2
  • 7
    • 51849154354 scopus 로고    scopus 로고
    • CWM
    • CWM: Closed World Machine. http://infomesh.net/2001/cwm/ 2001.
    • (2001) Closed World Machine
  • 8
    • 0020177941 scopus 로고
    • Rete: A fast algorithm for the many pattern/many object pattern match problem
    • C. L. Forgy, "Rete: a fast algorithm for the many pattern/many object pattern match problem," Artificial Intelligence, 1982, pp. 17-37.
    • (1982) Artificial Intelligence , pp. 17-37
    • Forgy, C.L.1
  • 9
    • 33646433691 scopus 로고    scopus 로고
    • H. ter Horst. Combining RDF and Part of OWL with Rules: Semantics, Decidability, Complexity. In Proc. of the Fourth Int'l Semantic Web Conference. Y. Gil et al. (Eds.): ISWC 2005, LNCS 3729, pp. 668-684, 2005.
    • H. ter Horst. Combining RDF and Part of OWL with Rules: Semantics, Decidability, Complexity. In Proc. of the Fourth Int'l Semantic Web Conference. Y. Gil et al. (Eds.): ISWC 2005, LNCS 3729, pp. 668-684, 2005.
  • 10
    • 51849143258 scopus 로고    scopus 로고
    • T. Berners-Lee, Notation 3. http://www.w3.org/DesignIssues/Notation3.html (1.998).
    • T. Berners-Lee, Notation 3. http://www.w3.org/DesignIssues/Notation3.html (1.998).
  • 11
    • 51849091572 scopus 로고    scopus 로고
    • http://di.g.csail.mi.t.edu/Rein


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