Sciweavers

20 search results - page 1 / 4
» Transitive Closure and the LOGA -Strategy for its Efficient ...
Sort
View
MFDBS
1989
102views Database» more  MFDBS 1989»
13 years 9 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
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
13 years 6 months ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...
TVLSI
2002
161views more  TVLSI 2002»
13 years 4 months ago
Arbitrarily shaped rectilinear module placement using the transitive closure graph representation
In this paper, we deal with arbitrarily shaped rectilinear module placement using the transitive closure graph (TCG) representation. The geometric meanings of modules are transpare...
Jai-Ming Lin, Hsin-Lung Chen, Yao-Wen Chang
ECAI
2008
Springer
13 years 7 months ago
Extending the Knowledge Compilation Map: Closure Principles
We extend the knowledge compilation map introduced by Darwiche and Marquis with new propositional fragments obtained by applying closure principles to several fragments studied so...
Hélène Fargier, Pierre Marquis
VLDB
1993
ACM
121views Database» more  VLDB 1993»
13 years 9 months ago
Integrity Constraint and Rule Maintenance in Temporal Deductive Knowledge Bases
The enforcement of semantic integrity constraints in data and knowledge bases constitutea a major performance bottleneck. Integrity constraint simplification methods aim at reduci...
Dimitris Plexousakis