%0 Journal Article %1 Dantsin:2001p92 %A Dantsin, Evgeny %A Eiter, Thomas %A Gottlob, Georg %A Voronkov, Andrei %D 2001 %J Computing Surveys (CSUR %K Complexity, datalog, expressive languages, logic logic, nonmonotonic power, programming query %N 3 %T Complexity and expressive power of logic programming %U http://portal.acm.org/citation.cfm?id=502807.502810 %V 33 %X This article surveys various complexity and expressiveness results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general ...

@article{Dantsin:2001p92, abstract = {This article surveys various complexity and expressiveness results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general ...}, added-at = {2009-05-14T02:56:30.000+0200}, author = {Dantsin, Evgeny and Eiter, Thomas and Gottlob, Georg and Voronkov, Andrei}, biburl = {https://www.bibsonomy.org/bibtex/21d866df4cf68943dc12965dfe27fb4eb/darkmatter}, date-added = {2009-05-09 02:34:37 +0200}, date-modified = {2009-05-09 02:40:47 +0200}, interhash = {96cc418d636e2ba4aa7727a411b83ec5}, intrahash = {1d866df4cf68943dc12965dfe27fb4eb}, journal = {Computing Surveys (CSUR}, keywords = {Complexity, datalog, expressive languages, logic logic, nonmonotonic power, programming query}, local-url = {file://localhost/Users/tonga/Documents/Papers%20Library/Papers/Complexity%20and%20expressive%20power%20of.pdf}, month = Sep, number = 3, pmid = {502807.502810}, rating = {0}, timestamp = {2009-05-14T02:56:31.000+0200}, title = {Complexity and expressive power of logic programming}, uri = {papers://B3A285F5-580C-4264-92DA-60ED4289CFF4/Paper/p92}, url = {http://portal.acm.org/citation.cfm?id=502807.502810}, volume = 33, year = 2001 }