標(biāo)題: Titlebook: Web Reasoning and Rule Systems; Second International Diego Calvanese,Georg Lausen Conference proceedings 2008 Springer-Verlag Berlin Heidel [打印本頁] 作者: onychomycosis 時間: 2025-3-21 18:36
書目名稱Web Reasoning and Rule Systems影響因子(影響力)
書目名稱Web Reasoning and Rule Systems影響因子(影響力)學(xué)科排名
書目名稱Web Reasoning and Rule Systems網(wǎng)絡(luò)公開度
書目名稱Web Reasoning and Rule Systems網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Web Reasoning and Rule Systems被引頻次
書目名稱Web Reasoning and Rule Systems被引頻次學(xué)科排名
書目名稱Web Reasoning and Rule Systems年度引用
書目名稱Web Reasoning and Rule Systems年度引用學(xué)科排名
書目名稱Web Reasoning and Rule Systems讀者反饋
書目名稱Web Reasoning and Rule Systems讀者反饋學(xué)科排名
作者: ZEST 時間: 2025-3-21 21:14
Simulation Subsumption or Déjà vu on the Web featuring descendant constructs, regular expressions, negative subterms (or subterm exclusions), and multiple variable occurrences. Finally, we show that subsumption between two query terms can be decided in . where . is the sum of the sizes of both query terms.作者: kyphoplasty 時間: 2025-3-22 02:54
Towards Rule-Based Minimization of RDF Graphs under Constraints of constraints to ensure data consistency, i.e. if an RDF graph satisfies some constraints before minimization, these constraints must be also satisfied afterwards. The problem is decidable but already for a restricted case intractable. In addition we give a fragment of the minimization problem which can be solved in polynomial time.作者: conception 時間: 2025-3-22 05:16 作者: TOXIC 時間: 2025-3-22 09:49
Ontology Design and Reuse with Conceptual Rolesization. We present role-based ontologies as an extension of standard ontologies and define their semantics through a reduction to standard Description Logics, such that existing reasoners can be used.作者: 附錄 時間: 2025-3-22 15:35
Ontology Design and Reuse with Conceptual Rolesization. We present role-based ontologies as an extension of standard ontologies and define their semantics through a reduction to standard Description Logics, such that existing reasoners can be used.作者: PACK 時間: 2025-3-22 17:33
Approximate OWL-Reasoning with , KAON2 algorithms, facilitating a compilation of OWL DL TBoxes into Datalog, which is tractable in terms of data complexity. We present three different instantiations of the Screech approach, and report on experiments which show that the gain in efficiency outweighs the number of introduced mistakes in the reasoning process.作者: 薄膜 時間: 2025-3-22 23:07 作者: 加花粗鄙人 時間: 2025-3-23 02:43
A TRIPLE-Oriented Approach for Integrating Higher-Order Rules and External Contexts mentioned language elements of both aspects following the expressiveness of locally stratified datalog. It introduces fixpoint semantics as well as pragmatic extensions for defining transformations between fact bases. A partial implementation is based on stratified, semi-naive evaluation, and static filtering.作者: 五行打油詩 時間: 2025-3-23 07:19 作者: 吼叫 時間: 2025-3-23 12:18 作者: Iatrogenic 時間: 2025-3-23 14:52 作者: 中古 時間: 2025-3-23 21:42
Semantics and Reasoning Algorithms for a Faithful Integration of Description Logics and Rules and reasoning about conceptual knowledge, rules are focused on answering queries about facts in the knowledge base. So far, research on DLs has been largely isolated from the research on rules. With the advent of the Semantic Web, however, it became apparent that neither formalism alone can cover a作者: 鞏固 時間: 2025-3-24 00:38 作者: Arteriography 時間: 2025-3-24 04:24 作者: 拋媚眼 時間: 2025-3-24 06:58 作者: 浪費(fèi)物質(zhì) 時間: 2025-3-24 12:13 作者: parsimony 時間: 2025-3-24 16:34
Simulation Subsumption or Déjà vu on the Webt, that is, query subsumption under simulation unification. Simulation subsumption is crucial in general for query optimization, in particular for optimizing pattern-based search engines, and for the termination of recursive rule-based web languages such as the XML and RDF query language Xcerpt. Thi作者: Esophagitis 時間: 2025-3-24 20:58 作者: Triglyceride 時間: 2025-3-25 03:10
Reasoning with a Network of Aligned Ontologiesp integrating, mediating or reasoning with a system of networked ontologies. Though different formalisms have already been defined to reason with such systems, they do not consider ontology alignments as first class objects designed by third party ontology matching systems. Correspondences between o作者: 易于 時間: 2025-3-25 03:40 作者: 路標(biāo) 時間: 2025-3-25 11:01
Lexicographical Inference over Inconsistent DL-Based Ontologiesologies without repairing them first. We address the problem of checking consequences in a . ontology that are classically inferred from every consistent (or coherent) subontology having the highest .. We propose a method for compiling a . ontology to a propositional program so that the problem can 作者: Kidnap 時間: 2025-3-25 13:40 作者: 勤勞 時間: 2025-3-25 19:07
A Survey of Revision Approaches in Description Logicsologies. Many approaches in the theory of belief revision have been applied to deal with this problem and most of them focus on the postulates or the logical properties of a revision operator in Description Logics (DLs). However, there is no coherent view on how to characterize a revision operator i作者: Rct393 時間: 2025-3-25 21:16
Towards Rule-Based Minimization of RDF Graphs under Constraintslarge and contain redundant information. So far, techniques for eliminating redundancy rely on the generic notion of lean graphs. We propose a user-specific minimization technique based on Datalog rules, enabling a user to specify the structures in an RDF graph that are not relevant for an applicati作者: 寒冷 時間: 2025-3-26 01:02 作者: Camouflage 時間: 2025-3-26 07:01
Ontology Design and Reuse with Conceptual Rolesple, in software development. As the use of ontologies becomes commonplace, they will be constructed more frequently and also become more complex. To cope with this issue, modularization paradigms and reuse techniques must be defined for ontologies and supported by ontology languages. In this paper,作者: jaunty 時間: 2025-3-26 12:14 作者: reaching 時間: 2025-3-26 15:30
Enhancing a DLP System for Advanced Database Applications language of DLP is very expressive, and allows to model also advanced knowledge-based tasks arising in modern application-areas like, e.g., information integration and knowledge management. The recent development of efficient systems supporting disjunctive logic programming, has encouraged the usag作者: indemnify 時間: 2025-3-26 19:48 作者: 天賦 時間: 2025-3-26 23:47
A Semantic Web Reasoner for Rules, Equations and Constraintslogies, the reasoner needs to handle user-defined operations (e.g., temporal and geospatial). Furthermore, the reasoner must perform sophisticated constraint simplification because any unresolved constraints can be used by a cognitive radio to plan and reason about its spectrum usage. No existing re作者: Neonatal 時間: 2025-3-27 04:07
A Semantic Web Reasoner for Rules, Equations and Constraintslogies, the reasoner needs to handle user-defined operations (e.g., temporal and geospatial). Furthermore, the reasoner must perform sophisticated constraint simplification because any unresolved constraints can be used by a cognitive radio to plan and reason about its spectrum usage. No existing re作者: subacute 時間: 2025-3-27 06:31 作者: 細(xì)頸瓶 時間: 2025-3-27 10:34
What Is Approximate Reasoning? is to be done in such a way that the number of introduced mistakes is at least outweighed by the obtained speed-up. When pursuing such approximate reasoning approaches, however, it is important to be critical not only about appropriate application domains, but also about the quality of the resultin作者: 勉強(qiáng) 時間: 2025-3-27 16:07 作者: 使習(xí)慣于 時間: 2025-3-27 18:36 作者: Freeze 時間: 2025-3-27 22:12
Ranking Services Using Fuzzy , Programsintegrating formalisms, e.g., Description Logic programs (.) allow a logic program to retrieve results from and feed results to a DL knowledge base. Two functional extensions of dl-programs are . programs and fuzzy dl-programs. The former abstract away from DLs, allowing for general external queries作者: 有罪 時間: 2025-3-28 03:41 作者: Jacket 時間: 2025-3-28 09:56 作者: CROAK 時間: 2025-3-28 12:46 作者: 馬籠頭 時間: 2025-3-28 17:11
On Reducing Redundancy in Mining Relational Association Rules from the Semantic Webavailability of the domain knowledge should not be disregarded during data mining process. As the case study we show how to integrate the semantic redundancy reduction techniques into our approach to mining association rules from the hybrid knowledge bases represented in OWL with rules.作者: 重疊 時間: 2025-3-28 22:39
On Reducing Redundancy in Mining Relational Association Rules from the Semantic Webavailability of the domain knowledge should not be disregarded during data mining process. As the case study we show how to integrate the semantic redundancy reduction techniques into our approach to mining association rules from the hybrid knowledge bases represented in OWL with rules.作者: 嬰兒 時間: 2025-3-29 01:34 作者: Additive 時間: 2025-3-29 05:07 作者: 參考書目 時間: 2025-3-29 11:04
Paraconsistent Reasoning with Quasi-classical Semantic in ,asoning problems such as satisfiability and subsumption have been handled by tableau-like algorithms. Description logics are practical monotonic logics which, though imparting strong and conclusive reasoning mechanisms, lack the flexibility of non-monotonic reasoning mechanisms. In recent years, the作者: curettage 時間: 2025-3-29 13:17 作者: 流浪者 時間: 2025-3-29 15:50 作者: 颶風(fēng) 時間: 2025-3-29 21:15 作者: 運(yùn)動性 時間: 2025-3-30 03:09
Conference proceedings 2008ermany in October/November 2008. The 12 revised full papers, 4 revised short papers presented together with 5 poster papers were carefully reviewed and selected from over 35 submissions. The papers address all current topics in Web reasoning and rule systems such as acquisition of rules and ontologi作者: ascetic 時間: 2025-3-30 06:42 作者: 衰老 時間: 2025-3-30 09:05 作者: irreducible 時間: 2025-3-30 13:38 作者: 引起痛苦 時間: 2025-3-30 19:03
A Survey of Revision Approaches in Description Logicsn DLs. In this paper, we lay bare the assumptions underlying different approaches for revision in DLs and propose some criteria to compare them. Based on the analysis, we give our definition of a revision operator in DLs and point out some open problems.作者: 拋媚眼 時間: 2025-3-30 23:38
A Survey of Revision Approaches in Description Logicsn DLs. In this paper, we lay bare the assumptions underlying different approaches for revision in DLs and propose some criteria to compare them. Based on the analysis, we give our definition of a revision operator in DLs and point out some open problems.作者: Morose 時間: 2025-3-31 03:26
Conference proceedings 2008es by knowledge extraction, design and analysis of reasoning languages, implemented tools and systems, standardization, ontology usability, ontology languages and their relationships, rules and ontologies, reasoning with uncertainty, reasoning with constraints, rule languages and systems, semantic Web services modeling and applications.作者: 領(lǐng)帶 時間: 2025-3-31 07:51
Markup and Component Interoperability for Active Rules model of component languages to a meta model of services and an informational infrastructure that is required for a most general framework for specifying and executing active rules over heterogeneous languages. The approach is implemented in the MARS prototype.作者: pacifist 時間: 2025-3-31 09:31
Markup and Component Interoperability for Active Rules model of component languages to a meta model of services and an informational infrastructure that is required for a most general framework for specifying and executing active rules over heterogeneous languages. The approach is implemented in the MARS prototype.作者: 反復(fù)無常 時間: 2025-3-31 14:14
0302-9743 ontology languages and their relationships, rules and ontologies, reasoning with uncertainty, reasoning with constraints, rule languages and systems, semantic Web services modeling and applications.978-3-540-88736-2978-3-540-88737-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 不能逃避 時間: 2025-3-31 20:37 作者: Landlocked 時間: 2025-4-1 00:34 作者: 無瑕疵 時間: 2025-4-1 05:34
A Semantic Web Reasoner for Rules, Equations and Constraintsed and processed. Our system and general approach will be useful for other problems that need sophisticated constraint processing in addition to rule-based reasoning, or where new operations need to be added. The implementation is efficient enough to run on resource-constrained embedded systems such as software-defined radios.作者: 孤獨(dú)無助 時間: 2025-4-1 07:26 作者: 名字的誤用 時間: 2025-4-1 13:19 作者: blight 時間: 2025-4-1 16:07
What Is Approximate Reasoning?ormally define such a foundation for approximate reasoning research. We will clarify – by means of notions from statistics – how different approximate algorithms can be compared, and ground the most fundamental notions in the field formally. We will also exemplify what a corresponding statistical comparison of algorithms would look like.作者: 冷淡周邊 時間: 2025-4-1 19:27
Paraconsistent Reasoning with Quasi-classical Semantic in , important proof rules such as modus tollens, modus ponens, and disjunctive syllogism. In this paper, we consider the characters of . with Quasi-classical semantics and develop a sound and complete tableau algorithm for paraconsistent reasoning in ..作者: 發(fā)炎 時間: 2025-4-1 22:46 作者: inquisitive 時間: 2025-4-2 03:38 作者: 流出 時間: 2025-4-2 10:38
Semantics and Reasoning Algorithms for a Faithful Integration of Description Logics and Ruleserent semantic framework, and shall discuss the main challenges in achieving a tight integration. I shall present an overview of the approaches currently discussed in literature. Finally, I shall present in more detail the approach that is based on the nonmonotonic logic MKNF by Lifschitz. This appr作者: nephritis 時間: 2025-4-2 13:56 作者: 創(chuàng)新 時間: 2025-4-2 15:38
On Combining Description Logic Ontologies and Nonrecursive Datalog Rulesmbinations of Description Logics and Datalog in which reasoning is undecidable. Then, we present new results on the decidability and complexity of the so-called . (or .) integration of DL ontologies and Datalog rules. Our results show that: (1) the unrestricted interaction between DLs and Datalog is作者: 無目標(biāo) 時間: 2025-4-2 20:22 作者: Collision 時間: 2025-4-3 02:18
Reasoning with a Network of Aligned Ontologiesto directly connect to each other. We consequently devise a correct and complete algorithm which, although being far from tractacle, has interesting properties: it is independent from the local logics expressing ontologies by encapsulating local reasoners. This shows that consistency of a . system i作者: SLUMP 時間: 2025-4-3 04:38
Enhancing a DLP System for Advanced Database ApplicationsDLP in real-world applications..We develop a DLP system which . carries out as much as possible of the reasoning tasks in mass memory without degrading performances, allowing to deal with data-intensive applications; . extends the expressiveness of DLP language with external function calls, yet impr作者: 來就得意 時間: 2025-4-3 09:41 作者: 背帶 時間: 2025-4-3 12:21
