Sciweavers

221 search results - page 24 / 45
» Chase of Recursive Queries
Sort
View
AAAI
1990
13 years 8 months ago
Symbolic Probabilistic Inference in Belief Networks
The Symbolic Probabilistic Inference (SPI) Algorithm [D'Ambrosio, 19891 provides an efficient framework for resolving general queries on a belief network. It applies the conc...
Ross D. Shachter, Bruce D'Ambrosio, Brendan Del Fa...
MFDBS
1989
102views Database» more  MFDBS 1989»
13 years 11 months ago
Transitive Closure and the LOGA+-Strategy for its Efficient Evaluation
One of the key problems when extending relational database query languages to include deductive capabilities, is to provide them with efficient methods for answering recursive que...
W. Yan, Nelson Mendonça Mattos
FCT
1995
Springer
13 years 11 months ago
Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
Hristo Djidjev, Grammati E. Pantziou, Christos D. ...
EDBT
2000
ACM
13 years 11 months ago
A Data Model for Effectively Computable Functions
the research activities. This abstract is to introduce the approach of a data model - EP data model. Its data structure is able to store as a finite set of nodes arbitrary effectiv...
Kevin H. Xu
ICFP
2010
ACM
13 years 8 months ago
Bidirectionalizing graph transformations
Bidirectional transformations provide a novel mechanism for synchronizing and maintaining the consistency of information between input and output. Despite many promising results o...
Soichiro Hidaka, Zhenjiang Hu, Kazuhiro Inaba, Hir...