메뉴 건너뛰기




Volumn 2, Issue 1, 2006, Pages 1-41

A defeasible logic reasoner for the semantic web

Author keywords

Defeasible logic; RDF; Reasoning; Rule markup language; Rules; Semantic brokering

Indexed keywords

COMPUTER CIRCUITS; COMPUTER PROGRAMMING LANGUAGES; MARKUP LANGUAGES; METADATA; WEB CRAWLER;

EID: 33750256251     PISSN: 15526283     EISSN: 15526291     Source Type: Journal    
DOI: 10.4018/jswis.2006010101     Document Type: Article
Times cited : (79)

References (46)
  • 9
    • 0033876868 scopus 로고    scopus 로고
    • Defeasible logic versus logic programming without negation as failure
    • Antoniou, G., Maher, M. J., & Billington, D. (2000a). Defeasible logic versus logic programming without negation as failure. Journal of Logic Programming, 42(1), 45-57.
    • (2000) Journal of Logic Programming, 42 , Issue.1 , pp. 45-57
    • Antoniou, G.1    Maher, M.J.2    Billington, D.3
  • 10
    • 0033876868 scopus 로고    scopus 로고
    • Defeasible logic versus logic programming without negation as failure
    • Antoniou, G., Maher, M. J., & Billington, D. (2000b). Defeasible logic versus logic programming without negation as failure. Journal of Logic Programming, 41(1), 45-57.
    • (2000) Journal of Logic Programming, 41 , Issue.1 , pp. 45-57
    • Antoniou, G.1    Maher, M.J.2    Billington, D.3
  • 15
    • 0034268585 scopus 로고    scopus 로고
    • E DEVICE: An extensible active knowledge base system with multiple rule type support
    • Bassiliades, N., Vlahavas, I., & Elmagarmid, A.K. (2000). E DEVICE: An extensible active knowledge base system with multiple rule type support. IEEE TKDE, 12(5), 824-844.
    • (2000) IEEE TKDE, 12 , Issue.5 , pp. 824-844
    • Bassiliades, N.1    Vlahavas, I.2    Elmagarmid, A.K.3
  • 18
    • 24944469847 scopus 로고    scopus 로고
    • Sesame: An architecture for storing and querying RDF data and schema information
    • D. Fensel, J. A. Hendler, H. Lieberman, & W. Wahlster (Eds.), MIT Press
    • Broekstra, J., Kampman, A., & van Harmelen, F. (2003). Sesame: An architecture for storing and querying RDF data and schema information. In D. Fensel, J. A. Hendler, H. Lieberman, & W. Wahlster (Eds.), Spinning the Semantic Web (pp. 197-222). MIT Press.
    • (2003) Spinning the Semantic Web , pp. 197-222
    • Broekstra, J.1    Kampman, A.2    Van Harmelen, F.3
  • 19
    • 85036793709 scopus 로고    scopus 로고
    • Retrieved from, (v. 6.23)
    • CLIPS Basic Programming Guide (v. 6.23) (2005). Retrieved from www.ghg.net/clips/CLIPS.html.
    • (2005) CLIPS Basic Programming Guide
  • 23
    • 71149116148 scopus 로고
    • The well-founded semantics for general logic programs
    • van Gelder, A., Ross, K., & Schlipf, J. (1991). The well-founded semantics for general logic programs. Journal of the ACM, 38, 620-650.
    • (1991) Journal of the ACM, 38 , pp. 620-650
    • Van Gelder, A.1    Ross, K.2    Schlipf, J.3
  • 25
    • 0442330459 scopus 로고    scopus 로고
    • SweetDeal: Representing agent contracts with exceptions using XML rules, ontologies, and process descriptions
    • ACM Press
    • Grosof, B. N., & Poon, T. C. (2003). SweetDeal: Representing agent contracts with exceptions using XML rules, ontologies, and process descriptions. Proc. 12th Int. Conf. on World Wide Web (pp. 340-349). ACM Press.
    • (2003) Proc. 12th Int. Conf. on World Wide Web , pp. 340-349
    • Grosof, B.N.1    Poon, T.C.2
  • 29
    • 7944220884 scopus 로고    scopus 로고
    • Retrieved from
    • Hayes, P. (2004). RDF Semantics. W3C Recommendation. Retrieved from www.w3c.org/TR/rdf-mt/.
    • (2004) RDF Semantics
    • Hayes, P.1
  • 32
    • 0032156942 scopus 로고    scopus 로고
    • Combining Horn rules and description logics in CARIN
    • Levy, A., & Rousset, M.-C. (1998). Combining Horn rules and description logics in CARIN. Artificial Intelligence, 104(1-2), 165-209.
    • (1998) Artificial Intelligence, 104 , Issue.1-2 , pp. 165-209
    • Levy, A.1    Rousset, M.-C.2
  • 34
    • 85008541130 scopus 로고    scopus 로고
    • Propositional defeasible logic has linear complexity
    • Maher, M. J. (2001). Propositional defeasible logic has linear complexity. Logic Programming Theory and Practice, 1(6), 691-711.
    • (2001) Logic Programming Theory and Practice, 1 , Issue.6 , pp. 691-711
    • Maher, M.J.1
  • 35
    • 0032596676 scopus 로고    scopus 로고
    • A semantic decomposition of defeasible logics
    • Maher, M. J., & Governatori, G. (1999). A semantic decomposition of defeasible logics. Proc. AAAI'99 (pp. 299-305).
    • (1999) Proc. AAAI'99 , pp. 299-305
    • Maher, M.J.1    Governatori, G.2
  • 44
    • 85167868807 scopus 로고
    • A clash of intuitions: The current state of nonmonotonic inheritance systems
    • Morgan Kaufmann
    • Touretzky, D.D., Horty, J.F., & Thomason, R.H. (1987). A clash of intuitions: The current state of nonmonotonic inheritance systems. Proc. IJCAI-87 (pp. 476- 482). Morgan Kaufmann.
    • (1987) Proc. IJCAI-87 , pp. 476-482
    • Touretzky, D.D.1    Horty, J.F.2    Thomason, R.H.3
  • 46
    • 84944313005 scopus 로고    scopus 로고
    • (n.d.), Retrieved from
    • Xalan-Java XSLT processor (n.d.). Retrieved from xml.apache.org/xalan-j/.
    • Xalan-Java XSLT Processor


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