Sciweavers

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

91

SARA
2000
Springer

76views Artificial Intelligence» more SARA 2000»

Linearly Bounded Reformulations of Unary Databases

15 years 6 months ago

Linearly Bounded Reformulations of Unary Databases

Download dbgroup.ncsu.edu

Rada Chirkova, Michael R. Genesereth

Real-time Traffic

Artificial Intelligence | SARA 2000 |

claim paper

Related Content

» Linearly Bounded Reformulations of Conjunctive Databases

» On XML Integrity Constraints in the Presence of DTDs

» Monadic datalog over finite structures with bounded treewidth

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

» Mining discrete patterns via binary matrix factorization

Post Info
More Details (n/a)

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

Comments (0)