메뉴 건너뛰기




Volumn 3323 LNCS, Issue , 2004, Pages 113-127

Semantic web reasoning with conceptual logic programs

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET PROGRAMMING; LOGIC PROGRAMS; NEGATION AS FAILURES; ONTOLOGIES AND RULES; ONTOLOGY LANGUAGE; REASONERS; SET PROGRAMMING;

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

References (31)
  • 1
    • 77249156931 scopus 로고    scopus 로고
    • The Rule Markup Initiative
    • The Rule Markup Initiative. http://www.ruleml.org.
  • 3
    • 0001129020 scopus 로고    scopus 로고
    • Modal languages and bounded fragments of predicate logic
    • H. Andréka, I. Németi, and J. Van Benthem. Modal languages and bounded fragments of predicate logic. J. of Philosophical Logic, 27(3):217-274, 1998.
    • (1998) J. of Philosophical Logic , vol.27 , Issue.3 , pp. 217-274
    • Andréka, H.1    Németi, I.2    Van Benthem, J.3
  • 6
    • 26944461438 scopus 로고    scopus 로고
    • A Strong Correspondence between DLs and Open Logic Programming
    • K.Van Belleghem, M. Denecker, and D. De Schreye. A Strong Correspondence between DLs and Open Logic Programming. In Proc. of ICLP'97, pages 346-360, 1997.
    • (1997) Proc. of ICLP'97 , pp. 346-360
    • Van Belleghem, K.1    Denecker, M.2    De Schreye, D.3
  • 7
    • 0242339596 scopus 로고    scopus 로고
    • An Entailment Relation for Reasoning on the Web
    • Proc. of Rules and Rule Markup Languages for the Semantic Web, Springer
    • F. Bry and S. Schaffert. An Entailment Relation for Reasoning on the Web. In Proc. of Rules and Rule Markup Languages for the Semantic Web, LNCS, pages 17-34. Springer, 2003.
    • (2003) LNCS , pp. 17-34
    • Bry, F.1    Schaffert, S.2
  • 9
    • 78650230253 scopus 로고    scopus 로고
    • Description Logics of Minimal Knowledge and Negation as Failure
    • F. M. Donini, D. Nardi, and R. Rosati. Description Logics of Minimal Knowledge and Negation as Failure. ACM Trans. Comput. Logic, 3(2):177-225, 2002.
    • (2002) ACM Trans. Comput. Logic , vol.3 , Issue.2 , pp. 177-225
    • Donini, F.M.1    Nardi, D.2    Rosati, R.3
  • 10
    • 77249122278 scopus 로고    scopus 로고
    • Combining Answer Set Programming with DLs for the Semantic Web
    • T. Eiter, T. Lukasiewicz, R. Schindlauer, and H. Tompits. Combining Answer Set Programming with DLs for the Semantic Web. In Proc. of KR 2004, pages 141-151, 2004.
    • (2004) Proc. of KR , pp. 141-151
    • Eiter, T.1    Lukasiewicz, T.2    Schindlauer, R.3    Tompits, H.4
  • 11
    • 0001119421 scopus 로고
    • The Stable Model Semantics for Logic Programming
    • Cambridge, Massachusetts, MIT Press
    • M. Gelfond and V. Lifschitz. The Stable Model Semantics for Logic Programming. In Proc. of ICLP'88, pages 1070-1080, Cambridge, Massachusetts, 1988. MIT Press.
    • (1988) Proc. of ICLP'88 , pp. 1070-1080
    • Gelfond, M.1    Lifschitz, V.2
  • 13
    • 84880493386 scopus 로고    scopus 로고
    • Description Logic Programs: Combining Logic Programs with Description Logic
    • B. N. Grosof, I. Horrocks, R. Volz, and S. Decker. Description Logic Programs: Combining Logic Programs with Description Logic. In Proc. of WWW 2003, pages 48-57, 2003.
    • (2003) Proc. of WWW , pp. 48-57
    • Grosof, B.N.1    Horrocks, I.2    Volz, R.3    Decker, S.4
  • 14
    • 60349095998 scopus 로고    scopus 로고
    • Decidable Open Answer Set Programming
    • Technical report, Vrije Universiteit Brussel, Dept. of Computer Science
    • S. Heymans, D. Van Nieuwenborgh, and D. Vermeir. Decidable Open Answer Set Programming. Technical report, Vrije Universiteit Brussel, Dept. of Computer Science, 2004.
    • (2004)
    • Heymans, S.1    Van Nieuwenborgh, D.2    Vermeir, D.3
  • 15
    • 0346265000 scopus 로고    scopus 로고
    • Integrating Description Logics and Answer Set Programming
    • Proc. of PPSWR 2003, number in, Springer
    • S. Heymans and D. Vermeir. Integrating Description Logics and Answer Set Programming. In Proc. of PPSWR 2003, number 2901 in LNCS, pages 146-159. Springer, 2003.
    • (2003) LNCS , vol.2901 , pp. 146-159
    • Heymans, S.1    Vermeir, D.2
  • 16
    • 84942808798 scopus 로고    scopus 로고
    • Integrating Ontology Languages and Answer set Programming
    • IEEE Computer Society
    • S. Heymans and D. Vermeir. Integrating Ontology Languages and Answer set Programming. In Proc. of WebS'03, pages 584-588. IEEE Computer Society, 2003.
    • (2003) Proc. of WebS'03 , pp. 584-588
    • Heymans, S.1    Vermeir, D.2
  • 18
    • 84880874673 scopus 로고    scopus 로고
    • Ontology Reasoning in the SHOQ(D) Description Logic
    • Morgan Kaufmann
    • I. Horrocks and U. Sattler. Ontology Reasoning in the SHOQ(D) Description Logic. In Proc. of IJCAI'01, pages 199-204. Morgan Kaufmann, 2001.
    • (2001) Proc. of IJCAI'01 , pp. 199-204
    • Horrocks, I.1    Sattler, U.2
  • 20
    • 77249156451 scopus 로고    scopus 로고
    • - Description Logic to Disjunctive Datalog Programs. FZI-Report 1-8-11/03, Forschungszentrum Informatik (FZI), 2003.
    • - Description Logic to Disjunctive Datalog Programs. FZI-Report 1-8-11/03, Forschungszentrum Informatik (FZI), 2003.
  • 21
    • 77249129894 scopus 로고    scopus 로고
    • N. Leone, W. Faber, and G. Pfeifer. DLV homepage. http://www.dbai.tuwien. ac.at/proj/dlv/.
    • N. Leone, W. Faber, and G. Pfeifer. DLV homepage. http://www.dbai.tuwien. ac.at/proj/dlv/.
  • 22
    • 0344243483 scopus 로고    scopus 로고
    • V. Lifschitz. Answer Set Programming and Plan Generation. AI, 138(1-2):39-54, 2002.
    • V. Lifschitz. Answer Set Programming and Plan Generation. AI, 138(1-2):39-54, 2002.
  • 23
    • 18744389241 scopus 로고    scopus 로고
    • Optimizing Query Answering in Description Logics using disjunctive deductive databases
    • B. Motik, R. Volz, and A. Maedche. Optimizing Query Answering in Description Logics using disjunctive deductive databases. In Proc. of KRDB'03, pages 39-50, 2003.
    • (2003) Proc. of KRDB'03 , pp. 39-50
    • Motik, B.1    Volz, R.2    Maedche, A.3
  • 24
    • 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. of DL'99, pages 160-164, 1999.
    • (1999) Proc. of DL'99 , pp. 160-164
    • Rosati, R.1
  • 26
    • 0026107613 scopus 로고
    • Attributive Concept Descriptions with Complements
    • M. Schmidt-Schaub and G. Smolka. Attributive Concept Descriptions with Complements. Artif. Intell., 48(1):1-26, 1991.
    • (1991) Artif. Intell , vol.48 , Issue.1 , pp. 1-26
    • Schmidt-Schaub, M.1    Smolka, G.2
  • 27
    • 84879932756 scopus 로고    scopus 로고
    • home
    • P. Simons. Smodels homepage. http://www.tcs.hut.fi/Software/smodels/.
    • Smodels
    • Simons, P.1
  • 28
    • 9644264057 scopus 로고    scopus 로고
    • Deduction in Ontologies via Answer Set Programming
    • Vladimir Lifschitz and Ilkka Niemelä, editors, LPNMR, of, Springer
    • T. Swift. Deduction in Ontologies via Answer Set Programming. In Vladimir Lifschitz and Ilkka Niemelä, editors, LPNMR, volume 2923 of LNCS, pages 275-288. Springer, 2004.
    • (2004) LNCS , vol.2923 , pp. 275-288
    • Swift, T.1
  • 30
    • 77249130373 scopus 로고    scopus 로고
    • M. Y. Vardi. Why is Modal Logic so Robustly Decidable? Technical report, 1997.
    • M. Y. Vardi. Why is Modal Logic so Robustly Decidable? Technical report, 1997.
  • 31
    • 84878592842 scopus 로고    scopus 로고
    • Reasoning about the Past with Two-Way Automata
    • Springer
    • M. Y. Vardi. Reasoning about the Past with Two-Way Automata. In Proc. of ICALP '98, pages 628-641. Springer, 1998.
    • (1998) Proc. of ICALP '98 , pp. 628-641
    • Vardi, M.Y.1


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