BDBComp
Parceria:
SBC
Efficient Decision Procedures for Query Containment and Related Problems

Tanara LauschnerMarco A. CasanovaVânia M. P. VidalJosé Antonio Fernandes de Macêdo

The subsumption problem in Description Logics (DL) refers to the question of deciding if a concept description always denotes a subset of the set denoted by another concept description. This paper explores reductions of query containment and other problems to the subsumption problem in DL. It first selects a DL dialect that is expressive enough to cover familiar classes of integrity constraints and query expressions. Then, it describes how to modify the tableau decision procedure for the subsumption problem to account for the classes of integrity constraints considered. Finally, it introduces a fast decision procedure for the subsumption problem for the dialect adopted.

http://www.lbd.dcc.ufmg.br:8080/colecoes/sbbd/2009/001.pdf

Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web

Biblioteca Digital Brasileira de Computação - Contato: bdbcomp@lbd.dcc.ufmg.br
     Mantida por:
LBD