流行
发表于 2025-3-28 17:07:35
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:58
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:14
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:32
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
创新
发表于 2025-3-29 07:56:30
http://reply.papertrans.cn/103/10216/1021589/1021589_45.png
说明
发表于 2025-3-29 13:10:45
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:57
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 20:31:17
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:21
http://reply.papertrans.cn/103/10216/1021589/1021589_49.png
分离
发表于 2025-3-30 07:52:06
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