標題: Titlebook: Web Reasoning and Rule Systems; 6th International Co Markus Kr?tzsch,Umberto Straccia Conference proceedings 2012 Springer-Verlag Berlin He [打印本頁] 作者: solidity 時間: 2025-3-21 17:53
書目名稱Web Reasoning and Rule Systems影響因子(影響力)
書目名稱Web Reasoning and Rule Systems影響因子(影響力)學科排名
書目名稱Web Reasoning and Rule Systems網(wǎng)絡公開度
書目名稱Web Reasoning and Rule Systems網(wǎng)絡公開度學科排名
書目名稱Web Reasoning and Rule Systems被引頻次
書目名稱Web Reasoning and Rule Systems被引頻次學科排名
書目名稱Web Reasoning and Rule Systems年度引用
書目名稱Web Reasoning and Rule Systems年度引用學科排名
書目名稱Web Reasoning and Rule Systems讀者反饋
書目名稱Web Reasoning and Rule Systems讀者反饋學科排名
作者: prostatitis 時間: 2025-3-21 21:44
Distributed Ontology Based Data Access via Logic Programmingprise – have started to build ontological reasoning modules on top of their existing software. Ontological reasoning is also the goal of several research-based systems, such as Quest, Owlgres, Owlim, and QuOnto, just to cite a few.作者: 方便 時間: 2025-3-22 03:28 作者: 莊嚴 時間: 2025-3-22 07:21
The Definability Abduction Problem for Data Exchangeight be more than one target databases satisfying a given mapping. That is, the target database is actually an .. represented by a set of possible databases. Therefore, the problem of query answering the target data is inherently complex for general (non-positive) relational or aggregate queries.作者: 彎彎曲曲 時間: 2025-3-22 12:15
0302-9743 sections on technical communications, algorithms, design aspects of rule markup, design of ontology languages, engineering of engines, translators, and other tools, standardization efforts, such as the Rules Interchange Format activity at W3C, and applications.978-3-642-33202-9978-3-642-33203-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 貪心 時間: 2025-3-22 15:42 作者: 社團 時間: 2025-3-22 19:38
Query Patterns for Existential Rulesable to compute a simplified Datalog+/– program .′ that is equivalent to . with respect to answering queries in .. We show that such an algorithm constitutes both a theoretical and a practical interesting tool for studying query answering over ontologies expressed in terms of Datalog+/– rules.作者: Crepitus 時間: 2025-3-22 22:16
A Sound and Complete Backward Chaining Algorithm for Existential Rules to identify subsets of atoms from the query that must be processed together. We first show that our rewriting method computes a minimal set of CQs when this set is finite, i.e., the set of rules is a fus. We then focus on optimizing the rewriting step. First experiments are reported.作者: 使害羞 時間: 2025-3-23 01:55
A Sound and Complete Backward Chaining Algorithm for Existential Rules to identify subsets of atoms from the query that must be processed together. We first show that our rewriting method computes a minimal set of CQs when this set is finite, i.e., the set of rules is a fus. We then focus on optimizing the rewriting step. First experiments are reported.作者: 殺人 時間: 2025-3-23 09:22
Semantic Matchmaking and Ranking: Beyond Deduction in Retrieval Scenariose user and, in case, further explored. In all the above mentioned frameworks, the user query may contain only hard (strict) requirements or may represent also her preferences. We will see how to handle both cases while computing the ranked list of most promising resources.作者: 項目 時間: 2025-3-23 13:02
Semantic Matchmaking and Ranking: Beyond Deduction in Retrieval Scenariose user and, in case, further explored. In all the above mentioned frameworks, the user query may contain only hard (strict) requirements or may represent also her preferences. We will see how to handle both cases while computing the ranked list of most promising resources.作者: 先鋒派 時間: 2025-3-23 15:13 作者: 注入 時間: 2025-3-23 19:13 作者: overwrought 時間: 2025-3-24 01:25
Improving the Recall of Live Linked Data Querying through Reasoningy considering (3) . links, and (4) applying lightweight RDFS reasoning for finding more results, relying on static schema information. We evaluate different configurations for live queries covering different shapes and domains, generated from random walks over our corpus.作者: 報復 時間: 2025-3-24 03:09
Improving the Recall of Live Linked Data Querying through Reasoningy considering (3) . links, and (4) applying lightweight RDFS reasoning for finding more results, relying on static schema information. We evaluate different configurations for live queries covering different shapes and domains, generated from random walks over our corpus.作者: bronchiole 時間: 2025-3-24 09:43 作者: 易彎曲 時間: 2025-3-24 13:49
Argumentation and Voting for an Intelligent User Empowering Business Directory on the Webrpreted as abstract arguments. We show a prototype web application which puts into use this method to offer an intelligent business directory allowing users to engage in debate and aid them to extract the dominant, emerging public opinion.作者: recession 時間: 2025-3-24 16:55
Argumentation and Voting for an Intelligent User Empowering Business Directory on the Webrpreted as abstract arguments. We show a prototype web application which puts into use this method to offer an intelligent business directory allowing users to engage in debate and aid them to extract the dominant, emerging public opinion.作者: dearth 時間: 2025-3-24 21:29 作者: 可用 時間: 2025-3-25 03:08
Multi-context Systems: Specifying the Interaction of Knowledge Bases Declarativelyg knowledge.A wealth of tools and formalisms is now available, including rather basic ones like databases or the more recent triple-stores, and more expressive ones like ontology languages (e.g., description logics), temporal and modal logics, nonmonotonic logics, or logic programs under answer set 作者: Malcontent 時間: 2025-3-25 07:17 作者: 慌張 時間: 2025-3-25 10:34
Semantic Matchmaking and Ranking: Beyond Deduction in Retrieval Scenarioshe process of computing such ordered list also taking into account the semantics of resources description and of the query, provided with reference to a logic theory (an ontology, a set of rules, etc.) [3]. A matchmaking step is fundamental in a number of retrieval scenarios spanning from (Web) serv作者: Mosaic 時間: 2025-3-25 13:29 作者: 沒有貧窮 時間: 2025-3-25 16:08
A Tableau Algorithm for Fuzzy Description Logics over Residuated De Morgan Latticesin the description logic . with semantics based on a complete residuated De Morgan lattice. The problems are undecidable in the general case, but can be decided by a tableau algorithm when restricted to finite lattices. For some sublogics of ., we provide upper complexity bounds that match the compl作者: 鼓掌 時間: 2025-3-25 21:15
A Tableau Algorithm for Fuzzy Description Logics over Residuated De Morgan Latticesin the description logic . with semantics based on a complete residuated De Morgan lattice. The problems are undecidable in the general case, but can be decided by a tableau algorithm when restricted to finite lattices. For some sublogics of ., we provide upper complexity bounds that match the compl作者: Rebate 時間: 2025-3-26 01:51
Ontology-Based Governance of Data-Aware Processesntologies. In particular, we consider processes executed over a relational database which issue calls to external services to acquire new information and update the data.We equip these processes with an OBDA system, in which an ontology modeling the domain of interest is connected through declarativ作者: fiction 時間: 2025-3-26 07:01 作者: 脫落 時間: 2025-3-26 09:02 作者: Inkling 時間: 2025-3-26 14:37 作者: 冷漠 時間: 2025-3-26 20:24
Semantic Independence in DL-Programsinterest. When computing answer sets of a DL-program, special DL-atoms, which provide query interface to an ontology, are evaluated under a possibly changing input that gives a context for the evaluation. Many different such contexts may exist and evaluating a DL-atom may be costly even for one cont作者: 口味 時間: 2025-3-26 22:14 作者: Shuttle 時間: 2025-3-27 05:10 作者: 增長 時間: 2025-3-27 05:35
An Update on Query Answering with Restricted Forms of Negationt conceptual layer of the data schema, and queries over the ontology are then used to access the data. In this paper we focus on extensions of conjunctive queries (CQs) and unions of conjunctive queries (UCQs) with restricted forms of negations such as inequality and safe negation. In particular, we作者: 乳白光 時間: 2025-3-27 10:09 作者: Rinne-Test 時間: 2025-3-27 14:18 作者: 無可非議 時間: 2025-3-27 19:10
Meta Programming with Answer Sets for Smart Spacesand services using the best available resources. In this paper, the interoperability of heterogeneous objects participating in a smart space is enhanced by publishing their behavioral rules as RDF triples, i.e., in the same way as any other information in the space. This enables the use of answer-se作者: 減去 時間: 2025-3-27 22:46
Meta Programming with Answer Sets for Smart Spacesand services using the best available resources. In this paper, the interoperability of heterogeneous objects participating in a smart space is enhanced by publishing their behavioral rules as RDF triples, i.e., in the same way as any other information in the space. This enables the use of answer-se作者: tattle 時間: 2025-3-28 05:09 作者: bourgeois 時間: 2025-3-28 09:33
A Sound and Complete Backward Chaining Algorithm for Existential Rulesare represented in the framework of existential rules, also known as Datalog+/-. We focus on the backward chaining paradigm, which involves rewriting the query (assumed to be a conjunctive query, CQ) into a set of CQs (seen as a union of CQs). The proposed algorithm accepts any set of existential ru作者: LITHE 時間: 2025-3-28 12:47 作者: 流行 時間: 2025-3-28 17:07
Deriving Predicate Statistics for Logic Ruless as well. To this end, one first needs to collect data statistics for base and propagate them to derived predicates. However, there are two difficulties: dependencies among arguments and recursion. Earlier we developed an algorithm, called SDP, for estimating Datalog query sizes efficiently by esti作者: TSH582 時間: 2025-3-28 22:05
Consistent Answers in Probabilistic Datalog+/– Ontologies in the context of query answering and information extraction for the Semantic Web. It is widely accepted that it is necessary to develop a principled way to handle uncertainty in this domain. In addition to uncertainty as an inherent aspect of the Web, one must also deal with forms of uncertainty d作者: GRIPE 時間: 2025-3-28 23:57
Consistent Answers in Probabilistic Datalog+/– Ontologies in the context of query answering and information extraction for the Semantic Web. It is widely accepted that it is necessary to develop a principled way to handle uncertainty in this domain. In addition to uncertainty as an inherent aspect of the Web, one must also deal with forms of uncertainty d作者: 浮雕 時間: 2025-3-29 03:47
Query Rewriting under Ontology Contractionanswering is query rewriting where a wide variety of systems has been proposed the last years. All of them accept as input a fixed CQ . and ontology . and produce a rewriting for .. However, in many real world applications ontologies are very often dynamic—that is, new axioms can be added or existin作者: 創(chuàng)新 時間: 2025-3-29 07:56 作者: 說明 時間: 2025-3-29 13:10
Improving the Recall of Live Linked Data Querying through Reasoningbenefit of up-to-date results and decentralised execution, but operate only on explicit data from dereferenced documents, affecting recall. In this paper, we show how inferable knowledge—specifically that found through . and RDFS reasoning—can improve recall in this setting. We first analyse a corpu作者: 過于平凡 時間: 2025-3-29 18:22
Improving the Recall of Live Linked Data Querying through Reasoningbenefit of up-to-date results and decentralised execution, but operate only on explicit data from dereferenced documents, affecting recall. In this paper, we show how inferable knowledge—specifically that found through . and RDFS reasoning—can improve recall in this setting. We first analyse a corpu作者: 思鄉(xiāng)病 時間: 2025-3-29 20:31
Distributed Ontology Based Data Access via Logic Programmingganizations and autonomous contributors are generating the so called “Web of Data”, making publicly available Semantic Web repositories built either from scratch or by translation of existing data in ontological form. Contemporarily, database technology providers – such as Oracle, Ontotext, and Onto作者: 辯論的終結 時間: 2025-3-30 01:01 作者: 分離 時間: 2025-3-30 07:52
Argumentation and Voting for an Intelligent User Empowering Business Directory on the Webl information. Our method combines different factors, such as social support drawn from votes and attacking/supporting relations between opinions interpreted as abstract arguments. We show a prototype web application which puts into use this method to offer an intelligent business directory allowing作者: 微粒 時間: 2025-3-30 09:39 作者: Dna262 時間: 2025-3-30 13:05
A Polynomial Reduction from ASPDA to ASP2]. The authors describe a reduction from ASPDA to plain Answer Set Programming, which however exponentially inflate programs. In this note, we present an alternative reduction, which does not suffer from this problem. As a side-effect, complexity results for ASPDA are established.作者: ALTER 時間: 2025-3-30 17:07 作者: 平靜生活 時間: 2025-3-30 22:27 作者: Antarctic 時間: 2025-3-31 03:18
The Definability Abduction Problem for Data Exchangeping specified by means of rules in the form of .-.-.... – rules whose body is a conjunction of atoms over the source schema and the head is a conjunction of atoms over the target schema, with possibly existential variables in the head. With this formalization, given a fixed source database, there m作者: JADED 時間: 2025-3-31 08:41
Conference proceedings 2012, in September 2012. The 27 revised research papers, presented together with 2 invited talks and 5 research summaries were carefully reviewed and selected from 42 submissions. The papers were organized in topical sections on technical communications, algorithms, design aspects of rule markup, design作者: calorie 時間: 2025-3-31 13:13
ussion hinausgeschrieben, das ‘sacrificium intellectus’ vollzogen, mochte nur noch unter dem historischen Aspekt pers?nlicher Entwicklung oder — Heinrich B?lls Bild aus einem anderen, kaum erfreulicheren Kontext aufnehmend — einer ‘Trockenlegung’ bestimmter Traditionen (‘ein ausgesprochener Ordnungs作者: 提升 時間: 2025-3-31 15:49
itel ?Die Lyrik Gottfried Benns? zu viel verspricht, da es sich hier um eine Sammlung und überarbeitung seiner bereits bekannten, geistvollen und anregenden Einzelinterpretationen von 10 Gedichten bzw. Gedichtzyklen Benns handelt, aber noch nicht um eine Gesamtdarstellung der Lyrik Benns, die freili作者: 變化 時間: 2025-3-31 18:44 作者: defeatist 時間: 2025-3-31 23:15
Víctor Gutiérrez-Basulto,Yazmín Angélica Ibá?ez-García,Roman Kontchakovist, so aufgefa?t, nichts anderes als die Geschichte von geistigen, sozialen und stilistischen Wandlungen am konkreten Beispiel bestimmter Stoffe. Davon müssen wir in einem Realienbuch, dessen Umfang zudem begrenzt ist, weit entfernt bleiben. Aber die Grundlage der Erkenntnis, um die es der Wissensc作者: HEAVY 時間: 2025-4-1 03:55
Víctor Gutiérrez-Basulto,Yazmín Angélica Ibá?ez-García,Roman Kontchakovdem ?Herzm?re? und in der ?Goldenen Schmiede? Konrads von Würzburg. Noch Dichtern des 15. Jh.s ist Gottfried bekannt, doch ist ihr Zeugnis nur von geringer Bedeutung. Durch die Angaben der Dichter des 13. Jh.s ist auch Stra?burg als Gottfrieds Heimat sichergestellt, die im übrigen auch durch seine S作者: Nomadic 時間: 2025-4-1 08:22 作者: 移動 時間: 2025-4-1 12:08
Tomi Janhunen,Vesa Luukkalan der s?chsischen Kleinstadt, gelegen in einer bikulturellen, d.h. von Sorben mitgepr?gten Region, in der westlichen Oberlausitz, unweit Dresdens. Den sorbischen Traditionen gegenüber vertrat er ein Luthertum, das an dessen unorthodoxen Anf?ngen, an der Reformation, orientiert war. Und ebenso wie er作者: CRATE 時間: 2025-4-1 17:18
Tomi Janhunen,Vesa Luukkalawie auch aus privatem Besitz den Kriegs- und Nachkriegsjahren zum Opfer gefallen ist, lie?e sich erst an Hand eines Zentralkatalogs deutscher Dichterhandschriften des In- und Auslandes feststellen, der — von der Deutschen Akademie der Wissenschaften zu Berlin vorbereitet — noch aussteht.作者: 取回 時間: 2025-4-1 19:53 作者: Freeze 時間: 2025-4-2 01:14 作者: 修正案 時間: 2025-4-2 04:18
Jürgen Umbrich,Aidan Hogan,Axel Polleres,Stefan Decker if the interactions taking place for its implementation equip actors to jointly provide requisite variety to attend to and resolve °system° issues.345 As captured in the principle of sustainability of control, that requires the three aspects of structure to permanently supply sufficient capacities 作者: 極力證明 時間: 2025-4-2 08:33
Rosamaria Barilaro,Nicola Leone,Francesco Ricca,Giorgio Terracinaight the burden of climate change more equally between today’s and tomorrow’s society. Deriving respective policy recommendations for the wider climate change community is aimed at ensuring to share the burden but also the benefits of climate change within society, between countries and over time in作者: ECG769 時間: 2025-4-2 11:07
Rosamaria Barilaro,Nicola Leone,Francesco Ricca,Giorgio Terracinability has reduced resource availability due to a loss of capacity of ecosystems to function to their optimum, and an increase in intensity and frequency of droughts, desertification, species depletion, soil degradation and crop failures has reduced livelihood options and the vulnerability of human 作者: 傀儡 時間: 2025-4-2 16:07 作者: Cupidity 時間: 2025-4-2 21:02 作者: BRIDE 時間: 2025-4-3 03:03 作者: Heterodoxy 時間: 2025-4-3 06:03
Enrico Franconi,Nhung Ngo,Evgeny Sherkhonovining firms and their stakeholders. Rather, by asking how a variety of different social, economic, and political actors negotiate their conflicting interests surrounding large-scale extractive projects, we hope to gain insight into the complex relations bound up in the practices of mining and CSR.作者: 牽索 時間: 2025-4-3 09:25 作者: Biofeedback 時間: 2025-4-3 15:50
