BDBComp
Parceria:
SBC
On Graph Refutation for Relational Inclusions

Paulo A. S. VelosoSheila R. M. Veloso

We introduce a graphical refutation calculus for relational inclusions: it reduces establishing a relational inclusion to establishing that a graph constructed from it has empty extension. This sound and complete calculus is conceptually simpler and easier to use than the usual ones.

http://www.lbd.dcc.ufmg.br/colecoes/lsfa/2011/004.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