메뉴 건너뛰기




Volumn , Issue , 2007, Pages 477-482

A faithful integration of description logics with logic programming

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMPLEXITY; DESCRIPTION LOGIC; KNOWLEDGE BASIS; NEGATION AS FAILURES; REASONING ALGORITHMS; SEAMLESS INTEGRATION;

EID: 84880854013     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (142)

References (16)
  • 1
    • 0141780306 scopus 로고
    • Embedding Defaults into Terminological Knowledge Representation Formalisms
    • F. Baader and B. Hollunder. Embedding Defaults into Terminological Knowledge Representation Formalisms. Journal of Automated Reasoning, 14(1):149-180, 1995.
    • (1995) Journal of Automated Reasoning , vol.14 , Issue.1 , pp. 149-180
    • Baader, F.1    Hollunder, B.2
  • 3
    • 79959719638 scopus 로고    scopus 로고
    • Description Logics with Circumscription
    • Lake District, UK
    • P. Bonatti, C. Lutz, and F. Wolter. Description Logics with Circumscription. In Proc. KR 2006, pages 400-410, Lake District, UK, 2006.
    • (2006) Proc. KR 2006 , pp. 400-410
    • Bonatti, P.1    Lutz, C.2    Wolter, F.3
  • 4
    • 84860600484 scopus 로고    scopus 로고
    • Data Complexity of Query Answering in Description Logics
    • Lake District, UK
    • D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Data Complexity of Query Answering in Description Logics. In Proc. KR 2006, pages 260-270, Lake District, UK, 2006.
    • (2006) Proc. KR 2006 , pp. 260-270
    • Calvanese, D.1    De Giacomo, G.2    Lembo, D.3    Lenzerini, M.4    Rosati, R.5
  • 5
    • 0038062314 scopus 로고    scopus 로고
    • Complexity and expressive power of logic programming
    • E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov. Complexity and expressive power of logic programming. ACM Computing Surveys, 33(3):374-425, 2001. (Pubitemid 33768487)
    • (2001) ACM Computing Surveys , vol.33 , Issue.3 , pp. 374-425
    • Dantsin, E.1    Eiter, T.2    Gottlob, G.3    Voronkov, A.4
  • 6
  • 7
    • 21244452853 scopus 로고    scopus 로고
    • Combining Answer Set Programming with Description Logics for the Semantic Web
    • Whistler, Canada
    • T. Eiter, T. Lukasiewicz, R. Schindlauer, and H. Tompits. Combining Answer Set Programming with Description Logics for the Semantic Web. In Proc. KR 2004, pages 141-151,Whistler, Canada, 2004.
    • (2004) Proc. KR 2004 , pp. 141-151
    • Eiter, T.1    Lukasiewicz, T.2    Schindlauer, R.3    Tompits, H.4
  • 8
    • 0003631434 scopus 로고    scopus 로고
    • First-Order Logic and Automated Theorem Proving
    • 2nd Edition
    • M. Fitting. First-Order Logic and Automated Theorem Proving, 2nd Edition. Texts in Computer Science. Springer, 1996.
    • (1996) Texts in Computer ScienceSpringer
    • Fitting, M.1
  • 9
    • 0029271767 scopus 로고
    • NP Trees and Carnap's Modal Logic
    • G. Gottlob. NP Trees and Carnap's Modal Logic. Journal of the ACM, 42(2):421-457, 1995.
    • (1995) Journal of the ACM , vol.42 , Issue.2 , pp. 421-457
    • Gottlob, G.1
  • 10
    • 84880733253 scopus 로고    scopus 로고
    • Data Complexity of Reasoning in Very Expressive Description Logics
    • Edinburgh, UK
    • U. Hustadt, B. Motik, and U. Sattler. Data Complexity of Reasoning in Very Expressive Description Logics. In Proc. IJCAI 2005, pages 466-471, Edinburgh, UK, 2005.
    • (2005) Proc. IJCAI 2005 , pp. 466-471
    • Hustadt, U.1    Motik, B.2    Sattler, U.3
  • 11
    • 0043159198 scopus 로고
    • Nonmonotonic Databases and Epistemic Queries
    • Sydney, Australia
    • V. Lifschitz. Nonmonotonic Databases and Epistemic Queries. In Proc. IJCAI '91, pages 381-386, Sydney, Australia, 1991.
    • (1991) Proc. IJCAI '91 , pp. 381-386
    • Lifschitz, V.1
  • 13
    • 21244502056 scopus 로고    scopus 로고
    • Query answering for OWL-DL with rules
    • DOI 10.1016/j.websem.2005.05.001, PII S157082680500003X, Rules Systems
    • B. Motik, U. Sattler, and R. Studer. Query Answering for OWL-DL with rules. Journal of Web Semantics, 3(1):41-60, 2005. (Pubitemid 40891658)
    • (2005) Web Semantics , vol.3 , Issue.1 , pp. 41-60
    • Motik, B.1    Sattler, U.2    Studer, R.3
  • 14
    • 44049112934 scopus 로고
    • What Should a Database Know?
    • R. Reiter. What Should a Database Know? Journal of Logic Programming, 14(1-2):127-153, 1992.
    • (1992) Journal of Logic Programming , vol.14 , Issue.1-2 , pp. 127-153
    • Reiter, R.1
  • 15
    • 0347749399 scopus 로고    scopus 로고
    • Reasoning about Minimal Belief and Negation as Failure
    • R. Rosati. Reasoning about Minimal Belief and Negation as Failure. Journal of Artificial Intelligence Research, 11:277-300, 1999. (Pubitemid 129628766)
    • (1999) Journal of Artificial Intelligence Research , vol.11 , pp. 277-300
    • Rosati, R.1
  • 16
    • 84860600786 scopus 로고    scopus 로고
    • DL + log: A Tight Integration of Description Logics and Disjunctive Datalog
    • Lake District, UK
    • R. Rosati. DL + log : A Tight Integration of Description Logics and Disjunctive Datalog. In Proc. KR 2006, pages 68-78, Lake District, UK, 2006.
    • (2006) Proc. KR 2006 , pp. 68-78
    • Rosati, R.1


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