Ontology debugging helps ontology engineers to find modelling errors in ontology. Most debugging methods relies on finding Minimal Unsatisfiability Preserving Sets (MUPS) inside an ontology.
Profiling applications are omnipresent in today's online life: product recommendations in online shops, personalised search platforms etc. Often, however, profiling systems fail to model the complexity of user interests and preferences in all their depth.
In this talk, I present recent work about algebraic measures of conflict in signed social networks. Signed networks are used to model conflict conflict in a social network, i.e., either direct negative relationships (represented by individual negative edges), or higher-level structures of conflict, such as a triangle consisting of two positive edges and one negative edge (I hate the friend of my friend.)
I will review the First International Competition on Computational Models of Argumentation (ICMMA’15) which evaluated submitted solvers performance on four different computational tasks related to solving abstract argumentation frameworks.
Graphs of social networks have reached sizes of billions of edges. The scale of these graphs poses challenges in their analysis. Most graph algorithms are data driven and memory-based approaches usually do not scale because of the limit in capacity of single machines.
Where people are looking indicates what they are processing cognitively. An eye-tracker makes possible to record the eye-movements, and BCI devices could capture the cognitive brain signals.
The Linked Open Data cloud can be a beautiful place for data scientists and data-driven application developers. However, with the vast amount of free and connected knowledge available, one can easily get lost managing to find the relevant information, juggling multiple ontologies, and handling varying quality of service.
Type systems are the most popular formal method of software engineering for ensuring that a system behaves correctly with regard to some specification. One informal definition of a (static) type system might be: “A type system is a tractable syntactic method for proving the absence of certain program behaviors by classifying phrases according to the kind of values they compute”.
Vandalism, environmental pollution or other damage to community property are among the daily problems, local communities have to deal with. In some countries governments use their residents to take on these problems.
Quite often, Linked Open Data (LOD) applications pre-fetch data from the Web and store local copies of it in a cache for faster access at runtime. Yet, recent investigations have shown that data published and interlinked on the LOD cloud is subject to frequent changes. As the data in the cloud changes, local copies of the data need to be updated.