標(biāo)題: Titlebook: Logic-Based Program Synthesis and Transformation; 20th International S María Alpuente Conference proceedings 2011 Springer Berlin Heidelber [打印本頁] 作者: ambulance 時間: 2025-3-21 17:02
書目名稱Logic-Based Program Synthesis and Transformation影響因子(影響力)
書目名稱Logic-Based Program Synthesis and Transformation影響因子(影響力)學(xué)科排名
書目名稱Logic-Based Program Synthesis and Transformation網(wǎng)絡(luò)公開度
書目名稱Logic-Based Program Synthesis and Transformation網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Logic-Based Program Synthesis and Transformation被引頻次
書目名稱Logic-Based Program Synthesis and Transformation被引頻次學(xué)科排名
書目名稱Logic-Based Program Synthesis and Transformation年度引用
書目名稱Logic-Based Program Synthesis and Transformation年度引用學(xué)科排名
書目名稱Logic-Based Program Synthesis and Transformation讀者反饋
書目名稱Logic-Based Program Synthesis and Transformation讀者反饋學(xué)科排名
作者: Notify 時間: 2025-3-21 23:14
Olivier Danvy,Ian Zernyhine learning, etc.—can be used to encode and extract knowledge. It covers techniques for the creation, enrichment, assessment, and refinement of knowledge graphs and surveys recent open and enterprise knowledge graphs and the industries or applications within which they have been most widely adopte作者: 陶瓷 時間: 2025-3-22 02:12
Johann Schumann,Karen Cate,Alan Lee access control. Finally, we show how Knowledge Graphs can power conversational agents in different points in the dialog system pipeline and the promising future of service annotations helping to build flexible systems decoupled from the web services with which they communicate.作者: instate 時間: 2025-3-22 05:17 作者: 舊病復(fù)發(fā) 時間: 2025-3-22 10:49
Mathieu Giorgino,Martin Strecker,Ralph Matthes,Marc Pantelery processing techniques provide a solution to scale up?to large volumes of data distributed across multiple data sources. Federated query processing techniques resort to source descriptions to identify relevant data sources for a query, as well as to find efficient execution plans that minimize th作者: Awning 時間: 2025-3-22 13:04 作者: 清晰 時間: 2025-3-22 18:35
Elvira Albert,Miguel Gómez-Zamalloa,José Miguel Rojas,Germán Puebla technique that relies on both the knowledge stated in RDF vocabularies and a context-based similarity metric to map contextually equivalent RDF graphs. COMET follows a two-fold approach to solve the problem of entity matching in RDF graphs in a context-aware manner. In the first step, COMET compute作者: 步履蹣跚 時間: 2025-3-23 00:39 作者: Override 時間: 2025-3-23 03:35
Dean Voets,Danny De Schreyeery processing techniques provide a solution to scale up?to large volumes of data distributed across multiple data sources. Federated query processing techniques resort to source descriptions to identify relevant data sources for a query, as well as to find efficient execution plans that minimize th作者: Inclement 時間: 2025-3-23 06:20
David Insa,Josep Silvaype to entities for which the type is known and assign the type of the most similar set of entities to the entity with the unknown type. We demonstrate our approach on seven different named entity linking datasets..To the best of our knowledge, our approach is the first to combine word embeddings wi作者: Minuet 時間: 2025-3-23 13:38 作者: 草率女 時間: 2025-3-23 17:20 作者: 臥虎藏龍 時間: 2025-3-23 20:38
Germán VidalSNET, and Hepatitis Knowledge Base, and are semantically integrated with 25% of the classified metadata using Normalized Pointwise Mutual Information under the Social Spider algorithm. The proposed MDSA-MQE methodology achieves the Precision of 90.12%, Recall of 93.87%, Accuracy of 92.08%, F-Measure作者: Oversee 時間: 2025-3-23 23:51
Giovanni Bacci,Marco Comini of named entities, their class, and their co-occurrence in the text to define lexical-syntactic patterns that support the extraction of axiomatic relations such as equivalence and disjointness between classes. The results demonstrate the usefulness of the strategy to produce new statements that enr作者: pacific 時間: 2025-3-24 03:49
Christophe Calvès,Maribel Fernándezhout injecting controlled class specific semantic information into the classification process..In our experimentation we have given many different kinds of syntactic and semantic information by tagging suitable words with relevant semantic/syntactic tags. We have also tried various embedding methods作者: amphibian 時間: 2025-3-24 09:17 作者: Ingredient 時間: 2025-3-24 13:41
Marisa Llorens,Javier Oliver,Josep Silva,Salvador Tamaritd Smart Data Analytics solutions...This book is addressed to graduate students from technical disciplines, to professional audiences following continuous education 978-3-030-53198-0978-3-030-53199-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: META 時間: 2025-3-24 16:32 作者: 做作 時間: 2025-3-24 20:14 作者: epicondylitis 時間: 2025-3-25 00:01 作者: Mast-Cell 時間: 2025-3-25 04:30 作者: 脆弱么 時間: 2025-3-25 08:56 作者: Tracheotomy 時間: 2025-3-25 12:26
The First-Order Nominal Link,We define a morphism from nominal syntax, which supports binding, to standard (first-order) syntax. We use this morphism to extend Paterson and Wegman’s linear first-order unification algorithm in order to deal with terms modulo alpha-equivalence. The nominal unification algorithm obtained is quadratic in time.作者: 歌唱隊 時間: 2025-3-25 16:04
https://doi.org/10.1007/978-3-642-20551-4Formal Methods; Partial Evaluation; Programming languages; Systems Modelling; Type Systems作者: jagged 時間: 2025-3-25 21:39
978-3-642-20550-7Springer Berlin Heidelberg 2011作者: emission 時間: 2025-3-26 02:18 作者: Malaise 時間: 2025-3-26 04:45
Conference proceedings 2011, LOPSTR 2010, held in Hagenberg, Austria in July 2010. The 13 revised full papers presented together with two invited papers were carefully reviewed and selected from 26 submissions. Among the topics covered are specification, synthesis, verification, analysis, optimization, specialization, securit作者: 脫毛 時間: 2025-3-26 08:51 作者: 使害怕 時間: 2025-3-26 14:48 作者: 生存環(huán)境 時間: 2025-3-26 16:59
Graph Generation to Statically Represent CSP Processes,needed by many CSP analyses. We also introduce an algorithm able to automatically generate this data structure from a CSP specification. The algorithm has been proved correct and its implementation for the CSP’s animator ProB is publicly available.作者: ARY 時間: 2025-3-27 00:02 作者: jungle 時間: 2025-3-27 05:06 作者: 身心疲憊 時間: 2025-3-27 07:59
Non-termination Analysis of Logic Programs Using Types,hnique by integrating type information in the analysis and by applying non-failure analysis and program specialization. It turns out that there are several classes of programs for which existing non-termination analyzers fail and for which our extended technique succeeds in proving non-termination.作者: 難聽的聲音 時間: 2025-3-27 11:41 作者: NAG 時間: 2025-3-27 14:18 作者: 溫和女孩 時間: 2025-3-27 20:42 作者: coltish 時間: 2025-3-27 22:53
,Verification of the Schorr-Waite Algorithm – From Trees to Graphs,n the result. Our imperative specifications use monadic constructs and syntax sugar, making them close to common imperative languages. This work has been realized within the Isabelle/HOL proof assistant.作者: 通知 時間: 2025-3-28 03:59 作者: 財政 時間: 2025-3-28 09:23 作者: Pelvic-Floor 時間: 2025-3-28 12:15 作者: 傲慢人 時間: 2025-3-28 14:35 作者: CHANT 時間: 2025-3-28 18:43 作者: LAIR 時間: 2025-3-29 00:27 作者: callous 時間: 2025-3-29 06:40 作者: 縱欲 時間: 2025-3-29 09:24 作者: 嚙齒動物 時間: 2025-3-29 13:37
Marisa Llorens,Javier Oliver,Josep Silva,Salvador Tamaritocessing chain.This open access book is part of the LAMBDA Project (Learning, Applying, Multiplying Big Data Analytics), funded by the European Union, GA No. 809965. Data Analytics involves applying algorithmic processes to derive insights. Nowadays it is used in many industries to allow organizatio作者: STRIA 時間: 2025-3-29 16:55
Mathieu Giorgino,Martin Strecker,Ralph Matthes,Marc Pantelry research. Semantic web technologies have also experienced great progress, and scientific communities and practitioners have contributed to the problem of big data management with ontological models, controlled vocabularies, linked datasets, data models, query languages, as well as tools for trans作者: 馬具 時間: 2025-3-29 23:08 作者: Nonflammable 時間: 2025-3-30 02:40 作者: 戲服 時間: 2025-3-30 06:41 作者: barium-study 時間: 2025-3-30 08:33 作者: 連詞 時間: 2025-3-30 14:59
David Insa,Josep Silva text. This allows semantic querying over a dataset, for example selecting all politicians or football players. However, traditional named entity recognition systems only distinguish a limited number of entity types (such as Person, Organisation and Location) and entity linking has the limitation th作者: 不利 時間: 2025-3-30 19:53 作者: 細頸瓶 時間: 2025-3-30 23:18 作者: 諷刺 時間: 2025-3-31 04:42
Germán Vidalser query should include more relevant terms and therefore, query expansion technique is required in the medical domain for their Information Retrieval Systems. In this paper, a metadata driven semantically aware medical query expansion methodology is proposed. The proposed approach takes a query as
