Prova de Conceito WD - K4 - Líderes dos Países

K4. Qual é a posição do principal líder administrativo no <país ?v1> e quem foram estes lideres?

K4a -> ?p1 (?v1, ?pred1, ?v2). ?p2 (?v1, ?pred2, ?v3).

Filtro dos predicados ( ( ?pred1 = "P35" and ?pred2 = "P1906" ) OR ( ?pred1 = "P6" and ?pred2 = "P1313" ) )

P1313   'office held by head of government'@en
P1906   'office held by head of state'@en
P35       'head of state'@en
P6          'head of government'@en

Consulta incompleta uma vez que as relações de interesse possuem contexto Temporal

Álgebra Temporal no Contra Domínio dos qualificadores: encontrar interseção dos intervalos de tempo nos pares de alegações recuperados com a consulta.

SE ?px, P580, ?vx. NOT EXISTS (?px, P582, ?vy.) ENTÃO ?px é Corrente

SE ?p1, P580, ?v4. ?p1, P582, ?v5. ?p2, P580, ?v6. ?p1, P580, ?v7. AND ((v4 <= v7) and (v5 >= v6)) ENTÃO (?p1, Temporal Overlaps, ?p2)

Casos França, Canada e Israel

Comentários

Postagens mais visitadas deste blog

Aula 12: WordNet | Introdução à Linguagem de Programação Python *** com NLTK

Fonte -> https://youtu.be/0OCq31jQ9E4 A WordNet do Brasil -> http://www.nilc.icmc.usp.br/wordnetbr/ NLTK synsets = dada uma palavra acha todos os significados, pode informar a língua e a classe gramatical da palavra (substantivo, verbo, advérbio) from nltk.corpus import wordnet as wn wordnet.synset(xxxxxx).definition() = descrição do significado É possível extrair hipernimia, hiponimia, antonimos e os lemas (diferentes palavras/expressões com o mesmo significado) formando uma REDE LEXICAL. Com isso é possível calcular a distância entre 2 synset dentro do grafo. Veja trecho de código abaixo: texto = 'útil' print('NOUN:', wordnet.synsets(texto, lang='por', pos=wordnet.NOUN)) texto = 'útil' print('ADJ:', wordnet.synsets(texto, lang='por', pos=wordnet.ADJ)) print(wordnet.synset('handy.s.01').definition()) texto = 'computador' for synset in wn.synsets(texto, lang='por', pos=wn.NOUN): print('DEF:',s

truth makers AND truth bearers - Palestra Giancarlo no SBBD

Dando uma googada https://iep.utm.edu/truth/ There are two commonly accepted constraints on truth and falsehood: Every proposition is true or false. [Law of the Excluded Middle.] No proposition is both true and false. [Law of Non-contradiction.] What is the difference between a truth-maker and a truth bearer? Truth-bearers are either true or false; truth-makers are not since, not being representations, they cannot be said to be true, nor can they be said to be false . That's a second difference. Truth-bearers are 'bipolar,' either true or false; truth-makers are 'unipolar': all of them obtain. What are considered truth bearers? A variety of truth bearers are considered – statements, beliefs, claims, assumptions, hypotheses, propositions, sentences, and utterances . When I speak of a fact . . . I mean the kind of thing that makes a proposition true or false. (Russell, 1972, p. 36.) “Truthmaker theories” hold that in order for any truthbe

DGL-KE : Deep Graph Library (DGL)

Fonte: https://towardsdatascience.com/introduction-to-knowledge-graph-embedding-with-dgl-ke-77ace6fb60ef Amazon recently launched DGL-KE, a software package that simplifies this process with simple command-line scripts. With DGL-KE , users can generate embeddings for very large graphs 2–5x faster than competing techniques. DGL-KE provides users the flexibility to select models used to generate embeddings and optimize performance by configuring hardware, data sampling parameters, and the loss function. To use this package effectively, however, it is important to understand how embeddings work and the optimizations available to compute them. This two-part blog series is designed to provide this information and get you ready to start taking advantage of DGL-KE . Finally, another class of graphs that is especially important for knowledge graphs are multigraphs . These are graphs that can have multiple (directed) edges between the same pair of nodes and can also contain loops. The

Pesquisa de Doutorado da Veronica

Pesquisar este blog