Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanis...
Keys for XML data trees can uniquely identify nodes based on the data values on some of their subnodes, either in the entire tree or relatively to some selected subtrees. Such keys...
Flavio Ferrarotti, Sven Hartmann, Sebastian Link, ...
: Data validation and cleaning are integral processes of the data quality management cycle. Domain specific knowledge is needed to detect and correct semantic errors. Ontologies c...
Abstract--Recent works proposed the adoption of a natureinspired approach of chemistry for implementing service architectures suitable for pervasive applications [34]. In particula...
Elena Nardini, Mirko Viroli, Matteo Casadei, Andre...
We present graded extension of the algorithm LinClosure. Graded LinClosure can be used to compute degrees of semantic entailment from sets of fuzzy attribute implications. It can a...