The Semantic Web - ISWC 2019 (eBook, PDF)

18th International Semantic Web Conference, Auckland, New Zealand, October 26-30, 2019, Proceedings, Part I
Redaktion: Ghidini, Chiara; Gandon, Fabien; Lefrançois, Maxime; Song, Jie; Hogan, Aidan; Cruz, Isabel; Svátek, Vojtech; Maleshkova, Maria; Hartig, Olaf

• Format: PDF

Produktbeschreibung

The two-volume set of LNCS 11778 and 11779 constitutes the refereed proceedings of the 18th International Semantic Web Conference, ISWC 2019, held in Auckland, New Zealand, in October 2019. The ISWC conference is the premier international forum for the Semantic Web / Linked Data Community.

The total of 74 full papers included in this volume was selected from 283 submissions. The conference is organized in three tracks: for the Research Track 42 full papers were selected from 194 submissions; the Resource Track contains 21 full papers, selected from 64 submissions; and the In-Use Track features 11 full papers which were selected from 25 submissions to this track.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer Nature Switzerland
• Seitenzahl: 754
• Erscheinungstermin: 17. Oktober 2019
• Englisch
• ISBN-13: 9783030307936
• Artikelnr.: 57924317

Inhaltsangabe

Research Track.- Decentralized Indexing over a Network of RDF Peers.- Datalog Materialisation in Distributed RDF Stores with Dynamic Data Exchange.- How to make latent factors interpretable by feeding Factorization machines with knowledge graphs.- Observing LOD using Equivalent Set Graphs: it is mostly flat and sparsely linked.- Optimizing Horn-SHIQ Reasoning for OBDA.- Using a KG-Copy Network for Non-Goal Oriented Dialogues.- Canonicalizing Knowledge Base Literals.- Bag Semantics of DL-Lite with Functionality Axioms.- Validating SHACL constraints over a SPARQL endpoint.- Mapping Factoid Adjective Constraints to Existential Restrictions over Knowledge Bases.- Mining Significant Maximum Cardinalities in Knowledge Bases.- HapPenIng: Happen, Predict, Infer - Event Series Completion in a Knowledge Graph.- Uncovering the Semantics of Wikipedia Categories.- Qsearch: Answering Quantity Queries from Text.- A Worst-Case Optimal Join Algorithm for SPARQL.- Knowledge Graph Consolidationby Unifying Synonymous Relationships.- Skyline Queries over Knowledge Graphs.- Detecting Influences of Ontology Design Patterns in Biomedical Ontologies.- Popularity-driven Ontology Ranking using Qualitative Features.- Incorporating Literals into Knowledge Graph Embeddings.- Extracting Novel Facts from Tables for Knowledge Graph Completion.- Difficulty-controllable Multi-hop Question Generation From Knowledge Graphs.- Type Checking Program Code using SHACL.- Decentralized Reasoning on a Network of Aligned Ontologies with Link Keys.- Ontology Completion Using Graph Convolutional Networks.- Non-Parametric Class Completeness Estimators for Collaborative Knowledge Graphs - The Case of Wikidata.- Pretrained Transformers for Simple Question Answering over Knowledge Graphs.- Learning to Rank Query Graphs for Complex Question Answering over Knowledge Graphs.- THOTH: Neural Translation and Enrichment of Knowledge Graphs.- Entity Enabled Relation Linking.- SHACL Constraints with Inference Rules.- Query-Based Entity Comparison in Knowledge Graphs Revisited.- Anytime Large-Scale Analytics of Linked Open Data.- Absorption-Based Query Answering for Expressive Description Logics.- TransEdge: Translating Relation-contextualized Embeddings for Knowledge Graphs.- Unsupervised Discovery of Corroborative Paths for Fact Validation.- RDF Explorer: A Visual SPARQL Query Builder.- Capturing Semantic and Syntactic Information for Link Prediction in Knowledge Graphs.- A Framework for Evaluating Snippet Generation for Dataset Search.- Summarizing News Articles using Question-and-Answer Pairs via Learning.- Product Classification Using Microdata Annotations.- Truthful Mechanisms for Multi Agent Self-Interested Correspondence Selection.