標(biāo)題: Titlebook: Logic-Based Program Synthesis and Transformation; 16th International S Germán Puebla Conference proceedings 2007 Springer-Verlag Berlin Hei [打印本頁(yè)] 作者: cerebral 時(shí)間: 2025-3-21 18:30
書目名稱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é)科排名
作者: Somber 時(shí)間: 2025-3-21 23:50 作者: Thyroid-Gland 時(shí)間: 2025-3-22 03:23
José F. Morales,Manuel Carro,Manuel Hermenegildonterface hides all underlying Semantic Web technologies to data owners. Last, we show how to easily publish Linked Data on the Web as Triple Pattern Fragments. As a?result, participants, independently of their knowledge background, can model, annotate and publish data on their own.作者: heterodox 時(shí)間: 2025-3-22 05:58 作者: 歸功于 時(shí)間: 2025-3-22 11:31 作者: 迷住 時(shí)間: 2025-3-22 15:04
Josep Silvanterface hides all underlying Semantic Web technologies to data owners. Last, we show how to easily publish Linked Data on the Web as Triple Pattern Fragments. As a?result, participants, independently of their knowledge background, can model, annotate and publish data on their own.作者: Missile 時(shí)間: 2025-3-22 20:18
Bernd Brassel,Sebastian Fischer,Frank Huchtions. We consider different user error and revalidation rates (the latter measures the number of times that the same mapping is validated). Our results highlight complex trade-offs and point to the benefits of dynamically adjusting the revalidation rate.作者: 娘娘腔 時(shí)間: 2025-3-22 23:23
Peter Schneider-Kamp,Jürgen Giesl,Alexander Serebrenik,René Thiemann at the methodological and tooling levels for the generation of APIs based on ontology artefacts. Finally, the lines of future work present several challenges that need to be addressed so that the potential of KGs and ontologies can be more easily exploited by application developers.作者: outset 時(shí)間: 2025-3-23 01:21 作者: 掙扎 時(shí)間: 2025-3-23 09:03 作者: Sinus-Node 時(shí)間: 2025-3-23 10:06 作者: 中國(guó)紀(jì)念碑 時(shí)間: 2025-3-23 14:49
different resources. Often the result of this is to simply abandon the enquiry, significantly diminishing the value to be gained from existing knowledge. Within pharmaceutical companies, such concerns have led to majorprogrammes in data integration; downloading, parsing, mapping, transforming and p作者: Ganglion 時(shí)間: 2025-3-23 19:45 作者: 激怒某人 時(shí)間: 2025-3-24 01:41 作者: 低位的人或事 時(shí)間: 2025-3-24 05:27
Heiko Mantel,Henning Sudbrock,Tina Krau?erlution, streaming data and stream reasoning, event?processing, time-and space dependent models, contextual and local knowledge?representations with a?special emphasis on the evolvability and lo978-3-319-58693-9978-3-319-58694-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: VEN 時(shí)間: 2025-3-24 09:51 作者: SPALL 時(shí)間: 2025-3-24 12:54 作者: ULCER 時(shí)間: 2025-3-24 17:30
Polytool: Proving Termination Automatically Based on Polynomial Interpretationslytool is to extend the power of existing termination analysers by using well-founded orders based on polynomial interpretations. This is a direct extension of the well-founded orders based on (semi-)linear level mappings and norms that are used in most of the existing LP termination analysis systems.作者: 催眠 時(shí)間: 2025-3-24 21:38
978-3-540-71409-5Springer-Verlag Berlin Heidelberg 2007作者: orient 時(shí)間: 2025-3-25 02:26
Logic-Based Program Synthesis and Transformation978-3-540-71410-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: fulcrum 時(shí)間: 2025-3-25 04:45 作者: 輕率的你 時(shí)間: 2025-3-25 11:15
https://doi.org/10.1007/978-3-540-71410-1Debugging; algorithm; algorithms; computational logic; constraint programming; formal methods; functional 作者: CHANT 時(shí)間: 2025-3-25 12:49
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/l/image/588105.jpg作者: 虛弱的神經(jīng) 時(shí)間: 2025-3-25 18:39 作者: MOTTO 時(shí)間: 2025-3-25 20:15
Supervising Offline Partial Evaluation of Logic Programs Using Online Techniquesb interface, which highlights problematic annotations directly in the source code. A method to automatically fix incorrect annotations is presented, allowing the approach to be also used as a pragmatic binding time analysis. Finally we show how our method can be used for efficiently locating errors with built-ins inside Prolog source code.作者: 不出名 時(shí)間: 2025-3-26 00:56
: Automatic Rule Minerthe rules..Furthermore, we show that our approach performs well on various examples, e.g. generation of firewall rules or generation of rule-based constraint solvers. Thus, it is suitable for users from different fields.作者: CLASH 時(shí)間: 2025-3-26 05:03 作者: capillaries 時(shí)間: 2025-3-26 10:08 作者: 洞穴 時(shí)間: 2025-3-26 12:50
On the Automated Synthesis of Proof-Carrying Temporal Reference Monitorsogic for security policies, which is the past-time fragment of LTL, and (2) a synthesis algorithm generating reference monitor code and accompanying proof objects from formulae of the specification logic. To evaluate the feasibility of our approach, we developed a prototype implementation producing proofs in Isabelle/HOL.作者: Nonthreatening 時(shí)間: 2025-3-26 19:56
A Comparative Study of Algorithmic Debugging Strategies on the number and the complexity of these questions. In this work we overview and compare current strategies for algorithmic debugging and we introduce some new strategies and discuss their advantages over previous approaches.作者: inferno 時(shí)間: 2025-3-26 23:05 作者: Incompetent 時(shí)間: 2025-3-27 05:03
Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operatory. We also describe a technique to reduce the explosion of rules caused by the unfolding process. The analyser that we have implemented is able to solve most of the non-terminating examples in the Termination Problem Data Base.作者: 嫻熟 時(shí)間: 2025-3-27 08:05 作者: 使更活躍 時(shí)間: 2025-3-27 12:23 作者: 兩棲動(dòng)物 時(shí)間: 2025-3-27 14:45
Synthesis of Asynchronous Systemsms is possible for certain architectures (like pipelines and rings), we show that the synthesis of asynchronous distributed systems is decidable if and only if at most one process implementation is unknown.作者: 搖擺 時(shí)間: 2025-3-27 18:08 作者: Gum-Disease 時(shí)間: 2025-3-27 23:57
Gustavo Arroyo,J. Guadalupe Ramos,Josep Silva,Germán Vidaland made available to end-users. If not reviewed regularly, the quality of these annotations tends to decrease over time due to the evolution of the domain ontologies. The quality of these annotations is critical for tools that exploit them (e.g., search engines and decision support systems) and nee作者: 混亂生活 時(shí)間: 2025-3-28 03:33 作者: glamor 時(shí)間: 2025-3-28 09:18
Heiko Mantel,Henning Sudbrock,Tina Krau?erce on Knowledge Engineering and Knowledge Management, EKAW 2016, in November 2016 in Bologna, Italy: The Second International Workshop on Educational Knowledge Management, EKM 2016, and the First Workshop: Detection, Representation and Management of Concept Drift in Linked Open Data, Drift-an-LOD 20作者: 新娘 時(shí)間: 2025-3-28 12:37 作者: 品嘗你的人 時(shí)間: 2025-3-28 16:31 作者: 懸崖 時(shí)間: 2025-3-28 19:18 作者: Mangle 時(shí)間: 2025-3-28 22:55
Bernd Brassel,Sebastian Fischer,Frank Huchngs found by automatic methods, with the following advantages over having a single user: the effort required from each user is reduced, user errors are corrected, and consensus is reached. We propose strategies that dynamically determine the order in which the candidate mappings are presented to the作者: 軍火 時(shí)間: 2025-3-29 05:11
Peter Schneider-Kamp,Jürgen Giesl,Alexander Serebrenik,René Thiemannng and generating Application Programming Interfaces (APIs) to allow developers to consume KG data in a developer-friendly way. To fill this gap, this work proposes a method for API generation based on the artefacts generated during the ontology development process. This method is described as part 作者: epinephrine 時(shí)間: 2025-3-29 09:09 作者: 大看臺(tái) 時(shí)間: 2025-3-29 13:14 作者: Arrhythmia 時(shí)間: 2025-3-29 16:45
Roberto Bagnara,Katy Dobson,Patricia M. Hill,Matthew Mundell,Enea Zaffanellation. In previous works, we envisaged an intelligent system able to inspect health records and identify people in need of special assistance, by reasoning on the evolution of conditions over time. Unfortunately, there is a lack of resources regarding health condition evolution and recovery time. How作者: SPALL 時(shí)間: 2025-3-29 23:24
h less time, transforming the way researchers work [1]. Yet, for those seeking to develop new drugs to treat human disease, the task of assembling a coherent picture of existing knowledge from molecular biology to clinical investigation, can be daunting and frustrating. Individual electronic resourc作者: 語(yǔ)源學(xué) 時(shí)間: 2025-3-30 02:54 作者: 表示問(wèn) 時(shí)間: 2025-3-30 07:38 作者: Ambulatory 時(shí)間: 2025-3-30 10:02 作者: Simulate 時(shí)間: 2025-3-30 12:39
Constructing Consensus Logic Programsowing two problems: given two programs .. and .., which have the sets of answer sets . and ., respectively; (i) find a program . which has the answer sets as the minimal elements of .; (ii) find a program . which has the answer sets as the maximal elements of the above set. A program . satisfying (i作者: ineluctable 時(shí)間: 2025-3-30 17:51
Supervising Offline Partial Evaluation of Logic Programs Using Online Techniquestic programs. Existing automatic binding-time analyses still only have limited applicability and annotations often have to be created or improved and maintained by hand, leading to errors. We present a technique to help overcome this problem by using online control techniques which supervise the spe作者: 懶惰人民 時(shí)間: 2025-3-30 23:56 作者: HUMP 時(shí)間: 2025-3-31 03:32
Towards Description and Optimization of Abstract Machines in an Extension of Prolog optimize, and, especially, maintain and extend. This is partly due to the fact that efficiency considerations make it necessary to use low-level languages in their implementation. Writing the abstract machine (and ancillary code) in a higher-level language can help harness this inherent complexity.
