標(biāo)題: Titlebook: Logic-Based Program Synthesis and Transformation; 18th International S Michael Hanus Conference proceedings 2009 Springer-Verlag Berlin Hei [打印本頁(yè)] 作者: Sediment 時(shí)間: 2025-3-21 17:32
書(shū)目名稱Logic-Based Program Synthesis and Transformation影響因子(影響力)
書(shū)目名稱Logic-Based Program Synthesis and Transformation影響因子(影響力)學(xué)科排名
書(shū)目名稱Logic-Based Program Synthesis and Transformation網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Logic-Based Program Synthesis and Transformation網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Logic-Based Program Synthesis and Transformation被引頻次
書(shū)目名稱Logic-Based Program Synthesis and Transformation被引頻次學(xué)科排名
書(shū)目名稱Logic-Based Program Synthesis and Transformation年度引用
書(shū)目名稱Logic-Based Program Synthesis and Transformation年度引用學(xué)科排名
書(shū)目名稱Logic-Based Program Synthesis and Transformation讀者反饋
書(shū)目名稱Logic-Based Program Synthesis and Transformation讀者反饋學(xué)科排名
作者: Mitigate 時(shí)間: 2025-3-21 21:36 作者: Bombast 時(shí)間: 2025-3-22 00:58 作者: 裂隙 時(shí)間: 2025-3-22 08:32
From Monomorphic to Polymorphic Well-Typings and Beyond, requirement that all calls to a predicate have types that are instances of a unique polymorphic type but instead allowing multiple polymorphic typings for the same predicate, we obtain a novel strongly-connected-component-based analysis that provides a good compromise between accuracy and computational cost.作者: Annotate 時(shí)間: 2025-3-22 09:15 作者: 扔掉掐死你 時(shí)間: 2025-3-22 13:24 作者: FUME 時(shí)間: 2025-3-22 21:06
Test Data Generation of Bytecode by CLP Partial Evaluation,ique feature of our approach is that, this second PE phase allows generating not only test-cases but also test-case .. To the best of our knowledge, this is the first time that (CLP) PE techniques are applied for test-case generation as well as to generate test-case generators.作者: 節(jié)省 時(shí)間: 2025-3-23 00:32
A Modular Equational Generalization Algorithm,based languages, theorem provers and program manipulation tools such as partial evaluators, test case generators, and machine learning techniques, where function symbols obey algebraic axioms. A Web tool which implements the algorithm has been developed which is publicly available.作者: 感情 時(shí)間: 2025-3-23 04:43 作者: 人類學(xué)家 時(shí)間: 2025-3-23 08:51 作者: tendinitis 時(shí)間: 2025-3-23 13:11
Space Invading Systems Code, having roots in separation logic, Invader draws on the fundamental work of Sagiv et. al. on shape analysis [12]. It is complementary to other tools - e.g., SLAM [1], Blast [8], ASTRéE [6] - that use abstract interpretation for verification, but that use coarse or limited models of the heap.作者: Accommodation 時(shí)間: 2025-3-23 16:14
The MEB and CEB Static Analysis for CSP Specifications,e executed before it in some execution. Our technique is based on a new data structure which extends the . (SCFG). We show that this new data structure improves the SCFG by taking into account the context in which processes are called and, thus, makes the slicing process more precise.作者: Moderate 時(shí)間: 2025-3-23 20:48 作者: 黑豹 時(shí)間: 2025-3-23 23:23
Conference proceedings 2009nsformation, LOPSTR 2008, held in Valencia, Spain, during July 17-18, 2008. The 11 revised full papers presented together with one invited talk were carefully reviewed and selected for inclusion in the book. LOPSTR traditionally solicits papers in the areas of specification, synthesis, verification,作者: Incise 時(shí)間: 2025-3-24 06:10 作者: FIS 時(shí)間: 2025-3-24 09:55 作者: Middle-Ear 時(shí)間: 2025-3-24 14:02
978-3-642-00514-5Springer-Verlag Berlin Heidelberg 2009作者: BARB 時(shí)間: 2025-3-24 16:12 作者: Afflict 時(shí)間: 2025-3-24 22:38 作者: originality 時(shí)間: 2025-3-25 01:21
Space Invading Systems Code,n logic assertions [10,11] to describe states, and works by performing a proof search, using abstract interpretation to enable convergence. As well as having roots in separation logic, Invader draws on the fundamental work of Sagiv et. al. on shape analysis [12]. It is complementary to other tools -作者: 有機(jī)體 時(shí)間: 2025-3-25 03:46 作者: accrete 時(shí)間: 2025-3-25 08:58
A Modular Equational Generalization Algorithm,d identity axioms (including the empty set). This is suitable for dealing with functions that obey algebraic laws, and are typically mechanized by means of equational atributes in rule-based languages such as ASF+SDF, Elan, OBJ, Cafe-OBJ, and Maude. The algorithm computes a complete set of least gen作者: Antagonist 時(shí)間: 2025-3-25 12:57
A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs,For this purpose, we first introduce an improved defunctionalization algorithm that transforms higher-order functions into first-order ones, so that existing techniques for termination analysis and propagation of binding-times of first-order programs can be applied. Then, we define another transform作者: osteopath 時(shí)間: 2025-3-25 19:46
Analysis of Linear Hybrid Systems in CLP,accurate analysis and verification of LHAs can then be performed using generic CLP analysis and transformation tools. LHAs provide an expressive notation for specifying real-time systems. The main contributions are (i) a technique for capturing the reachable states of the continuously changing state作者: 招人嫉妒 時(shí)間: 2025-3-25 21:19
Automatic Generation of Test Inputs for Mercury,reason about program executions as paths in a control-flow graph. Next, we define how such a path corresponds to a set of constraints whose solution defines input values for the predicate under test such that when the predicate is called with respect to these input values, the execution is guarantee作者: amnesia 時(shí)間: 2025-3-26 00:14 作者: Narcissist 時(shí)間: 2025-3-26 06:45
The MEB and CEB Static Analysis for CSP Specifications,echnique allows us to know what parts of the specification must necessarily be executed before this event, and what parts of the specification could be executed before it in some execution. Our technique is based on a new data structure which extends the . (SCFG). We show that this new data structur作者: 座右銘 時(shí)間: 2025-3-26 08:39
Fast Offline Partial Evaluation of Large Logic Programs,lassical BTA for offline partial evaluation of logic programs. In contrast to previous approaches, the new BTA is conceptually simpler and considerably faster, scaling to medium-sized or even large examples and, moreover, it ensures both the so called local and global termination. We also show that 作者: indignant 時(shí)間: 2025-3-26 14:29 作者: 原來(lái) 時(shí)間: 2025-3-26 17:06 作者: oracle 時(shí)間: 2025-3-26 22:16
On Negative Unfolding in the Answer Set Semantics,ng in terms of nested expressions by Lifschitz et al., and regard it as a combination of the replacement of a literal by its definition (called “pre-negative unfolding”) and double negation elimination. We give sufficient conditions for preserving the answer set semantics. We then consider a framewo作者: CRUDE 時(shí)間: 2025-3-27 02:37 作者: 譏笑 時(shí)間: 2025-3-27 07:12
Cristiano Calcagno,Dino Distefano,Peter O’Hearn,Hongseok Yangr, instance construction is very time-consuming and laborious, and it is a big challenge for natural language processing (NLP) tasks in many fields. For example, the instances of the question matching dataset CHIP in the medical field are only 2.7% of the general field dataset LCQMC, and its perform作者: 我邪惡 時(shí)間: 2025-3-27 09:37
Elvira Albert,Miguel Gómez-Zamalloa,Germán Pueblah. At present, there is a lack of research content for Chinese and Korean bilingualism in the field of knowledge graphs. At the same time, mainstream entity alignment methods are susceptible to the impact of data set size and graph structure heterogeneity. This paper proposes a cross-language entity作者: MELD 時(shí)間: 2025-3-27 16:22
María Alpuente,Santiago Escobar,José Meseguer,Pedro Ojedacient in practice, current research focuses on designing parallel reasoning algorithms or employing high-performance computing architectures, like neural networks. No matter what architecture we choose, the computational complexity of reasoning is upper-bounded by the .-completeness or higher ones t作者: Presbyopia 時(shí)間: 2025-3-27 20:13
Gustavo Arroyo,J. Guadalupe Ramos,Salvador Tamarit,Germán Vidalcient in practice, current research focuses on designing parallel reasoning algorithms or employing high-performance computing architectures, like neural networks. No matter what architecture we choose, the computational complexity of reasoning is upper-bounded by the .-completeness or higher ones t作者: 不可救藥 時(shí)間: 2025-3-28 01:02
Gourinath Banda,John P. Gallagherhe document level. Studies have shown that the Transformer architecture models long-distance dependencies without regard to the syntax-level dependencies between tokens in the sequence, which hinders its ability to model long-range dependencies. Furthermore, the global information among relational t作者: Bumptious 時(shí)間: 2025-3-28 04:58 作者: Pedagogy 時(shí)間: 2025-3-28 07:58
Emanuel KitzelmannLP). Most of existing relation extraction models use convolutional or recurrent neural network and fail to capture the in-depth semantic features from the entities. These models also only focus on the training data and ignore external knowledge. In this paper, we propose a relation extraction model 作者: Panacea 時(shí)間: 2025-3-28 13:39 作者: 下船 時(shí)間: 2025-3-28 18:37 作者: Intentional 時(shí)間: 2025-3-28 22:32 作者: crease 時(shí)間: 2025-3-29 02:27
Tom Schrijvers,Maurice Bruynooghe,John P. Gallagheresentation and reasoning of personal relation. Aiming at low accuracy in extracting triples from unstructured text, we present a supervised approach to judge whether extracted triples are correct. The approach need to build a knowledge base which contain peoples attributes first, then a sentence pat作者: Hdl348 時(shí)間: 2025-3-29 03:47 作者: maintenance 時(shí)間: 2025-3-29 10:39 作者: 拍翅 時(shí)間: 2025-3-29 14:05 作者: 攝取 時(shí)間: 2025-3-29 17:52
which builds an informative heterogeneous graph for every document to collect various linking clues. Then HEGEL utilizes a novel heterogeneous graph neural network (HGNN) to integrate the different types of information and model the interactions among them. Experiments on the standard benchmark dat作者: GENRE 時(shí)間: 2025-3-29 22:33 作者: forecast 時(shí)間: 2025-3-30 00:03 作者: Presbycusis 時(shí)間: 2025-3-30 05:11
María Alpuente,Santiago Escobar,José Meseguer,Pedro Ojedahe tool of . to obtain all the theoretical results given in this paper. One can utilize our results to check the parallel tractability of a given knowledge graph. Further, the Boolean circuits proposed in this paper can also be used to construct neural networks to perform knowledge graph reasoning.作者: 舊石器時(shí)代 時(shí)間: 2025-3-30 11:59 作者: 違反 時(shí)間: 2025-3-30 14:43
Gourinath Banda,John P. Gallagherive learning with fusion knowledge captures global information among relational triples. Gaussian probability distributions are also designed to capture local information around entities. Our experiments on two document-level relation extraction datasets, CDR and GDA, have remarkable results.
