4 resultados para rough set theory

em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo


Relevância:

80.00% 80.00%

Publicador:

Resumo:

We consider the question whether there exists a Banach space X of density continuum such that every Banach space of density at most continuum isomorphically embeds into X (called a universal Banach space of density c). It is well known that a""(a)/c (0) is such a space if we assume the continuum hypothesis. Some additional set-theoretic assumption is indeed needed, as we prove in the main result of this paper that it is consistent with the usual axioms of set-theory that there is no universal Banach space of density c. Thus, the problem of the existence of a universal Banach space of density c is undecidable using the usual axioms of set-theory. We also prove that it is consistent that there are universal Banach spaces of density c, but a""(a)/c (0) is not among them. This relies on the proof of the consistency of the nonexistence of an isomorphic embedding of C([0, c]) into a""(a)/c (0).

Relevância:

80.00% 80.00%

Publicador:

Resumo:

PO artigo demonstra as interações entre algumas bases de dados internacionais na disponibilização de periódicos da área de Ciência da Informação. Para isso, foram investigadas seis bases de dados com acesso a texto completo dentro da área de Ciência da Informação. Foram elas: Web of Science, Scopus, Library, Information Science & Technology Abstracts, Information Science & Technology Abstracts, Library Literature Information Science – full text e Library Information Science Abstract. No desenvolvimento da pesquisa foram utilizados conceitos, princípios e equações da ‘teoria ingênua dos conjuntos’, o que permitiu observar as bases de dados como conjuntos compostos por elementos, aqui considerados os títulos de periódicos, bem como conferir consistência aos resultados. A análise dos dados foi dividida em três etapas, a saber: a) a primeira priorizou o cruzamento entre as duas maiores bases de dados utilizadas para levantamento bibliográfico (Web of Science e Scopus), seguido do cruzamento com a mais utilizada na Ciência da Informação, a Library and Information Science Abstracts; b) a segunda etapa tratou somente do cruzamento das bases especialistas da área; c) a terceira e última etapa tratou da interseção de todas as bases de dados do estudo. O resultado mostra que 10 títulos de periódicos constituem a interseção dos seis conjuntos de bases de dados. Foi possível identificar, também, o número de periódicos disponibilizados exclusivamente por uma base de dados, demonstrando que as necessidades de pesquisas bibliográficas exaustivas passam, obrigatoriamente, pelo levantamento em todas as bases de dados aqui elencadas.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Reasoning and change over inconsistent knowledge bases (KBs) is of utmost relevance in areas like medicine and law. Argumentation may bring the possibility to cope with both problems. Firstly, by constructing an argumentation framework (AF) from the inconsistent KB, we can decide whether to accept or reject a certain claim through the interplay among arguments and counterarguments. Secondly, by handling dynamics of arguments of the AF, we might deal with the dynamics of knowledge of the underlying inconsistent KB. Dynamics of arguments has recently attracted attention and although some approaches have been proposed, a full axiomatization within the theory of belief revision was still missing. A revision arises when we want the argumentation semantics to accept an argument. Argument Theory Change (ATC) encloses the revision operators that modify the AF by analyzing dialectical trees-arguments as nodes and attacks as edges-as the adopted argumentation semantics. In this article, we present a simple approach to ATC based on propositional KBs. This allows to manage change of inconsistent KBs by relying upon classical belief revision, although contrary to it, consistency restoration of the KB is avoided. Subsequently, a set of rationality postulates adapted to argumentation is given, and finally, the proposed model of change is related to the postulates through the corresponding representation theorem. Though we focus on propositional logic, the results can be easily extended to more expressive formalisms such as first-order logic and description logics, to handle evolution of ontologies.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

This work evaluates the efficiency of economic levels of theory for the prediction of (3)J(HH) spin-spin coupling constants, to be used when robust electronic structure methods are prohibitive. To that purpose, DFT methods like mPW1PW91. B3LYP and PBEPBE were used to obtain coupling constants for a test set whose coupling constants are well known. Satisfactory results were obtained in most of cases, with the mPW1PW91/6-31G(d,p)//B3LYP/6-31G(d,p) leading the set. In a second step. B3LYP was replaced by the semiempirical methods PM6 and RM1 in the geometry optimizations. Coupling constants calculated with these latter structures were at least as good as the ones obtained by pure DFT methods. This is a promising result, because some of the main objectives of computational chemistry - low computational cost and time, allied to high performance and precision - were attained together. (C) 2012 Elsevier B.V. All rights reserved.