Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

CL
2000
Springer

favoriteEmaildiscussreport

98views Automated Reasoning» more CL 2000»

Linearly Bounded Reformulations of Conjunctive Databases

13 years 9 months ago

Linearly Bounded Reformulations of Conjunctive Databases

Download dbgroup.ncsu.edu

Rada Chirkova, Michael R. Genesereth

Real-time Traffic

Automated Reasoning | CL 2000 |

claim paper

Related Content

» Linearly Bounded Reformulations of Unary Databases

» Nondecomposable solutions to group equations and an application to polyhedral combinatoric...

» Query Evaluation via TreeDecompositions

» Mining discrete patterns via binary matrix factorization

» Optimizing Large Join Queries in Mediation Systems

» Aggregate Query Answering on Possibilistic Data with Cardinality Constraints

Post Info
More Details (n/a)

Added	02 Aug 2010
Updated	02 Aug 2010
Type	Conference
Year	2000
Where	CL
Authors	Rada Chirkova, Michael R. Genesereth

Comments (0)