Pointer analysis statically approximates the heap pointer structure during a program execution in order to track heap objects or to establish alias relations between references, a...
Lennart Beringer, Robert Grabowski, Martin Hofmann
Abstract. Ontology classification--the computation of subsumption hierarchies for classes and properties--is one of the most important tasks for OWL reasoners. Based on the algorit...
Birte Glimm, Ian Horrocks, Boris Motik, Giorgos St...
Text data pertaining to socio-technical networks often are analyzed separately from relational data, or are reduced to the fact and strength of the flow of information between node...
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
Abstract. While classical approaches to unsupervised morphology acquisition often rely on metrics based on information theory for identifying morphemes, we describe a novel approac...