Sciweavers

2608 search results - page 27 / 522
» Inferring Answers to Queries
Sort
View
AAAI
2011
12 years 10 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
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...
Andrew Gelfand, Kalev Kask, Rina Dechter
SEMWEB
2009
Springer
14 years 4 months ago
Task Representation and Retrieval in an Ontology-Guided Modelling System
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...
SEMWEB
2009
Springer
14 years 4 months ago
Conjunctive Query Answering in Distributed Ontology Systems for Ontologies with Large OWL ABoxes
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...
Xueying Chen, Michel Dumontier
PLANX
2008
13 years 11 months ago
Complexity of Earliest Query Answering with Streaming Tree Automata
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 ...
Olivier Gauwin, Anne-Cécile Caron, Joachim ...
EDBT
2004
ACM
113views Database» more  EDBT 2004»
14 years 10 months ago
Hippo: A System for Computing Consistent Answers to a Class of SQL Queries
Jan Chomicki, Jerzy Marcinkowski, Slawomir Stawork...