메뉴 건너뛰기




Volumn 3323 LNCS, Issue , 2004, Pages 81-97

Well-founded semantics for description logic programs in the semantic web

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET SEMANTICS; COMPLEXITY RESULTS; DESCRIPTION LOGIC; DESCRIPTION LOGIC PROGRAMS; FINITE SET; KNOWLEDGE BASE; SEMANTIC PROPERTIES; WEB ONTOLOGY LANGUAGE; WELL FOUNDED SEMANTICS; ONTOLOGY LANGUAGE; PARTIAL MODELING;

EID: 77249173466     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30504-0_7     Document Type: Conference Paper
Times cited : (64)

References (35)
  • 1
    • 77249151863 scopus 로고    scopus 로고
    • G. Alsaç and C. Baral. Reasoning in description logics using declarative logic programming. Tech. report, Computer Science and Engineering Dept., Arizona State University, 2001.
    • G. Alsaç and C. Baral. Reasoning in description logics using declarative logic programming. Tech. report, Computer Science and Engineering Dept., Arizona State University, 2001.
  • 2
    • 84866249230 scopus 로고    scopus 로고
    • Nonmonotonic rule systems on top of ontology layers
    • Proc. ISWC-2002
    • G. Antoniou. Nonmonotonic rule systems on top of ontology layers. In Proc. ISWC-2002, LNCS 2342, pp. 394-398, 2002.
    • (2002) LNCS , vol.2342 , pp. 394-398
    • Antoniou, G.1
  • 3
    • 0242339590 scopus 로고    scopus 로고
    • Rules and defeasible reasoning on the Semantic Web
    • Proc. RuleML-2003
    • G. Antoniou and G. Wagner. Rules and defeasible reasoning on the Semantic Web. In Proc. RuleML-2003, LNCS 2876, pp. 111-120, 2003.
    • (2003) LNCS , vol.2876 , pp. 111-120
    • Antoniou, G.1    Wagner, G.2
  • 4
    • 0141780306 scopus 로고
    • Embedding defaults into terminological representation systems
    • F. Baader and B. Hollunder. Embedding defaults into terminological representation systems. J. Automated Reasoning, 14:149-180, 1995.
    • (1995) J. Automated Reasoning , vol.14 , pp. 149-180
    • Baader, F.1    Hollunder, B.2
  • 5
    • 34250083934 scopus 로고
    • Dualities between alternative semantics for logic programming and nonmonotonic reasoning
    • C. Baral and V. S. Subrahmanian. Dualities between alternative semantics for logic programming and nonmonotonic reasoning. J. Automated Reasoning, 10(3):399-420, 1993.
    • (1993) J. Automated Reasoning , vol.10 , Issue.3 , pp. 399-420
    • Baral, C.1    Subrahmanian, V.S.2
  • 8
    • 13244267910 scopus 로고    scopus 로고
    • Design rationale for RuleML: A markup language for Semantic Web rules
    • H. Boley, S. Tabet, and G. Wagner. Design rationale for RuleML: A markup language for Semantic Web rules. In Proc. SWWS-2001, pp. 381-401, 2001.
    • (2001) Proc. SWWS-2001 , pp. 381-401
    • Boley, H.1    Tabet, S.2    Wagner, G.3
  • 9
    • 33750037483 scopus 로고    scopus 로고
    • On the relationship between defeasible logic and well-founded semantics
    • Proc. LPNMR-2001
    • G. Brewka. On the relationship between defeasible logic and well-founded semantics. In Proc. LPNMR-2001, LNCS 2713, pp. 121-132, 2001.
    • (2001) LNCS , vol.2713 , pp. 121-132
    • Brewka, G.1
  • 10
    • 77249150598 scopus 로고    scopus 로고
    • Project
    • 4 Project, 2002. http://centria.di.fct.unl.pt/∼cd/projectos/w4/index.htm.
    • (2002) 4
    • Damásio, C.V.1
  • 11
  • 13
    • 77249084805 scopus 로고    scopus 로고
    • T. Eiter, T. Lukasiewicz, R. Schindlauer, and H. Tompits. Combining answer set programming with description logics for the Semantic Web. In Proc. KR-2004, pp. 141-151, 2004. Preliminary Report RR-1843-03-13, Institut für Informationssysteme, TU Wien, 2003.
    • T. Eiter, T. Lukasiewicz, R. Schindlauer, and H. Tompits. Combining answer set programming with description logics for the Semantic Web. In Proc. KR-2004, pp. 141-151, 2004. Preliminary Report RR-1843-03-13, Institut für Informationssysteme, TU Wien, 2003.
  • 15
    • 77951505493 scopus 로고
    • Classical negation in logic programs and deductive databases
    • M. Gelfond and V. Lifschitz. Classical negation in logic programs and deductive databases. New Generation Computing, 17:365-387, 1991.
    • (1991) New Generation Computing , vol.17 , pp. 365-387
    • Gelfond, M.1    Lifschitz, V.2
  • 16
    • 77249107216 scopus 로고    scopus 로고
    • B. N. Grosof. Courteous logic programs: Prioritized conflict handling for rules. IBM Research Report RC 20836, IBM Research Division, T.J. Watson Research, 1997.
    • B. N. Grosof. Courteous logic programs: Prioritized conflict handling for rules. IBM Research Report RC 20836, IBM Research Division, T.J. Watson Research, 1997.
  • 17
    • 84880493386 scopus 로고    scopus 로고
    • Description logic programs: Combining logic programs with description logics
    • B. N. Grosof, I. Horrocks, R. Volz, and S. Decker. Description logic programs: Combining logic programs with description logics. In Proc. WWW-2003, pp. 48-57, 2003.
    • (2003) Proc. WWW-2003 , pp. 48-57
    • Grosof, B.N.1    Horrocks, I.2    Volz, R.3    Decker, S.4
  • 18
    • 84867759223 scopus 로고    scopus 로고
    • RACER system description
    • Proc. IJCAR-2001
    • V. Haarslev and R. Möller. RACER system description. In Proc. IJCAR-2001, LNCS 2083, pp. 701-705, 2001.
    • (2001) LNCS , vol.2083 , pp. 701-705
    • Haarslev, V.1    Möller, R.2
  • 19
    • 0242371006 scopus 로고    scopus 로고
    • Reducing OWL entailment to description logic satisfiability
    • Proc. ISWC-2003
    • I. Horrocks and P. F. Patel-Schneider. Reducing OWL entailment to description logic satisfiability. In Proc. ISWC-2003, LNCS 2870, pp. 17-29, 2003.
    • (2003) LNCS , vol.2870 , pp. 17-29
    • Horrocks, I.1    Patel-Schneider, P.F.2
  • 22
    • 84886280180 scopus 로고    scopus 로고
    • Practical reasoning for expressive description logics
    • Proc. LPAR-1999
    • I. Horrocks, U. Sattler, and S. Tobies. Practical reasoning for expressive description logics. In Proc. LPAR-1999, LNCS 1705, pp. 161-180, 1999.
    • (1999) LNCS , vol.1705 , pp. 161-180
    • Horrocks, I.1    Sattler, U.2    Tobies, S.3
  • 24
    • 0032156942 scopus 로고    scopus 로고
    • Combining Horn rules and description logics in CARIN
    • A.Y. Levy and M.-C. Rousset. Combining Horn rules and description logics in CARIN. Artif. Intell., 104(1-2):165-209, 1998.
    • (1998) Artif. Intell , vol.104 , Issue.1-2 , pp. 165-209
    • Levy, A.Y.1    Rousset, M.-C.2
  • 25
    • 0032596676 scopus 로고    scopus 로고
    • A semantic decomposition of defeasible logics
    • M. J. Maher and G. Governatori. A semantic decomposition of defeasible logics. In Proc. AAAI/IAAI-1999, pp. 299-305, 1999.
    • (1999) Proc. AAAI/IAAI-1999 , pp. 299-305
    • Maher, M.J.1    Governatori, G.2
  • 26
    • 84948955115 scopus 로고    scopus 로고
    • Well-founded semantics for deductive object-oriented database languages
    • F. Bry, R. Ramakrishnan, and K. Ramamohanarao, editors, Proc. DOOD-1997
    • W. May, B. Ludäscher, and G. Lausen. Well-founded semantics for deductive object-oriented database languages. In F. Bry, R. Ramakrishnan, and K. Ramamohanarao, editors, Proc. DOOD-1997, LNCS 1341, pp. 320-336, 1997.
    • (1997) LNCS , vol.1341 , pp. 320-336
    • May, W.1    Ludäscher, B.2    Lausen, G.3
  • 28
    • 77249123499 scopus 로고    scopus 로고
    • XSB: A system for efficiently computing WFS
    • Proc. LPNMR-1997
    • P. Rao, K. Sagonas, T. Swift, D. S. Warren, and J. Freire. XSB: A system for efficiently computing WFS. In Proc. LPNMR-1997, LNCS 1265, pp. 430-440, 1997.
    • (1997) LNCS , vol.1265 , pp. 430-440
    • Rao, P.1    Sagonas, K.2    Swift, T.3    Warren, D.S.4    Freire, J.5
  • 29
    • 0003333139 scopus 로고    scopus 로고
    • Towards expressive KR systems integrating datalog and description logics: Preliminary report
    • R. Rosati. Towards expressive KR systems integrating datalog and description logics: Preliminary report. In Proc. DL-1999, pp. 160-164, 1999.
    • (1999) Proc. DL-1999 , pp. 160-164
    • Rosati, R.1
  • 30
    • 9644264057 scopus 로고    scopus 로고
    • Deduction in ontologies via ASP
    • Proc. LPNMR-2004
    • T. Swift. Deduction in ontologies via ASP. In Proc. LPNMR-2004, LNCS 2923, pp. 275-288, 2004.
    • (2004) LNCS , vol.2923 , pp. 275-288
    • Swift, T.1
  • 32
    • 26944461438 scopus 로고    scopus 로고
    • A strong correspondence between description logics and open logic programming
    • K. Van Belleghem, M. Denecker, and D. De Schreye. A strong correspondence between description logics and open logic programming. In Proc. ICLP-1997, pp. 346-360, 1997.
    • (1997) Proc. ICLP-1997 , pp. 346-360
    • Van Belleghem, K.1    Denecker, M.2    De Schreye, D.3
  • 33
    • 0042266501 scopus 로고
    • The alternating fixpoint of logic programs with negation
    • A.Van Gelder. The alternating fixpoint of logic programs with negation. In Proc. PODS-1989, pp. 1-10, 1989.
    • (1989) Proc. PODS-1989 , pp. 1-10
    • Van Gelder, A.1
  • 34
    • 71149116148 scopus 로고
    • The well-founded semantics for general logic programs
    • A. Van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620-650, 1991.
    • (1991) Journal of the ACM , vol.38 , Issue.3 , pp. 620-650
    • Van Gelder, A.1    Ross, K.A.2    Schlipf, J.S.3


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