Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
A modelling procedure consists of a sequence of modelling tasks. With the increasing size of models during the development, the relations among modelling objects and their correspo...
Yuan Ren, Jens Lemcke, Andreas Friesen, Tirdad Rah...
We present a query processing procedure for conjunctive queries in distributed ontology systems where a large ontology is divided into ontology fragments that are later distributed...
We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...