On the complexity of single-rule datalog queries

Georg Gottlob، نويسنده , , Christos Papadimitriou، نويسنده ,

روزنامه با شماره پیاپی سال 2003

19

104

122

Sirup: clause implication , subsumption , Exponential time , Expressive power , Descriptive complexity , Linear recursion , Single rule program , datalog , complexity , Logic programming

Information and Computation

2003

Information and Computation

262139