메뉴 건너뛰기




Volumn 5021 LNCS, Issue , 2008, Pages 215-229

Finite model reasoning in DL-Lite

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL LINGUISTICS; DATA DESCRIPTION; DIFFRACTIVE OPTICAL ELEMENTS; FORMAL LOGIC; FUZZY LOGIC; INFORMATION THEORY; LINGUISTICS; ONTOLOGY; QUERY LANGUAGES; REAL TIME SYSTEMS; SEMANTIC WEB; WORLD WIDE WEB;

EID: 45749149143     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68234-9_18     Document Type: Conference Paper
Times cited : (35)

References (12)
  • 1
    • 45749155101 scopus 로고    scopus 로고
    • QuOnto web site, http://www.dis.uniroma1.it/∼quonto
    • QuOnto web site
  • 2
    • 0003727420 scopus 로고    scopus 로고
    • Baader, F, Calvanese, D, McGuinness, D, Nardi, D, Patel-Schneider, P.F, eds, Cambridge University Press, Cambridge
    • Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, Cambridge (2003)
    • (2003) The Description Logic Handbook: Theory, Implementation and Applications
  • 4
    • 0002281056 scopus 로고    scopus 로고
    • Finite model reasoning in description logics
    • Calvanese, D.: Finite model reasoning in description logics. In: Proc. of KR 1996, pp. 292-303 (1996)
    • (1996) Proc. of KR , pp. 292-303
    • Calvanese, D.1
  • 6
    • 34548305118 scopus 로고    scopus 로고
    • Tractable reasoning and efficient query answering in Description Logics: The DL-Lite family
    • Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in Description Logics: The DL-Lite family. J. of Automated Reasoning 39, 385-429 (2007)
    • (2007) J. of Automated Reasoning , vol.39 , pp. 385-429
    • Calvanese, D.1    De Giacomo, G.2    Lembo, D.3    Lenzerini, M.4    Rosati, R.5
  • 7
    • 0025230046 scopus 로고
    • Polynomial-time implication problems for unary inclusion dependencies
    • Cosmadakis, S.S., Kanellakis, P.C., Vardi, M.: Polynomial-time implication problems for unary inclusion dependencies. J. of the ACM 37(1), 15-46 (1990)
    • (1990) J. of the ACM , vol.37 , Issue.1 , pp. 15-46
    • Cosmadakis, S.S.1    Kanellakis, P.C.2    Vardi, M.3
  • 10
    • 20144384411 scopus 로고    scopus 로고
    • The complexity of finite model reasoning in description logics
    • Lutz, C., Sattler, U., Tendera, L.: The complexity of finite model reasoning in description logics. Information and Computation 199, 132-171 (2005)
    • (2005) Information and Computation , vol.199 , pp. 132-171
    • Lutz, C.1    Sattler, U.2    Tendera, L.3
  • 11
    • 34250652540 scopus 로고    scopus 로고
    • On the decidability and finite controllability of query processing in databases with incomplete information
    • Rosati, R.: On the decidability and finite controllability of query processing in databases with incomplete information. In: Proc. of PODS 2006, pp. 356-365 (2006)
    • (2006) Proc. of PODS 2006 , pp. 356-365
    • Rosati, R.1


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