• Aucun résultat trouvé

Cognitively-inspired Heuristic Reasoning for Scalable Semantic Web Reasoning

N/A
N/A
Protected

Academic year: 2022

Partager "Cognitively-inspired Heuristic Reasoning for Scalable Semantic Web Reasoning"

Copied!
1
0
0

Texte intégral

(1)

Cognitively-inspired Heuristic Reasoning for Scalable Semantic Web Reasoning

G.Tagni August 17, 2009

Abstract of the Talk

With the increase in the amount of data published in the Web an important subject of interest that has recently gained momentum in the Semantic Web community is how to provide scalable reasoning techniques to support the type of Web applications normally found in the Web, such as information search, data integration, personalization and query answering, among others. In practice, the Semantic Web requires reasoning under constraints and limited resources such as time, knowledge and storage.

These circumstances are somehow similar to the conditions under which humans normally make decisions and solve problems. In the field of Cognitive Psychology, heuristics are seen as essential and powerful cognitive tools that enable humans (or artificial systems) to make reasonable decisions and inferences and behave adaptively in the environment. Their beauty as tools of reasoning comes from their simplicity, which is due to their ability to exploit the structure of information in the environment and evolved human capacities. Several cognitive heuristics have been developed and studied in different domains, including the recognition heuristic, take-the-best and take-the-first heuristics and the fluency heuristic, among others. In my seminar talk I will introduce my research on cognitively-inspired heuristic reasoning and discuss how cognitive heuristics can support scalable semantic Web reasoning and present my ongoing works on heuristic and stopping rules.

1

Références

Documents relatifs

The performance limitation can be considerably reduced by utilizing such large-scale e-Infrastructures as LarKC - the Large Knowledge Collider - an experimental platform

Since ELP does not only define the semantics of the language, but also a tractable reasoning algorithm that translates ELP rule bases into Datalog, a corresponding extension to

The approach is based on (i) using ontological (unions of) con- junctive queries (which may contain negated subqueries) as Semantic Web search queries, (ii) combining standard

of a decentralised, self-organising system is presented, which allows autonomous, light-weight beasts to traverse RDF graphs and thereby instantiate pattern- based inference rules,

using omplex database queries, rather than DL reasoning, whih is expeted to. deliver a marked inrease

Moreover, online spreadsheets are increasingly popular and have the potential to boost the growth of the Semantic Web by providing well-formed and publicly shared data

Thus our approach consists (1) in using the ontology representation available in an OBDB to interpret in a semantic way both the data manipulation language and the data query lan-

In this paper we introduce a method based on Dempster-Shafer theory that use uncertain reasoning over the possible mappings in order to select the best possible mapping without