標(biāo)題: Titlebook: Web Reasoning and Rule Systems; 5th International Co Sebastian Rudolph,Claudio Gutierrez Conference proceedings 2011 Springer-Verlag GmbH B [打印本頁] 作者: External-Otitis 時間: 2025-3-21 17:54
書目名稱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é)科排名
作者: Spongy-Bone 時間: 2025-3-22 00:13
Ontological Query Answering with Existential Rules,as been acknowledged both in the database and knowledge representation communities. We focus in this paper on the ontological query answering problem, which consists of querying data while taking ontological knowledge into account. To tackle this problem, we consider a logical framework based on exi作者: Ankylo- 時間: 2025-3-22 03:41
The ONTORULE Project : Where Ontology Meets Business Rules,part of a business application that is relevant to them. This extended abstract describes the approach the ONTORULE project proposes to business rule application development, and it introduces the architecture and the semantic technologies that we develop for that purpose and that are validated and 作者: 危險 時間: 2025-3-22 07:34
Exchanging More Than Complete Data, instances. Although natural for a typical database translation scenario, this restriction is gradually becoming an impediment to the development of a wide range of applications that need to exchange objects that admit several interpretations. In particular, we are motivated by two specific applicat作者: 著名 時間: 2025-3-22 10:23
Ontological Query Answering with Existential Rules,as been acknowledged both in the database and knowledge representation communities. We focus in this paper on the ontological query answering problem, which consists of querying data while taking ontological knowledge into account. To tackle this problem, we consider a logical framework based on exi作者: 毀壞 時間: 2025-3-22 14:21 作者: 骯臟 時間: 2025-3-22 21:04
The ONTORULE Project : Where Ontology Meets Business Rules,part of a business application that is relevant to them. This extended abstract describes the approach the ONTORULE project proposes to business rule application development, and it introduces the architecture and the semantic technologies that we develop for that purpose and that are validated and 作者: facetious 時間: 2025-3-22 23:10 作者: intimate 時間: 2025-3-23 05:14 作者: Suppository 時間: 2025-3-23 08:40 作者: 單挑 時間: 2025-3-23 10:02
Context-Dependent OWL Reasoning in Sindice - Experiences and Lessons Learnt,herwise be implicit knowledge: it adds value to the information and enables Sindice to ultimately be more competitive in terms of precision and recall. However, due to the scale and heterogeneity of web data, a reasoning engine for the Sindice system must (1) scale out through parallelisation over a作者: Infuriate 時間: 2025-3-23 17:40 作者: Pericarditis 時間: 2025-3-23 21:32 作者: Metastasis 時間: 2025-3-24 00:45 作者: ALLEY 時間: 2025-3-24 02:40 作者: inchoate 時間: 2025-3-24 10:31
Linked Rules: Principles for Rule Reuse on the Web,. conceptualizations; this has never been more true, because in recent years they have been developed by community efforts, often including experts from academia as well as industry. Those efforts have been complemented by the standardization of formats and languages, such as RDF, OWL, and SPARQL, f作者: 群居男女 時間: 2025-3-24 14:03 作者: 連系 時間: 2025-3-24 15:57 作者: jet-lag 時間: 2025-3-24 20:45 作者: 煉油廠 時間: 2025-3-24 23:37 作者: Acetaminophen 時間: 2025-3-25 03:39 作者: Bernstein-test 時間: 2025-3-25 10:21 作者: CURL 時間: 2025-3-25 14:05
Reasoning as Axioms Change,soners have to address the problem of changing axioms in the presence of materializations of derived atoms. Existing approaches have drawbacks: some require to generate and evaluate large transformed programs that are in Datalog. while the source program is in Datalog and significantly smaller; some作者: oxidize 時間: 2025-3-25 17:21
Decidability of Unification in EL without Top Constructor, in natural language processing, configuration of technical systems, databases and biomedical ontologies. Unification is used there as a tool to recognize equivalent concepts. It has been proven that unification in . is NP-complete. This result was based on a locality property of certain . unifiers.作者: 退潮 時間: 2025-3-25 20:18
Query Rewriting for Inconsistent DL-Lite Ontologies, of inconsistency-tolerant semantics and show that for some of such variants answering unions of conjunctive queries (UCQs) is first-order (FOL) rewritable, i.e., it can be reduced to standard evaluation of a FOL/SQL query over a database. Since FOL-rewritability of query answering for UCQs over con作者: squander 時間: 2025-3-26 02:35
On the Equivalence between the , Action Language and Partial Actions in Transaction Logic,ication of state-changing transactions. The action language . is a well-known formalism to describe changing domains and for reasoning about actions. The purpose of this paper is to compare these two formalisms and identify their similarities and points of divergence in order to better understand th作者: 聰明 時間: 2025-3-26 05:52
Reasoning with Actions in Transaction Logic,, but extends it with special .-formulas that generalize the data and transition formulas of the original Transaction Logic. We develop a sound and complete proof theory for .. and illustrate the formalism on a number of non-trivial examples. In addition, we show that most of .. is reducible to ordi作者: overture 時間: 2025-3-26 11:51 作者: 線 時間: 2025-3-26 16:26 作者: 去掉 時間: 2025-3-26 17:33 作者: GRIN 時間: 2025-3-27 00:05 作者: beta-carotene 時間: 2025-3-27 01:35 作者: Offset 時間: 2025-3-27 06:52 作者: 滲入 時間: 2025-3-27 10:49 作者: 木質(zhì) 時間: 2025-3-27 16:02 作者: 谷物 時間: 2025-3-27 18:24
An Ontological Approach for Modeling Technical Standards for Compliance Checking,nical assessments at the French scientific center on Building Industry (CSTB). Starting from regulatory texts, we first explicit SBVR rules and then formalize them into ontology-based rules in the SPARQL language. These are exploited in the modeling of the compliance checking process required for th作者: 動作謎 時間: 2025-3-28 01:57 作者: BRAND 時間: 2025-3-28 02:55
An Ontological Approach for Modeling Technical Standards for Compliance Checking,nical assessments at the French scientific center on Building Industry (CSTB). Starting from regulatory texts, we first explicit SBVR rules and then formalize them into ontology-based rules in the SPARQL language. These are exploited in the modeling of the compliance checking process required for th作者: 改良 時間: 2025-3-28 07:35 作者: Fresco 時間: 2025-3-28 11:47 作者: antidepressant 時間: 2025-3-28 15:02
Ontological Query Answering with Existential Rules,idable classes of rules, including a review of the main complexity results. It mostly relies on previous work presented at IJCAI’2009 [BLMS09] and KR’2010 [BLM10] (and developed in a journal paper [BLMS11]), updated to include very recent results.作者: MAL 時間: 2025-3-28 20:15
Little Knowledge Rules the Web: Domain-Centric Result Page Extraction,n logical rules to allow an explicit formulation of the heuristics and easy adaptation to different domains..We apply . to the UK real estate domain where we achieve near perfect accuracy on a representative sample of 50 agency websites.作者: Obstreperous 時間: 2025-3-29 00:07
Little Knowledge Rules the Web: Domain-Centric Result Page Extraction,n logical rules to allow an explicit formulation of the heuristics and easy adaptation to different domains..We apply . to the UK real estate domain where we achieve near perfect accuracy on a representative sample of 50 agency websites.作者: Phenothiazines 時間: 2025-3-29 04:15
Paraconsistent Semantics for Hybrid MKNF Knowledge Bases,ransformation operator, which indicates that the data complexity in our paradigm is not higher than that of classical reasoning. Moreover, we provide a fixpoint algorithm for computing paraconsistent MKNF models.作者: CLASH 時間: 2025-3-29 08:15
Paraconsistent Semantics for Hybrid MKNF Knowledge Bases,ransformation operator, which indicates that the data complexity in our paradigm is not higher than that of classical reasoning. Moreover, we provide a fixpoint algorithm for computing paraconsistent MKNF models.作者: creatine-kinase 時間: 2025-3-29 12:50
Polynomial Conjunctive Query Rewriting under Unary Inclusion Dependencies,rd relational database engines. In this paper, we present a polynomial query rewriting for conjunctive queries under unary inclusion dependencies. On the other hand, we show that binary inclusion dependencies do not admit polynomial query rewriting algorithms.作者: extinguish 時間: 2025-3-29 16:22
Polynomial Conjunctive Query Rewriting under Unary Inclusion Dependencies,rd relational database engines. In this paper, we present a polynomial query rewriting for conjunctive queries under unary inclusion dependencies. On the other hand, we show that binary inclusion dependencies do not admit polynomial query rewriting algorithms.作者: 倒轉(zhuǎn) 時間: 2025-3-29 23:42 作者: 一罵死割除 時間: 2025-3-30 01:44 作者: 潰爛 時間: 2025-3-30 08:01
Towards Farsighted Dependencies for Existential Rules,the way rules may interact to ensure that the forward chaining mechanism is finite. After a review of existing proposals, we propose a generalization of the notion of rule dependency, namely .-dependency, that allows to enlarge halting cases. It can also be used to compile the rule base, which leads to improve query answering algorithms.作者: 斑駁 時間: 2025-3-30 10:50
Context-Dependent OWL Reasoning in Sindice - Experiences and Lessons Learnt, cluster of machines; and (2) cope with unexpected data usage. In this paper, we report our experiences and lessons learned in building a large scale reasoning engine for Sindice. The reasoning approach has been deployed, used and improved since 2008 within Sindice and has enabled Sindice to reason over billions of triples.作者: attenuate 時間: 2025-3-30 13:15 作者: Homocystinuria 時間: 2025-3-30 18:30
Reasoning as Axioms Change, recompute the whole extension of a predicate even if only a small part of this extension is affected by the change. The method presented in this article overcomes both drawbacks, arguably at an acceptable price: a slight adaptation of the semi-na?ve forward chaining.作者: 熱情的我 時間: 2025-3-30 23:44
On the Equivalence between the , Action Language and Partial Actions in Transaction Logic,eir modeling and reasoning capabilities. We provide a sound reduction of a large fragment of . to .., and show that this reduction is complete with respect to the LP embedding of .. We also explore how action planning is modeled in both languages and discuss the relationship to other languages for representing actions.作者: 宿醉 時間: 2025-3-31 02:02 作者: 賞錢 時間: 2025-3-31 05:51 作者: 止痛藥 時間: 2025-3-31 10:39 作者: 節(jié)約 時間: 2025-3-31 15:07
Reasoning with Actions in Transaction Logic,mplete proof theory for .. and illustrate the formalism on a number of non-trivial examples. In addition, we show that most of .. is reducible to ordinary logic programming and that this reduction is sound and complete.作者: 競選運動 時間: 2025-3-31 20:46 作者: Canyon 時間: 2025-3-31 23:12
Conference proceedings 2011 36 submissions. The papers address all current topics in Semantic Web, interplay between classical reasoning approach with welll established web languages such as RDF and OWL, reasoning languages, querying and optimization andrules and ontologies.作者: beta-carotene 時間: 2025-4-1 03:01 作者: aesthetician 時間: 2025-4-1 08:57
Query Rewriting for Inconsistent DL-Lite Ontologies,in which such property is preserved also under inconsistency-tolerant semantics. We therefore show that in such settings inconsistency-tolerant query answering has the same computational complexity of standard query answering and that it can rely on well-established relational database technology, as under standard DL semantics.作者: 沒花的是打擾 時間: 2025-4-1 13:28 作者: 沉思的魚 時間: 2025-4-1 16:30 作者: agenda 時間: 2025-4-1 21:33 作者: 無法治愈 時間: 2025-4-2 00:23 作者: Mast-Cell 時間: 2025-4-2 04:42
,Conjunctive Query Answering in Probabilistic Datalog+/– Ontologies,ve queries ask: “what is the probability that a given set of atoms hold?”. These queries are especially relevant to Web information extraction, since extractors often work with uncertain rules and facts, and decisions must be made based on the likelihood that certain facts are inferred. The first al作者: intrigue 時間: 2025-4-2 07:08 作者: 思想靈活 時間: 2025-4-2 14:01
Linked Rules: Principles for Rule Reuse on the Web,t of the Rule Interchange Format (RIF), rules can be shared across many rule systems. We propose a set of basic principles and features by which rules can be represented and shared over the web so that they may be effectively reused and demonstrate several methods of rule reuse. Finally, we discuss 作者: Blatant 時間: 2025-4-2 17:32 作者: SHRIK 時間: 2025-4-2 22:17 作者: 相互影響 時間: 2025-4-3 02:53
Decidability of Unification in EL without Top Constructor,of unification in .. However, by restricting further the locality property, we prove that . unification is decidable and construct an NExpTime decision procedure for the problem. Moreover, the procedure allows us to compute a specific set of solutions to the unification problem.作者: intoxicate 時間: 2025-4-3 07:19 作者: 遺忘 時間: 2025-4-3 08:50 作者: 樹木中 時間: 2025-4-3 13:17
y areas of the world deemed irrelevant to the world balance could deploy their not-so-secret Westphalian troops in local and intelligence struggles to maintain the balance of terror: Che Guevara in the Congo and Colonel Taylor in Sierra Leone behaved like the fictional characters in Le Carré’s novel
