Complexity and expressive power of logic programming

The Digital Librarian's Digital Library

DOCIS Documents in Computing and Information Science

Home >> Journals and Conference Proceedings >> ACM Computing Surveys

Complexity and expressive power of logic programming

Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov

Journal Title: ACM Computing Surveys

Date: 2001

Volume: 33

Issue: 3

p. 374 - 425

We have been looking for this document on the Web. We think we have found the following, freely available version(s) of it:

http://cs.roosevelt.edu/~dantsin/pdf/DEGV01.pdf

http://logic.pdmi.ras.ru/~dantsin/ps/DEGV01.ps

http://www.cs.man.ac.uk/~voronkov/papers/acmcs_lp_comp.ps

http://www.kr.tuwien.ac.at/staff/eiter/et-archive/ccc97.ps.gz

For further information about this item go to:

http://doi.acm.org/10.1145/502807.502810

This data comes from DBLP

This page is maintained by Angela Cornwell and Thomas Krichel.
It was last updated on 2006-04-12