標(biāo)題: Titlebook: Datalog Reloaded; First International Oege Moor,Georg Gottlob,Andrew Sellers Conference proceedings 2011 Springer-Verlag GmbH Berlin Heide [打印本頁(yè)] 作者: 他剪短 時(shí)間: 2025-3-21 18:40
書目名稱Datalog Reloaded影響因子(影響力)
書目名稱Datalog Reloaded影響因子(影響力)學(xué)科排名
書目名稱Datalog Reloaded網(wǎng)絡(luò)公開度
書目名稱Datalog Reloaded網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Datalog Reloaded被引頻次
書目名稱Datalog Reloaded被引頻次學(xué)科排名
書目名稱Datalog Reloaded年度引用
書目名稱Datalog Reloaded年度引用學(xué)科排名
書目名稱Datalog Reloaded讀者反饋
書目名稱Datalog Reloaded讀者反饋學(xué)科排名
作者: COST 時(shí)間: 2025-3-21 20:40
Datalog for Security, Privacy and Trustn of many security models and policy languages. Recently, Description Logics (DLs for short) have been adopted as policy languages, too. In this paper we carry out a comparison of Datalog and Description Logics as policy languages, based both on expressiveness analysis and on an assessment of the cu作者: 旁觀者 時(shí)間: 2025-3-22 01:30 作者: 彎曲的人 時(shí)間: 2025-3-22 06:44 作者: Benign 時(shí)間: 2025-3-22 12:16 作者: AIL 時(shí)間: 2025-3-22 16:14 作者: AIL 時(shí)間: 2025-3-22 17:34 作者: AVID 時(shí)間: 2025-3-22 22:02
Cluster Computing, Recursion and Datalogte queries and other operations on very large-scale data. Datalog execution presents several unusual issues for this enviroment. We discuss the best way to execute a round of seminaive evaluation on a computing cluster using the map-reduce. Using transitive closure as an example, we examine the cost作者: 神圣不可 時(shí)間: 2025-3-23 02:55
Datalog-Related Aspects in Lixto Visual Developerpporting complex navigation and extraction tasks on highly dynamic Web applications. Internally, created extraction rules are reflected in a declarative extraction language called Elog, which relies on a datalog syntax and semantics. It is ideally suited for representing and successively incrementin作者: Polydipsia 時(shí)間: 2025-3-23 05:37
Informing Datalog through Language Intelligence – A Personal Perspectiveavailable to computers in text form on web repositories remains in fact decipherable only by humans. In this position paper, we present our views on the reasons for this failure, and we argue that for bringing computers closer to becoming true extensions of the human brain, we need to endow them wit作者: Carcinoma 時(shí)間: 2025-3-23 11:24 作者: dapper 時(shí)間: 2025-3-23 17:28 作者: Minuet 時(shí)間: 2025-3-23 19:20
Using Datalog for Fast and Easy Program Analysis the first implementation to express full end-to-end context-sensitive analyses in Datalog. This includes key elements such as call-graph construction as well as the logic dealing with various semantic complexities of the Java language (native methods, reflection, threading, etc.)..The findings from作者: CYT 時(shí)間: 2025-3-24 01:25
Distributed Datalog Revisitedthey manipulate has many facets: personal data (e.g., pictures, movies, music, contacts, emails), social data (e.g., annotations, recommendations, contacts), localization information (e.g., bookmarks), access information (e.g., login, keys), web services (e.g., legacy data, search engines), access r作者: 火花 時(shí)間: 2025-3-24 02:51
: Datalog in Time and Spaceed systems proved difficult to model in Datalog. First, the state of any such system evolves with its execution. Second, deductions in these systems may be arbitrarily delayed, dropped, or reordered by the unreliable network links they must traverse. Previous efforts addressed the former by extendin作者: 斷斷續(xù)續(xù) 時(shí)間: 2025-3-24 07:22
The Disjunctive Datalog System DLVth many expressive constructs, including aggregates, strong and weak constraints, functions, lists, and sets. The system provides database connectivity offering a simple way for powerful reasoning on top of relational databases. In this paper, we provide an ample overview of the . system. We illustr作者: osculate 時(shí)間: 2025-3-24 13:02 作者: 低三下四之人 時(shí)間: 2025-3-24 14:50 作者: ASSAY 時(shí)間: 2025-3-24 20:01 作者: CHASM 時(shí)間: 2025-3-25 00:43
Zur Pathologie der Kreislaufcorrelationener than . for a 1-call-site sensitive analysis, with lower but still substantial speedups for other important analyses. Additionally, . scales to very precise analyses that are impossible with prior frameworks, directly addressing open problems in past literature. Finally, our implementation is modu作者: 后來(lái) 時(shí)間: 2025-3-25 06:15
Liquid Water: Theory & Experimente revisit datalog with this goal in mind. The focus of the presentation is on the formal extension of the model of distributed datalog and does not consider the implementation or the evaluation of the corresponding system [8].作者: 展覽 時(shí)間: 2025-3-25 08:59
Sava Milo?evi?,Djordje Spasojevi?for programming and reasoning about distributed systems. . reduces to a subset of Datalog with negation, aggregate functions, successor and choice, and adds an explicit notion of logical time to the language. We show that . provides a declarative foundation for the two signature features of distribu作者: 美麗的寫 時(shí)間: 2025-3-25 14:58
Ariadna Strugielska,Teresa Siek-Piskozub for data exchange systems. More precisely, we introduce the syntax and semantics of .., we present some of the fundamental results about this language shown in [5], and we extend those results to the case of data exchange settings that allow for constraints in the target schema. All of these result作者: 挑剔小責(zé) 時(shí)間: 2025-3-25 15:52 作者: Abrade 時(shí)間: 2025-3-25 21:27
Exploiting Bounded Treewidth with Datalog (A Survey)uctures is expressible in MSO then this property can also be expressed by means of a monadic datalog program. Moreover, the resulting fragment of datalog can be evaluated in linear time (both with respect to the program size and with respect to the data size). In this survey, we present the main ide作者: 增強(qiáng) 時(shí)間: 2025-3-26 02:34 作者: blight 時(shí)間: 2025-3-26 08:00 作者: CRUE 時(shí)間: 2025-3-26 11:13
: Datalog in Time and Spacefor programming and reasoning about distributed systems. . reduces to a subset of Datalog with negation, aggregate functions, successor and choice, and adds an explicit notion of logical time to the language. We show that . provides a declarative foundation for the two signature features of distribu作者: nurture 時(shí)間: 2025-3-26 15:50
Datalog as a Query Language for Data Exchange Systems for data exchange systems. More precisely, we introduce the syntax and semantics of .., we present some of the fundamental results about this language shown in [5], and we extend those results to the case of data exchange settings that allow for constraints in the target schema. All of these result作者: ingrate 時(shí)間: 2025-3-26 17:31
Datalog Relaunched: Simulation Unification and Value Inventionordered trees in contrast to the .-complete unordered tree inclusion problem..RDFLog is Datalog with arbitrary quantifier alternation: Blank nodes, i.e., existentially quantified variables, in rule heads may be governed by universally quantified variables, universally quantified variables by blank n作者: 協(xié)奏曲 時(shí)間: 2025-3-26 21:08
Datalog Reloaded978-3-642-24206-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 來(lái)這真柔軟 時(shí)間: 2025-3-27 02:44
Die physiologischen Wirkungen des Klimasg, as mechanisms for characterizing intensional (output) predicates in terms of extensional (input) predicates. Our approach to the semantics of ASP programs is based on the concept of a stable model defined in terms of a modification of parallel circumscription.作者: 消音器 時(shí)間: 2025-3-27 06:31
Atle M?rk,Ashton F. Embry,Wolfgang Weitschat programs into an implicit Boolean Equation System (.) that can then be solved by using linear-time complexity algorithms that are available in existing, general purpose verification toolboxes such as .. In order to improve scalability and to enable analyses involving advanced meta-programming featu作者: 針葉類的樹 時(shí)間: 2025-3-27 12:28 作者: 挑剔為人 時(shí)間: 2025-3-27 17:38 作者: 證實(shí) 時(shí)間: 2025-3-27 20:37 作者: 簡(jiǎn)略 時(shí)間: 2025-3-27 23:57 作者: 我怕被刺穿 時(shí)間: 2025-3-28 03:21
https://doi.org/10.1007/978-3-662-21731-3 for deriving such results is Courcelle’s Theorem, which states that all properties definable by Monadic Second Order (MSO) sentences are fixed-parameter tractable with respect to the treewidth. In principle, algorithms can be generated automatically from the MSO definition of a problem by exploitin作者: transplantation 時(shí)間: 2025-3-28 06:18 作者: MILL 時(shí)間: 2025-3-28 11:23 作者: Frequency 時(shí)間: 2025-3-28 15:01 作者: genuine 時(shí)間: 2025-3-28 20:02
L. Asher,H. Eppinger,W. Zielstorffavailable to computers in text form on web repositories remains in fact decipherable only by humans. In this position paper, we present our views on the reasons for this failure, and we argue that for bringing computers closer to becoming true extensions of the human brain, we need to endow them wit作者: 名義上 時(shí)間: 2025-3-29 01:04
Hormonale Einflüsse auf das Gef??systemmputation involves database-like queries and updates on complex views of the data. Specifically, recursive . look up and aggregate relevant or potentially relevant values. If the results of these queries are memoized for reuse, the memos may need to be . through change propagation. We propose a decl作者: violate 時(shí)間: 2025-3-29 06:47
Zur Pathologie der Kreislaufcorrelationening research field. Context has often a significant impact on the way humans (or machines) act, and on how they interpret things; furthermore, a change in context causes a transformation in the experience that is going to be lived. Accordingly, while the computer science community has initially perc作者: Lipoprotein(A) 時(shí)間: 2025-3-29 09:24
Zur Pathologie der Kreislaufcorrelationen the first implementation to express full end-to-end context-sensitive analyses in Datalog. This includes key elements such as call-graph construction as well as the logic dealing with various semantic complexities of the Java language (native methods, reflection, threading, etc.)..The findings from作者: animated 時(shí)間: 2025-3-29 14:20
Liquid Water: Theory & Experimentthey manipulate has many facets: personal data (e.g., pictures, movies, music, contacts, emails), social data (e.g., annotations, recommendations, contacts), localization information (e.g., bookmarks), access information (e.g., login, keys), web services (e.g., legacy data, search engines), access r作者: 不可思議 時(shí)間: 2025-3-29 18:30 作者: 云狀 時(shí)間: 2025-3-29 19:57
F. Siringo,R. Pucci,G. G. N. Angilellath many expressive constructs, including aggregates, strong and weak constraints, functions, lists, and sets. The system provides database connectivity offering a simple way for powerful reasoning on top of relational databases. In this paper, we provide an ample overview of the . system. We illustr作者: 話 時(shí)間: 2025-3-30 00:34 作者: Fabric 時(shí)間: 2025-3-30 07:08
https://doi.org/10.1007/978-3-319-00161-6 unification” and “RDFLog”..Simulation unification is a non-standard unification inspired from regular path queries. Like standard unification, it yields bindings for variables in both terms to unify. Unlike standard unification, it does not try to make the two terms identical but instead to embed t作者: Preserve 時(shí)間: 2025-3-30 10:24 作者: LAVA 時(shí)間: 2025-3-30 15:51
Conference proceedings 2011ch 2010. The 22 revised full papers presented were carefully selected during two rounds of reviewing and improvements from numerous submissions. The papers showcase the state-of-the-art in theory and systems for datalog, divided in three sections: Properties, applications, and extensions of datalog.作者: 魯莽 時(shí)間: 2025-3-30 19:52 作者: 欲望小妹 時(shí)間: 2025-3-30 22:19 作者: ARM 時(shí)間: 2025-3-31 00:55
Oege Moor,Georg Gottlob,Andrew SellersUp-to-date results.Fast-track conference proceedings.State-of-the-art research作者: delegate 時(shí)間: 2025-3-31 07:22 作者: Tartar 時(shí)間: 2025-3-31 12:17
https://doi.org/10.1007/978-3-642-24206-9answer set programming; distributed systems; logic programming; query language; semantic Web作者: ectropion 時(shí)間: 2025-3-31 16:32
978-3-642-24205-2Springer-Verlag GmbH Berlin Heidelberg 2011作者: 長(zhǎng)矛 時(shí)間: 2025-3-31 19:49
Answer Set Modules for Logical Agentsmbination produce the overall agent behavior as an emergent behavior. In this paper, we outline a possible fruitful integration of ASP into many agent architectures, by introducing two kinds of modules: one that allows for complex reaction, the other one that allows for reasoning about necessity and possibility.作者: 欺騙世家 時(shí)間: 2025-4-1 00:36 作者: Embolic-Stroke 時(shí)間: 2025-4-1 03:55 作者: cloture 時(shí)間: 2025-4-1 10:00 作者: Omniscient 時(shí)間: 2025-4-1 14:04
Physiologie des Wasserhaushaltesform equivalence. Most notably, uniform equivalence becomes undecidable in the presence of default negation, while strong equivalence remains decidable for full disjunctive datalog. We also consider a restricted setting where the arity of predicates is bounded by a fixed constant.作者: Agronomy 時(shí)間: 2025-4-1 17:08
Physiologie der W?rmeregulationhe map-reduce framework is not supported for recursive programs. We discuss extensions to this framework that are suitable for executing recursive Datalog programs on very large-scale data in a way that allows progress to continue after node failures, without restarting the entire job.